Model based urban traffic control,part II: Coordinated model predictive controllers

The present paper describes how to use coordination between neighbouring intersections in order to improve the performance of urban traffic controllers. Both the local MPC (LMPC) introduced in the companion paper (Hao et al., 2018) and the coordinated MPC (CMPC) introduced in this paper use the urban cell transmission model (UCTM) (Hao et al., 2018) in order to predict the average delay of vehicles in the upstream links of each intersection, for different scenarios of switching times of the traffic lights at that intersection. The feedback controller selects the next switching times of the traffic light corresponding to the shortest predicted average delay. While the local MPC (Hao et al., 2018) only uses local measurements of traffic in the links connected to the intersection in comparing the performance of different scenarios, the CMPC approach improves the accuracy of the performance predictions by allowing a control agent to exchange information about planned switching times with control agents at all neighbouring intersections. Compared to local MPC the offline information on average flow rates from neighbouring intersections is replaced in coordinated MPC by additional online information on when the neighbouring intersections plan to send vehicles to the intersection under control. To achieve good coordination planned switching times should not change too often, hence a cost for changing planned schedules from one decision time to the next decision time is added to the cost function. In order to improve the stability properties of CMPC a prediction of the sum of squared queue sizes is used whenever some downstream queues of an intersection become too long. Only scenarios that decrease this sum of squares of local queues are considered for possible implementation. This stabilization criterion is shown experimentally to further improve the performance of our controller. In particular it leads to a significant reduction of the queues that build up at the edges of the traffic region under control. We compare via simulation the average delay of vehicles travelling on a simple 4 by 4 Manhattan grid, for traffic lights with pre-timed control, traffic lights using the local MPC controller (Hao et al., 2018), and coordinated MPC (with and without the stabilizing condition). These simulations show that the proposed CMPC achieves a significant reduction in delay for different traffic conditions in comparison to these other strategies.     

Large-scale dynamic transportation network simulation: A space-time-event parallel computing approach

This paper describes a computationally efficient parallel-computing framework for mesoscopic transportation simulation on large-scale networks. By introducing an overall data structure for mesoscopic dynamic transportation simulation, we discuss a set of implementation issues for enabling flexible parallel computing on a multi-core shared memory architecture. First, we embed an event-based simulation logic to implement a simplified kinematic wave model and reduce simulation overhead. Second, we present a space-time-event computing framework to decompose simulation steps to reduce communication overhead in parallel execution and an OpenMP-based space-time-processor implementation method that is used to automate task partition tasks. According to the spatial and temporal attributes, various types of simulation events are mapped to independent logical processes that can concurrently execute their procedures while maintaining good load balance. We propose a synchronous space-parallel simulation strategy to dynamically assign the logical processes to different threads. The proposed method is then applied to simulate large-scale, real-world networks to examine the computational efficiency under different numbers of CPU threads. Numerical experiments demonstrate that the implemented parallel computing algorithm can significantly improve the computational efficiency and it can reach up to a speedup of 10 on a workstation with 32 computing threads.     

A two-dimensional simulation model for modelling turning vehicles at mixed-flow intersections

The turning behavior is one of the most challenging driving maneuvers under non-protected phase at mixed-flow intersections. Currently, one-dimensional simulation models focus on car-following and gap-acceptance behaviors in pre-defined lanes with few lane-changing behaviors, and they cannot model the lateral and longitudinal behaviors simultaneously, which has limitation in representing the realistic turning behavior. This paper proposes a three-layered “plan-decision-action” (PDA) framework to obtain acceleration and angular velocity in the turning process. The plan layer firstly calculates the two-dimensional optimal path and dynamically adjusts the trajectories according to interacting objects. The decision layer then uses the decision tree method to select a suitable behavior in three alternatives: car-following, turning and yielding. Finally, in the action layer, a set of corresponding operational models specify the decided behavior into control parameters. The proposed model is tested by reproducing 210 trajectories of left-turn vehicles at a two-phase mixed-flow intersection in Shanghai. As a result, the simulation reproduces the variation of trajectories, while the coverage rate of the trajectories is 88.8%. Meanwhile, both the travel time and post-encroachment time of simulation and empirical turning vehicles are similar and do not show statistically significant difference.     

Field tests of a dynamic green driving strategy based on inter-vehicle communication

This paper presents the design and results for field tests regarding the environmental benefits in stop-and-go traffic of an algorithmic green driving strategy based on inter-vehicle communication (IVC), which was proposed in Yang and Jin (2014). The green driving strategy dynamically calculates advisory speed limits for vehicles equipped with IVC devices so as to smooth their speed profiles and reduce their emissions and fuel consumption. For the field tests, we develop a smartphone-based IVC system, in which vehicles’ speeds and locations are collected by GPS and accelerometer sensors embedded in smartphones, and communications among vehicles are enabled by specially designed smartphone applications, a central server, and 4G cellular networks. Six field tests are carried out on an uninterrupted ring road under slow or fast stop-and-go traffic conditions. We compare the performances of three alternatives: no green driving, heuristic green driving, and the IVC-based algorithmic green driving. Results show that heuristic green driving has better smoothing and environmental effects than no green driving, but the IVC-based algorithmic green driving outperforms both. In the future, we are interested in field tests under more realistic traffic conditions.     

Conflict-free arrival and departure trajectory planning for parallel runway with advanced point-merge system

In this paper, an efficient trajectory planning system is proposed to solve the integration of arrivals and departures on parallel runways with a novel route network system. Our first effort is made in designing an advanced Point Merge (PM) route network named Multi-Level Point Merge (ML-PM) to meet the requirements of parallel runway operations. Then, more efforts are paid on finding a complete and efficient framework capable of dynamically modelling the integration of arrival and departure trajectories on parallel runways, modelling the conflict detection and resolution in presence of curved trajectory and radius-to-fix merging process. After that, a suitable mathematical optimization formulation is built up. Receding Horizon Control (RHC) and Simulated Annealing (SA) algorithms are proposed to search the near-optimal solution for the large scale trajectories in routine dense operations. Taking Beijing Capital International Airport (BCIA) as a study case, the experimental results show that our system shows good performances on the management of arrivals and departures. It can automatically solve all the potential conflicts in presence of dense traffic flows. With its unique ML-PM route network, it can realize a shorter flying time and a near-Continuous Descent Approach (CDA) descent for arrival aircraft, an economical climbing for departure aircraft, an easier runway allocation together with trajectory control solutions. It shows a good and dynamic sequencing efficiency in Terminal Manoeuvring Area (TMA). In mixed ML-PM mode, under tested conditions, our proposed system can increase throughput at BCIA around 26%, compared with baseline. The methodology defined here could be easily applied to airports worldwide.     

铁路路基动态变形模量的数值模拟分析

介绍铁路路基动态变形模量理论计算公式的推导及动态变形模量的测试原理,采用有限元软件模拟动态变形模量的测试过程,分析承载板与土体接触压力、路基动态变形模量的影响因素,并计算动态变形模量的有效测试深度.结果表明:在承载板中心一定范围内,接触压力模拟结果较理论计算值大;土体的动弹性模量对接触压力影响很小,可以忽略;路基动态变形模量测试冲击荷载作用下,土体只发生弹性变形;动态变形模量与土体动弹性模量呈线性关系,路基动态变形模量的模拟结果大于理论计算值;土体的泊松比对动态变形模量影响较小;动态变形模量有效测试深度建议取0.5~0.6 m.     

上海松江区现代有轨电车规划研究

现代有轨电车因其环保、舒适、高效、低造价、高品质等特点,在国际上得到广泛应用,我国多个城市也在规划和建设之中。但是,由于其在国内尚为一种全新的交通方式,没有标准或规范予以指导,规划及设计体系不完善,有些已建项目已呈现问题。文章结合上海松江区规划背景及交通特征,阐述有轨电车示范线T1、T2线的布局规划、建设的必要性及适应性,为即将开展有轨电车规划及建设的城市提供借鉴与参考。     

CACC车头时距与混合交通流稳定性的解析关系

研究协同自适应巡航控制(Cooperative Adaptive Cruise Control，CACC)车头时距对不同CACC比例下混合交通流稳定性的影响关系，进而为CACC车头时距设计提供参考. 应用优化速度模型(Optimal Velocity Model，OVM)作为手动车辆的跟驰模型，PATH真车实验标定的模型作为CACC车辆的跟驰模型. 基于传递函数理论，推导混合交通流稳定性判别条件，计算关于CACC比例与平衡态速度的混合交通流稳定域. 分析混合交通流在任意速度下稳定所需满足的临界CACC比例与CACC车头时距的解析关系，提出随CACC比例增加的可变 CACC车头时距设计策略，并通过数值仿真实验验证所提可变CACC车头时距策略的正确性. 研究结果表明：在所提可变CACC车头时距策略下，CACC车头时距随CACC比例增加而逐渐降低，避免取值较大影响混合交通流通行能力的提升；当CACC比例大于35%时，混合交通流在任意速度下稳定.研究结果可为大规模CACC真车实验的实施提供理论设计参考.