Design,analysis and performance evaluation of a third order distributed protocol for platooning in the presence of time-varying delays and switching topologies

This paper is concerned with the problem of designing a decentralized consensus protocol for platooning of non-identical vehicles in the presence of heterogeneous time-varying communication delays. The proposed control protocol makes use of a state feedback and to this aim drivetrain dynamics are modeled as third-order linear systems. Necessary and sufficient conditions for convergence and exponential stability, derived by using an appropriate Krasovskii functional, demonstrate the ability of the platoon in reaching the required regime with an exponentially bounded behavior. The proposed LMI-based approach allows to estimate both delay margin and decay rate. Moreover, convergence is proven under switching communication network topologies by means of a Lyapunov-Razumikhin function, and the assessment of a string stable behavior has been also theoretically investigated. High-fidelity simulations with Plexe show the effectiveness of the theoretical results in different driving conditions and in the presence of external disturbances and communication impairment. Different communication channel models are used in the validation stage to further prove robustness of the proposed methodology with respect hard delay and packets losses.     

Plate scanning tools to obtain travel times in traffic networks

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.     

The Kalker book of tables for non-Hertzian contact of wheel and rail

A new regularisation of non-elliptical contact patches has been introduced, which enables building the look-up table called by us the Kalker book of tables for non-Hertzian contact (KBTNH), which is a fast creep force generator that can be used by multibody dynamics system simulation programs. The non-elliptical contact patch is regularised by a simple double-elliptical contact region (SDEC). The SDEC region is especially suitable for regularisation of contact patches obtained with approximate non-Hertzian methods for solving the normal contact problem of wheel and rail. The new regularisation is suitable for wheels and rails with any profiles, including worn profiles.

The paper describes the new procedure of regularisation of the non-elliptical contact patch, the structure of the Kalker book of tables, and parameterisation of the independent variables of the tables and creep forces.

A moderate volume Kalker book of tables for SDEC region suitable for simulation of modern running gears has been computed in co-simulation of Matlab and program CONTACT.

To access the creep forces of the Kalker book of tables, the linear interpolation has been applied.

The creep forces obtained from KBTNH have been compared to those obtained by program CONTACT and FASTSIM algorithm. FASTSIM has been applied on both the contact ellipse and the SDEC contact patch. The comparison shows that KBTNH is in good agreement with CONTACT for a wide range of creepage condition and shapes of the contact patch, whereas the use of FASTSIM on the elliptical patch and SDEC may lead to significant deviations from the reference CONTACT solutions.

The computational cost of calling creep forces from KBTNH has been estimated by comparing CPU time of FASTSIM and KBTNH. The KBTNH is 7.8–51 times faster than FASTSIM working on 36–256 discretisation elements, respectively.

In the example of application, the KBTNH has been applied for curving simulations and results compared with those obtained with the creep force generator employing the elliptical regularisation. The results significantly differ, especially in predicted creepages, because the elliptical regularisation neglects generation of the longitudinal creep force by spin creepage.     

珠三角科技型小微企业协同创新网络的构建

珠三角地区作为我国重要的城市群之一,拥有众多的小微企业,这些企业的发展模式受到大家重视和关注。文中首先分析了珠三角科技型小微企业协同创新存在的问题,提出协同创新网络的构建是解决当前一些问题的有效措施;其次,在协同创新网络的构建中,分析了构建的主体要素、构建的模式、构建的过程和具体的构建框架;最后分析了构建后的协同创新网络的特征。     

基于VDI2230-2003标准的动车组车钩联接螺栓强度分析

使用ANSYS软件对某车钩安装座及其联接螺栓进行接触非线性静强度计算,在此基础上基于德国《VDI2230-2003螺栓强度校核标准》对螺栓进行强度评估,并和传统《机械设计手册》计算的结果进行比较,得出两种方法的计算值均满足强度要求,同时前者计算的轴向拉应力水平为后者计算的应力水平的72%,但剪切应力两者相同.     

基于神经网络和遗传算法的系泊线长度参数优化

摘 要: 针对多成分系泊线三段长度如何取值的问题,采用一种基于神经网络和遗传算法对深海多成分锚泊系统长度进行优化。应用AQWA软件计算多点系泊FPSO,其时域结果直接用于训练BP神经网络。从而利用神经网络的非线性映射功能构建替代锚泊时域计算网络,大大缩短了优化所需的时间。以FPSO最小平面运动值为目标函数,锚链破断强度作为约束条件,采用遗传算法优化系泊长度。计算结果表明,与传统设计的锚泊长度相比,优化后FPSO在各个浪向下纵荡横荡值均能减少20%以上。 关键词:系泊;神经网络;遗传算法;优化     

基于无线传感器网络的运动目标检测动态聚类图

有效的目标跟踪需要积极的传感器节点对运动目标群实行跟踪。与单目标跟踪相比,聚类在效能上有显著提高。本文提出准确的相干和非相干运动模式下目标的聚类,采用隐式动态时间框架来评估在创建连接组件加权图的目标关系史。该算法采用目标跟踪中定位算法的关键特征,即估计当前和预测的位置来确定移动目标的方向和距离的关系。模拟结果显示,通过动态调整历史窗口大小和预测目标之间的关系,可以显著提高聚类的准确性并减少运算时间。     

基于MapBasic的战时运输最优路径问题研究

战时运输最优路径问题是一个多目标多约束随机动态路网寻优问题。在分析战时运输最优路径问题特性前提下,着重研究战时运输路阻函数模型,求出时间阻抗、风险阻抗和费用阻抗,标定阻抗参数μ1,μ2和μ3,及确定函数模型的MapBasic表达,在给出最优路径模型基础上,利用改进的Dijkstra算法求解。实例验证表明研究成果满足实用要求。     

北美铁路降低轮轨接触应力新进展

介绍了北美铁路在降低轮轨接触应力和轮轨作用力方面的研究成果.     

对ANN技术表达船体曲线算法的改进

应用人工神经元网络（ANN）技术表达船体曲线。根据问题性质,选用小波基作为前向单层神经网络的神经元激励函数,结合逐层学习（OHLO）算法对一艘3．6万吨散货船的后半体进行了表达。编程运算结果表明,该方法速度较传统的BP算法有较大提高。