首页|基于V2X的最快出行路径算法

基于V2X的最快出行路径算法

扫码查看
为了规避交通信号灯等待时间,基于V2X获取交通路网、实时路况及交通信号灯信息,综合考虑交通信号灯不同转向的等待时间差异,提出一种新型最快出行路径规划算法.该算法解决了交通信号灯不同转向等待时间差异对路径规划影响的问题,真正做到最短时间出行.在10000次道路行驶模拟实验中,与仅考虑驾驶时间(出行时间=驾驶时间+等待时间)的传统最快路径规划算法相比,本算法出行时间平均减少19.2%,等待时间平均减少62.4%,对节省公众出行时间、优化驾驶体验、降低交通交叉口事故率有重要意义.
The Fastest Travel Path Algorithm Based on V2X
In order to avoid waiting time for traffic signals,it proposes a new shortest path planning algorithm,which obtains traffic network,real-time traffic conditions and traffic signal information based on V2X,and considers the differences in the waiting time when waiting for traffic lights with different turns. This algorithm solves the problem that the differences between the waiting time when waiting for traffic lights with different turns have different impacts on path planning results,which truly realizes the shortest travel time on the road. In 10000 times road driving simulation experiments,compared with the traditional shortest path planning algorithm which only considers driving time(travel time=driving time+waiting time),the new algorithm proves that the average travel time is effectively reduced by 19.2%,and the average waiting time is reduced by 62.4%,which has important significance on saving public travel time,improving driving experience,and reducing accident rate at traffic intersections.

Fastest travelRoute planningTravel timeDijkstra algorithmDriving experience

徐铮、陈璟雯、陈聪、姜卿卿

展开 >

中国联通智网创新中心,北京100048

南京市测绘勘察研究院股份有限公司,江苏 南京210019

最快出行 路径规划 出行时间 Dijkstra算法 驾驶体验

2024

邮电设计技术
中讯邮电咨询设计院有限公司

邮电设计技术

影响因子:0.647
ISSN:1007-3043
年,卷(期):2024.(11)