Least-time Path Algorithm Based on Missile Guidance

A dynamic and real-time single-vehicle path algorithm considering system optimization is proposed by the method of simulating missile guidance. Targeted at minimizing the run-time of a single vehicle, the algorithm plans a path for the vehicle to avoid traffic congestion and help optimize the overall traffic state. This algorithm begins with preliminary path planning to find the points from which ideal paths that help balance the vehicle traffic flow can be generated. Then the algorithm plans for the ideal paths before the actual path is derived from the ideal ones. Throughout the driving process, the algorithm dynamically and cyclically plans the path in real-time, and dynamically revises the plan of the path covering the sections ahead based on the traffic state. Simulation showed that the proposed algorithm effectively enables vehicles to avoid congestion and save travel time, and helps balance the vehicle traffic flow and optimize the traffic state.

摘要应用模拟导弹制导的方法, 提出了一种考虑系统优化的单车实时动态路径算法.算法以单车时间最短为目标, 通过使车辆避开拥堵, 达到单车路径规划利于系统优化的目标.算法首先进行初步路径规划, 即求解利于车流量平衡的理想路径生成点; 然后, 进行理想路径规划; 最后, 根据理想路径得出实际路径规划.在出行全程中, 算法进行循环滚动的实时动态路径规划, 同时根据交通状态数据实时修正未通行路段的路径规划.通过交通网数据动态模型和模拟导弹制导的算法仿真, 结果表明, 该算法能有效地解决车辆避开拥堵’节约出行时间, 同时利于车流量平衡和系统优化.