论文标题
使用相邻矩阵的智能城市导航中的单末日化（DMS-SD）算法有效的动态多源
An Efficient Dynamic Multi-Sources To Single-Destination (DMS-SD) Algorithm In Smart City Navigation Using Adjacent Matrix
论文作者
论文摘要
Dijkstra的算法是最受欢迎的经典路径计划算法之一，在各种具有挑战性的任务中实现了最佳解决方案。但是，它仅计算一个从一个顶点到另一个顶点的最短距离，这很难直接应用于动态多源对单末日式（DMS-SD）问题。本文提出了一种修改后的Dijkstra算法来解决DMS-SD问题，可以在其中动态更改目的地。我们的方法从弗洛伊德的算法中介绍了相邻矩阵的概念，并通过数学计算实现了目标。我们正式表明，在我们的算法中，不需要弗洛伊德算法中最短的距离信息。广泛的实验验证了所提出方法的可伸缩性和最佳性。
Dijkstra's algorithm is one of the most popular classic path planning algorithms, achieving optimal solutions across a wide range of challenging tasks. However, it only calculates the shortest distance from one vertex to another, which is hard to directly apply to the Dynamic Multi-Sources to Single-Destination (DMS-SD) problem. This paper proposes a modified Dijkstra algorithm to address the DMS-SD problem, where the destination can be dynamically changed. Our method deploys the concept of Adjacent Matrix from Floyd's algorithm and achieves the goal with mathematical calculations. We formally show that all-pairs shortest distance information in Floyd's algorithm is not required in our algorithm. Extensive experiments verify the scalability and optimality of the proposed method.
