计算机科学
预订
路径(计算)
运动规划
流量(计算机网络)
透视图(图形)
实时计算
叠加原理
任意角度路径规划
交通拥挤
运输工程
数学优化
运筹学
模拟
计算机网络
人工智能
工程类
数学
数学分析
机器人
作者
Daocheng Fu,Pinlong Cai,Yilun Lin,Ming Song,Licheng Wen,Yikang Li
标识
DOI:10.1016/j.physa.2023.128914
摘要
Previous work assumes that traffic flow evolves over time, and paths are planned based on traffic estimation and prediction, although such an assumption is simple and efficient for single vehicles, there is a self-contradictory problem when planning paths for multiple vehicles. If multiple vehicles choose the same uncongested road based on traffic forecasts, this may lead to congestion on that road, which in turn affects the efficiency of path planning. The V2X environment offers the possibility to solve the above problems. In this paper, a new perspective is developed where the traffic flow is considered as a superposition of spatiotemporal paths. From this perspective, a novel method is proposed in which the paths are planned incrementally according to the remaining spatiotemporal resources and the travel demands, which is referred to as Incremental Path Planning (IPP). IPP plans the paths of vehicles according to a predefined priority, after a vehicle’s path is planned, the occupancy of spatiotemporal resources is updated, and the remaining resources are then passed to the next vehicle for path planning. In IPP, an incrementally updated traffic model is proposed to obtain the traffic state. Based on this model, a time-dependent path search algorithm is proposed to reduce vehicle travel times. Simulation experiments based on real data sets have demonstrated the excellent performance of IPP in both improving traffic efficiency and driving experience.
科研通智能强力驱动
Strongly Powered by AbleSci AI