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.     

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.     

Studying the benefits of carpooling in an urban area using automatic vehicle identification data

Carpooling has been considered a solution for alleviating traffic congestion and reducing air pollution in cities. However, the quantification of the benefits of large-scale carpooling in urban areas remains a challenge due to insufficient travel trajectory data. In this study, a trajectory reconstruction method is proposed to capture vehicle trajectories based on citywide license plate recognition (LPR) data. Then, the prospects of large-scale carpooling in an urban area under two scenarios, namely, all vehicle travel demands under real-time carpooling condition and commuter vehicle travel demands under long-term carpooling condition, are evaluated by solving an integer programming model based on an updated longest common subsequence (LCS) algorithm. A maximum weight non-bipartite matching algorithm is introduced to find the optimal solution for the proposed model. Finally, road network trip volume reduction and travel speed improvement are estimated to measure the traffic benefits attributed to carpooling. This study is applied to a dataset that contains millions of LPR data recorded in Langfang, China for 1 week. Results demonstrate that under the real-time carpooling condition, the total trip volumes for different carpooling comfort levels decrease by 32–49%, and the peak-hour travel speeds on most road segments increase by 5–40%. The long-term carpooling relationship among commuter vehicles can reduce commuter trips by an average of 30% and 24% in the morning and evening peak hours, respectively, during workdays. This study shows the application potential and promotes the development of this vehicle travel mode.     

Commuter ride-sharing using topology-based vehicle trajectory clustering: Methodology,application and impact evaluation

This paper illustrates a ride matching method for commuting trips based on clustering trajectories, and a modeling and simulation framework with ride-sharing behaviors to illustrate its potential impact. It proposes data mining solutions to reduce traffic demand and encourage more environment-friendly behaviors. The main contribution is a new data-driven ride-matching method, which tracks personal preferences of road choices and travel patterns to identify potential ride-sharing routes for carpool commuters. Compared with prevalent carpooling algorithms, which allow users to enter departure and destination information for on-demand trips, the proposed method focuses more on regular commuting trips. The potential effectiveness of the approach is evaluated using a traffic simulation-assignment framework with ride-sharing participation using the routes suggested by our algorithm. Two types of ride-sharing participation scenarios, with and without carpooling information, are considered. A case study with the Chicago tested is conducted to demonstrate the proposed framework’s ability to support better decision-making for carpool commuters. The results indicate that with ride-matching recommendations using shared vehicle trajectory data, carpool programs for commuters contribute to a less congested traffic state and environment-friendly travel patterns.     

基于自适应模糊控制的AGV轨迹跟踪系统

针对传统控制方式难以准确完成AGV轨迹跟踪任务这一问题,提出一种基于自适应模糊控制的轨迹跟踪方法.首先建立AGV的运动学模型,并基于李雅普诺夫第二法设计控制律.其次,以期望轨迹与实际轨迹的位姿偏差作为输入,以控制律中的比例因子作为输出,设计自适应模糊控制器.最后,使用Matlab/Simulink对设计的控制系统进行仿...     

智能汽车换道轨迹规划曲线研究

目前随着信息化、数据化、自动化、智能化越来越深入,智能网联汽车也在飞速发展,在车辆换道的过程中,轨迹规划曲线就显得十分重要,直接决定换道的安全性、舒适性、效率等。随着轨迹规划曲线的发展,先后有人工势场法,曲线拟合法,搜索算法等方法,利用曲线拟合法进行轨迹规划也是当今智能车辆领域最常用的方法之一,通过给定的车辆的起始点和终点生成连续、舒适、满足动力性要求的曲线,并对曲线拟合的各个方法的优缺点进行比较分析。     

基于模型预测控制的智能车轨迹跟踪控制研究

为了完成智能车的轨迹跟踪,提出一种基于模型预测控制的轨迹跟踪方法,利用将运动学模型这个非线性系统线性化的方案,来获得必须的线性时变系统,采取模型预测控制的三要素来设计控制器。并且基于MPC在控制过程中能增加多种约束的优点,建立基于车辆运动学模型的约束做轨迹跟踪仿真实验,最后,基于山东理工大学智能车平台上GPS提供的定位信息,在校园中采集路线并对前提规划好的的轨迹进行实车验证。实验结果表明:基于MPC算法所设计的控制器能快速且稳定地跟踪期望轨迹。     

带扰动观测器的船舶轨迹跟踪自适应动态面滑模控制

针对遭受未知外部环境扰动的三自由度全驱动船舶轨迹跟踪控制问题,设计一种带扰动观测器的自适应动态面滑模控制方法。该方法构造扰动观测器估计未知扰动,并对控制量进行前馈补偿,采用σ修正泄漏项的自适应律估计扰动观测误差的界以提高控制精度,结合动态面技术解决传统反演法的微分爆炸问题,并选取李雅普诺夫函数证明该控制器可保证闭环系统内所有信号的一致最终有界性。基于一艘供给船舶进行仿真试验,结果表明,所设计的控制器输出合理有效且跟踪精度高,在工程实际中具有一定的参考价值。     

落实科学发展观 提高辽宁辖区船舶溢油应急处置能力

船舶数量的增多和船舶大型化，使海上因船舶交通事故引发的船舶溢油风险概率大增。一直以来。由于我国对船舶溢油应急处置能力建设的滞后，有效应对海上溢油尤其是突发性重大溢油事故的能力还很弱，因此，尽快提高溢油应急处置能力具有重大的现实意义。文中从提高对船舶溢油应急处置能力重要性的认识出发。科学分析了造成应急处置能力低的根源，并从落实科学发展观的角度，具体提出了有效提高海上溢油应急处置能力的方法和途径。