一种基于路网变化的动态路径规划策略

就车辆动态时间最短路径诱导问题展开研究，提出了一种便于工程实施的变起点、定目标点的动态行程时间最短路径规划方案. 基于该方案，在一种大型方阵图下，就Dijkstra、A*、D* Lite等几种动态路径规划算法的计算时间进行了对比分析，针对车载动态导航设备实时性要求高、计算量要求尽可能小的特点，提出了一种基于路网变化的跳变的动态路径规划策略，根据路网中路段权值变化的具体情况，选取更加节省时间的搜索方式. 利用东莞市区电子地图和路网历史流量数据进行实验，实验结果表明，该策略可以有效减少路径动态规划的计算时间，有一定的工程应用价值.

A Dynamic Route Planning Strategy Based on Road Network Changes

A new dynamic time-dependent shortest route planning easily implemented for urban vehicle guidance system is proposed in this paper, based on which computing time of Dijkstra, A*, D* Lite algorithms are compared and analyzed in a large experiment square graph. To meet the real-time needs of the in-vehicle dynamic navigation equipment, a hopping dynamic path planning strategy based on network changes is proposed to reduce the computing time, which picks more effective searching way in light of specific change situation. E-map and history traffic volume data of Dongguan city is used to tests the strategy and the result shows that the strategy is effective and feasible, and the time cost if dynamic route planning can be significantly reduced.