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

Ziren Xiao; Ruxin Xiao; Chang Liu; Honghao Gao; Xiaolong Xu; Shan Luo; Xinheng Wang

doi:10.1109/HCCS55241.2022.10090343

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

Ziren Xiao
, Ruxin Xiao
, Chang Liu
, Honghao Gao
, Xiaolong Xu
, Shan Luo
, Xinheng Wang

Department of Mechatronics and Robotics

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

1 Citation (Scopus)

Abstract

Dijkstra's algorithm is one of the most popular clas-sic 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 the 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.

Original language	English
Title of host publication	Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781665450416
DOIs	https://doi.org/10.1109/HCCS55241.2022.10090343
Publication status	Published - 2022
Event	2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022 - Shanghai, China Duration: 17 Dec 2022 → 18 Dec 2022

Publication series

Name	Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022

Conference

Conference	2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022
Country/Territory	China
City	Shanghai
Period	17/12/22 → 18/12/22

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 11 Sustainable Cities and Communities

Keywords

multiple sources path planning

Access to Document

10.1109/HCCS55241.2022.10090343

Cite this

Xiao, Z., Xiao, R., Liu, C., Gao, H., Xu, X., Luo, S., & Wang, X. (2022). An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix. In Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022 (Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HCCS55241.2022.10090343

Xiao, Ziren ; Xiao, Ruxin ; Liu, Chang et al. / An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix. Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022. Institute of Electrical and Electronics Engineers Inc., 2022. (Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022).

@inproceedings{63777633bc1946059405296652ea02c4,

title = "An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix",

abstract = "Dijkstra's algorithm is one of the most popular clas-sic 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 the 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.",

keywords = "multiple sources path planning",

author = "Ziren Xiao and Ruxin Xiao and Chang Liu and Honghao Gao and Xiaolong Xu and Shan Luo and Xinheng Wang",

note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022 ; Conference date: 17-12-2022 Through 18-12-2022",

year = "2022",

doi = "10.1109/HCCS55241.2022.10090343",

language = "English",

series = "Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022",

}

Xiao, Z, Xiao, R, Liu, C, Gao, H, Xu, X, Luo, S & Wang, X 2022, An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix. in Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022. Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022, Institute of Electrical and Electronics Engineers Inc., 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022, Shanghai, China, 17/12/22. https://doi.org/10.1109/HCCS55241.2022.10090343

An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix. / Xiao, Ziren; Xiao, Ruxin; Liu, Chang et al.
Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022. Institute of Electrical and Electronics Engineers Inc., 2022. (Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix

AU - Xiao, Ziren

AU - Xiao, Ruxin

AU - Liu, Chang

AU - Gao, Honghao

AU - Xu, Xiaolong

AU - Luo, Shan

AU - Wang, Xinheng

PY - 2022

Y1 - 2022

N2 - Dijkstra's algorithm is one of the most popular clas-sic 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 the 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.

AB - Dijkstra's algorithm is one of the most popular clas-sic 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 the 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.

KW - multiple sources path planning

UR - https://www.scopus.com/pages/publications/85146264677

U2 - 10.1109/HCCS55241.2022.10090343

DO - 10.1109/HCCS55241.2022.10090343

M3 - Conference Proceeding

AN - SCOPUS:85146264677

T3 - Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022

BT - Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022

Y2 - 17 December 2022 through 18 December 2022

ER -

Xiao Z, Xiao R, Liu C, Gao H, Xu X, Luo S et al. An Efficient Dynamic Multi-Sources to Single-Destination (DMS-SD) Algorithm in Smart City Navigation Using Adjacent Matrix. In Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022. Institute of Electrical and Electronics Engineers Inc. 2022. (Proceedings - 2022 International Conference on Human-Centered Cognitive Systems, HCCS 2022). doi: 10.1109/HCCS55241.2022.10090343

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

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this