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.     

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.     

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

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

基于多时间尺度的城市轨道交通短时OD估计

基于状态空间模型构建了城市轨道交通短时OD估计的多模型组合方法,估计早晚高峰期间15 min内进站客流的去向目的站.组合模型以不同时间尺度下的进站客流分流率为状态变量,并利用历史数据预估其中通勤客流的分流率,然后通过交互多模型算法加权融合不同时间尺度下的分流率估计结果.以北京地铁为案例,研究表明:早高峰期间的15 min分流率估计误差的平均值和最大值分别为16.4%和21.8%,晚高峰期间分别为22.7%和24.6%,比既有文献的估计误差减小了约一半.本文的研究成果可为实时的线网客流分布预测提供更准确的输入数据,以辅助运营管理部门实现客流预警和应急响应.     

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真车实验的实施提供理论设计参考.     

基于大数据的大学校园停车系统规划 ——以大连理工大学凌水主校区为例

为解决大学校园停车系统混乱以及用于相关规划的基础数据样本量小、精度不高、时效性 差等问题，应用大学校园停车调查数据、各出入口车辆记录数据以及各院系教职工信息数据进行多源大数据分析，提出了一种基于大数据的大学校园停车系统规划方法。以大连理工大学凌水主 校区收集到的数据为例，首先从静态角度利用各出入口车辆记录数据和校园停车调查数据获取校园整体停车需求，进而利用各院系教职工信息数据分析各部门的停车需求。然后，从动态角度考虑停车位的周转问题，利用各出入口车辆记录数据分析校园出入车辆停车时段分布状况。最后，根据多源大数据分析所得校园停车系统现状，得出相应的校园停车系统规划结果。研究结果表 明：基于大数据的大学校园停车系统规划方法可有效解决传统方法中基础数据样本量小、精度不高、时效性差等问题，提高了规划结果的实用性和科学性。     

基于改进云模型的地铁站行人拥挤辨识方法

为降低城市地铁站内行人拥挤识别时多指标和多等级带来的不确定性和模糊性,采用改进云模型构建行人拥挤状态辨识模型。基于AHP-熵权法标定指标权重和行人拥挤状态等级,以标定的指标权重和各指标等级阈值作为输入,计算云数字特征值,采用正向正态云发生器,建立模板云和待识别云模型,计算两者之间的隶属度,根据最大隶属度原则辨识车站内各服务设施的行人拥挤状态,最后输出各服务设施的拥挤等级辨识结果。以宁波市鼓楼站为实证对象,对辨识结果进行实证分析。结果表明:采用四级行人拥挤状态划分方法合理可行。