An Efficient Dynamic Multi-Sources To Single-Destination (DMS-SD) Algorithm In Smart City Navigation Using Adjacent Matrix

TL;DR

This paper introduces a modified Dijkstra algorithm utilizing adjacency matrix concepts to efficiently solve dynamic multi-source to single-destination path planning in smart city navigation, improving scalability and adaptability.

Contribution

The paper presents a novel algorithm that extends Dijkstra's method with adjacency matrix techniques to handle dynamic destination changes efficiently.

Findings

The proposed algorithm is scalable to large networks.

It maintains optimality in dynamic destination scenarios.

Experimental results confirm improved efficiency over traditional methods.

Abstract

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.