针对标准的Dijkstra算法在对交通路径进行规划的时候还存在运算速度

针对标准的Dijkstra算法在对交通路径进行规划的时候还存在运算速度慢、准确性不高的问题，本文提出了一种基于数据约束和路径影响因子优化的Dijkstra算法，首先对交通路径网络中所有有向节点对进行预处理，然后以Dijkstra方式对边界节点逆向拓展，从而限制其路径边界，接着对路径节点进行最优节点的标记并以“目标块”为单位进行存储，以加快算法的运行速度，最后在传统算法中加入路径影响因子对其权值进行优化，以提高传统算法的路径规划准确性。通过仿真实验表明，本文提出的基于数据约束和路径影响因子优化的Dijkstra算法与标准的Dijkstra算法相比，其运行速度大大缩短，路径规划准确性大大增加，具有较好的鲁棒性。

結果 (英文) 1:

For standard of Dijkstra algorithm in on traffic path for planning of when also exists operation speed slow, and accuracy not high of problem, paper proposed has a based on data constraint and path effects factor optimization of Dijkstra algorithm, first on traffic path network in the all has to node on for pretreatment, then to Dijkstra way on border node reverse expand, thus limit its path border, then on path node for optimal node of mark and to "target block" for units for storage In order to speed up the speed of the algorithm, finally joined in the traditional path of impact factor to optimize the weight and to increase the accuracy of path planning algorithm. The simulation results show that, based on the data presented in this paper Dijkstra algorithm for constrained optimization of impact factor and path compared with the Dijkstra algorithm standards, its running speed is greatly reduced, path planning accuracy increases greatly, with high robustness.

結果 (英文) 2:

Dijkstra's algorithm for standard operation is slow there, accuracy is not high in the traffic path planning time, this paper presents a constraint-based data and path factor optimized Dijkstra algorithm, first of all network traffic paths nodes have to be pretreated, and then reverse Dijkstra way to expand the boundary nodes, thereby limiting its path boundary, then the optimal path nodes labeled nodes and to "target block" as the unit for storage, in order to accelerate the algorithm runs speed, and finally add the path factor to optimize their weights in the traditional algorithm in order to improve the accuracy of path planning of traditional algorithms. Simulation results show that, Dijkstra algorithm based on Dijkstra algorithm and standard data constraints and path optimization factor of this paper compared to its speed greatly reduced, greatly increasing the accuracy of path planning, with better robustness.

結果 (英文) 3:

According to the standard Dijkstra algorithm also has slow computing speed, accuracy is not high question the planning of transportation route, this paper proposes a Dijkstra algorithm optimization effect factor of data constraints and path based on, first of all have to route traffic in the network nodes on the pretreatment, and then to Dijkstra mode on the boundary reverse expand nodes, which limits its path boundary marker, followed by optimal node on the path nodes and are stored in the "target block" as a unit, in order to speed up the running speed of the algorithm, the last to join in the traditional algorithm in the path factor effect on the weights are optimized,In order to improve the accuracy of the traditional path planning algorithm. Simulation results show that, compared with the standard Dijkstra algorithm to optimize the impact factor data constraints and path based on Dijkstra algorithm is proposed in this paper, the speed of operation is greatly shortened, path planning accuracy is greatly increased, and has good robustness.