Distributed MPC for cooperative highway driving and energy-economy validation via microscopic simulations

Traffic congestion and energy issues have set a high bar for current ground transportation systems. With advances in vehicular communication technologies, collaborations of connected vehicles have becoming a fundamental block to build automated highway transportation systems of high efficiency. This paper presents a distributed optimal control scheme that takes into account macroscopic traffic management and microscopic vehicle dynamics to achieve efficiently cooperative highway driving. Critical traffic information beyond the scope of human perception is obtained from connected vehicles downstream to establish necessary traffic management mitigating congestion. With backpropagating traffic management advice, a connected vehicle having an adjustment intention exchanges control-oriented information with immediately connected neighbors to establish potential cooperation consensus, and to generate cooperative control actions. To achieve this goal, a distributed model predictive control (DMPC) scheme is developed accounting for driving safety and efficiency. By coupling the states of collaborators in the optimization index, connected vehicles achieve fundamental highway maneuvers cooperatively and optimally. The performance of the distributed control scheme and the energy-saving potential of conducting such cooperation are tested in a mixed highway traffic environment by the means of microscopic simulations.     

基于传播模型的非机动车违规过街行为研究

为研究信号交叉口非机动车违规过街行为，选取西安市的7个信号交叉口，通过视频拍摄获取资料，应用复杂网络来分析非机动车网络的结构特征和演化规律.建立了交叉口非机动车网络，基于SI模型的基本思想，提出了非机动车违规过街行为的传播模型.并通过python程序进行模拟分析，在不同的网络结构和不同的传播率下，获取了非机动车违规过街的行为趋势.结果表明：随着等待时间的增加，一旦有骑行者闯红灯，更多的骑行者将加入到违规过街的行列；在内向度和外向度方面，电动自行车均高于普通自行车；非机动车违规行为随着传播率及非机动车流量的增加而增加.     

Urban single-lane roundabouts: A new analytical approach using multi-criteria and simultaneous multi-objective optimization of geometry design,efficiency and safety

Building safe and effective roundabouts requires optimizing traffic (operational) efficiency (TE) and traffic safety (TS) while taking into account geometric factors, traffic characteristics and local constraints. Most existing simulation-based optimization models do not simultaneously optimize all these factors. To capture the relationship among geometry, efficiency and safety, we put forward a model formulation in this paper. We present a new multi-criteria and simultaneous multi-objective optimization (MOO) model approach to optimize geometry, TE and TS of urban unsignalized single-lane roundabouts. To the best of our knowledge, this is the first model that uses the multi-criteria decision-making method known as analytic hierarchy process to evaluate and rank traffic parameters and geometric elements of urban single-lane roundabouts. The model was built based on comprehensive review of the research literature and existing roundabout simulation software, a field survey of 61 civil and traffic expert engineers in Croatia, and field studies of roundabouts in the Croatian capital city of Zagreb. We started from the basis of Kimber’s capacity model, HCM2010 serviceability model, and Maycock and Hall's accident prediction model, which we extended by adding sensitivity analysis and powerful MOO procedures of the bounded objective function method and interactive optimization. Preliminary validation of the model was achieved by identifying the optimal and most robust of three geometric alternatives (V.1-V.3) for an unsignalized single-lane roundabout in Zagreb, Croatia. The geometric parameters in variant V.1 had significantly higher values than in the existing design V.0, while approaches 1 and 3 in variant V.2 were enlarged as much as possible within allowed spatial limits and Croatian guidelines, reflecting their higher traffic demand. Sensitivity analysis indicated that variant V.2 showed the overall highest TE and TS across the entire range of traffic flow demand and pedestrian crossing flow demand at approaches. At the same time, the number of predicted traffic accidents was similar for all three variants, although it was lowest overall for V.2. The similarity in predicted accident frequency for the three variants suggests that V.2 provides the greatest safety within the predefined constraints and parameter ranges explored in our study. These preliminary results suggest that the proposed model can optimize geometry, TE and TS of urban single-lane roundabouts.     

W-SPSA in practice: Approximation of weight matrices and calibration of traffic simulation models

The development and calibration of complex traffic models demands parsimonious techniques, because such models often involve hundreds of thousands of unknown parameters. The Weighted Simultaneous Perturbation Stochastic Approximation (W-SPSA) algorithm has been proven more efficient than its predecessor SPSA (Spall, 1998), particularly in situations where the correlation structure of the variables is not homogeneous. This is crucial in traffic simulation models where effectively some variables (e.g. readings from certain sensors) are strongly correlated, both in time and space, with some other variables (e.g. certain OD flows). In situations with reasonably sized traffic networks, the difference is relevant considering computational constraints. However, W-SPSA relies on determining a proper weight matrix (W) that represents those correlations, and such a process has been so far an open problem, and only heuristic approaches to obtain it have been considered.This paper presents W-SPSA in a formally comprehensive way, where effectively SPSA becomes an instance of W-SPSA, and explores alternative approaches for determining the matrix W. We demonstrate that, relying on a few simplifications that marginally affect the final solution, we can obtain W matrices that considerably outperform SPSA. We analyse the performance of our proposed algorithm in two applications in motorway networks in Singapore and Portugal, using a dynamic traffic assignment model and a microscopic traffic simulator, respectively.     

高速路网不停车收费车道优化布设方法

合理设置高速公路收费站ETC (Electronic Toll Collection)车道数量，对高速公路通行效率至关重要。针对目前路网中ETC与MTC (Manual Toll Collection)车辆混行的情况，考虑ETC的普及率，结合多用户路网均衡模型和排队论方法，建立基于双层规划模型的高速路网ETC车道优化布设方法。上层模型以车辆总通行时间最小为目标，优化设置进出收费站的ETC车道数量；下层模型为多用户路网均衡模型，反映ETC和MTC车辆的路径和收费车道选择行为。下层模型通过设计收费站的等价拓扑结构，表征收费站的车道使用规则及车辆的收费车道选择行为，并采用排队论方法估计ETC和MTC车道的收费排队时间。根据模型的特点设计了基于主动集的启发式算法，利用参数二进制与拉格朗日函数法确定迭代下降方向，解决了下降方向与步长难以计算的问题；通过内嵌优化函数的方式，保证在主动集转化过程中上层约束均不会失效，且避免了迭代过程中的模型解退化问题。基于上海市绕城高速进行实证分析，结果表明：随着ETC普及率的提升，收费排队时长按照负指数趋势下降；与按比例布设ETC车道的方法相比，所提方法最高可降低57.4%的收费排队时间，且该方法可以避免ETC车道布设过多对于MTC车道通行能力挤压造成的负面效果。研究成果可以有效指导高速路网ETC车道的布设，提高路网通行效率。     

城市大型医院周边道路交通问题剖析及改善对策——以深圳市为例

为了合理科学组织医院周边及内部交通,避免重现目前深圳大型医院周边普遍存在的交通拥堵、停车困难、进院车辆排队、的士乘坐不便等交通问题,以深圳市为例,分析现状大型医院周边存在的道路交通问题和产生原因,提出完善周边道路交通设施、大力发展公共交通、合理规划医院布局、建立科学有效的交通组织体系等改善对策.     

Formal scientific research of traffic collision data utilizing GIS

This paper explores the tenuous link between speeding behavior and accident causation, one that has not been well established in the international literature to date. Taking advantage of established engineering conventions and formulae, we were able to set up an a priori hypothesis suitable for testing. Utilizing this formal scientific method (which GIS researchers have been criticised for not using) we establish a statistical link for this relationship. Our methodology can be used to support all police intervention strategies, including the controversial photo radar systems. The results from our research have been entered into a GIS in order to create a map for spatial display. This map illustrates the relative probability or risk of collision occurrence resulting from speeding at all intersections and interchanges within the scope of the study. It is suggested that this methodology could easily be maintained with periodic updates of data, thus creating a dynamic model from which to monitor traffic safety within the city. Furthermore, this model can be utilized to study specific strategies, allowing for the scrutiny of before, during and after effects. The study area is the entire city of Calgary, Alberta, Canada, and includes all traffic collisions occurring during the year of 1994.     

Signal control optimization for automated vehicles at isolated signalized intersections

Traffic signals at intersections are an integral component of the existing transportation system and can significantly contribute to vehicular delay along urban streets. The current emphasis on the development of automated (i.e., driverless and with the ability to communicate with the infrastructure) vehicles brings at the forefront several questions related to the functionality and optimization of signal control in order to take advantage of automated vehicle capabilities. The objective of this research is to develop a signal control algorithm that allows for vehicle paths and signal control to be jointly optimized based on advanced communication technology between approaching vehicles and signal controller. The algorithm assumes that vehicle trajectories can be fully optimized, i.e., vehicles will follow the optimized paths specified by the signal controller. An optimization algorithm was developed assuming a simple intersection with two single-lane through approaches. A rolling horizon scheme was developed to implement the algorithm and to continually process newly arriving vehicles. The algorithm was coded in MATLAB and results were compared against traditional actuated signal control for a variety of demand scenarios. It was concluded that the proposed signal control optimization algorithm could reduce the ATTD by 16.2–36.9% and increase throughput by 2.7–20.2%, depending on the demand scenario.     

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.     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.