Dynamic activity-travel assignment in multi-state supernetworks

The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.     

Stability of transportation networks under adaptive routing policies

Growing concerns regarding urban congestion, and the recent explosion of mobile devices able to provide real-time information to traffic users have motivated increasing reliance on real-time route guidance for the online management of traffic networks. However, while the theory of traffic equilibria is very well-known, fewer results exist on the stability of such equilibria, especially in the context of adaptive routing policy. In this work, we consider the problem of characterizing the stability properties of traffic equilibria in the context of online adaptive route choice induced by GPS-based decision making. We first extend the recent framework of “Markovian Traffic Equilibria” (MTE), in which users update their route choice at each intersection of the road network based on traffic conditions, to the case of non-equilibrium conditions, while preserving consistency with known existence and uniqueness results on MTE. We then exhibit sufficient conditions on the network topology and the latency functions for those MTEs to be stable in the sense of Lyapunov for a single destination problem. For various more restricted classes of network topologies motivated by the observed properties of travel patterns in the Singapore network, under certain assumptions we prove local exponential stability of the MTE, and derive analytical results on the sensitivity of the characteristic time of convergence to network and traffic parameters. The results proposed in this work are illustrated and validated on synthetic toy problems as well as on the Singapore road network with real demand and traffic data.     

冰雪条件下中国驾驶员跟驰行为及模型研究

分析驾驶员在冰雪条件下的驾驶行为特性，建立考虑驾驶员行为特性的跟驰模型，有助于丰富现有交通流理论.通过招募驾驶员开展实车跟驰试验，对比分析正常条件与冰雪条件下的驾驶行为差异.进而基于任务难度均衡理论构建包含人类因素参数的任务难度模块，引入改进后的智能驾驶员模型，并采用车辆轨迹数据对模型进行标定和有效性验证.研究表明：驾驶员在跟驰行驶过程中受外界刺激及自身驾驶能力影响时会对车辆行驶状态进行动态调整，试图保持期望间距，且速度与前车一致的状态；冰雪条件下驾驶员采取风险补偿行为，其车头时距波动幅度较正常条件收窄，模型引入人类因素参数可以较好地描述其差异性. 模型有效性验证表明，新模型在6个仿真场景中的表现都优于传统智能驾驶员模型，且表现出更好的鲁棒性.研究结果可为冰雪条件下的交通管理措施制定提供理论支持.     

激光探测与测量视觉技术在堆取料机全自动控制中的应用

针对散货料场堆取料机人工操作堆取作业随意性大、精度差、效率低等现状,设计了一种堆取料机全自动控制系统。该系统基于激光雷达(Lidar)机器视觉技术,通过3D激光扫描仪实时获取料堆形状的点云数据,并完成对目标料堆的在线实时建模,最后控制堆取料机完成自动作业;提出了一种基于视觉图像处理算法的作业路径规划算法,通过实时提前预测作业轨迹来指导堆取料机自动作业。实践表明该控制系统提高了设备的作业效率,降低了作业成本。     

驾驶人“感知-决策-操控”行为模型

为准确模拟驾驶人跟车行为，提出基于隐马尔可夫模型(Hidden Markov Model，HMM)的驾驶人“感知-决策-操控”行为模型。建立描述驾驶意愿的HMM模型，模拟驾驶人感知过程，获得期望的车间距；预测模块模拟驾驶人根据交通环境和自身生理、心理状态预测车辆未来轨迹，即决策过程；优化模块描述驾驶人为使预测的车辆轨迹跟踪上期望的车辆间距而采取的操控汽车的执行动作，即操控过程。上述3个模块的滚动过程实现了对驾驶人跟车行为的模拟。利用自然驾驶数据进行算例分析，结果表明，本文模型预测车间距平均误差仅为1.47%，证明了所建模型的有效性及准确性。本文为驾驶行为建模方法的理论研究和应用拓宽了思路。     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

基于船模水池试验的船舶顺浪纯稳性损失计算扩展模式

船舶顺浪航行的纯稳性损失研究,已成为国际航海界和国际海事组织(IMO)关注的课题之一.在Ю.И.涅查耶夫根据28艘渔船和运输船船模水池试验的船舶顺浪纯稳性损失计算方法的基础上,提出了扩展模式,扩大了其适用范围,并给出了大长宽比(船长/船宽)舰艇纯稳性损失的算例,同时实现了该扩展模式的程序化,生成了实用化的软件.最后通过与CFD试验方法和一般理论计算法所得结果的对比,验证了该扩展模式计算结果的可信度.     

基于向量Liapunov函数的时滞车辆跟随系统稳定性分析

为了提高自动化高速公路车辆纵向跟随控制系统的稳定性,建立了关于车辆跟随误差的具有时间滞后的无限维非线性关联大系统模型,应用向量李雅普诺夫函数对大系统的稳定性进行了分析。以大系统的孤立子系统的稳定性条件为基础,在假定系统满足全局Lipschitz条件的情况下,得到了此类大系统指数稳定的充分性判据。该判据是与时间滞后量无关的显式判据,可方便地应用于车辆纵向跟随控制器的设计。     

数控车削加工仿真系统的研究与实现

介绍一个数控车床加工仿真系统,系统实现了对数控代码的词法、语法检验并将代码翻译成动画仿真所需的数据格式．通过在计算机上动画演示加工过程来检验数控代码的正确性．使用该系统可以实现高效率、低成本的培训．     

多目标最短路径模型及算法

为获得满足决策者需要的多目标最短路径问题的有效路径,建立了多目标最短路径模型,并提出了综合k-最短路径算法和多目标格序决策方法的多项式算法.该算法根据决策者可以接受的各单目标的上限,用k-最短路径算法,分别确定各单目标的可行路径集及其交集.再用多目标格序决策方法,比较交集中的有效路径,最终获得决策者满意的路径.