Uninformed multigoal pathfinding on grid maps

Kai Li Lim; Lee Seng Yeong; Sue Inn Ch'Ng; Kah Phooi Seng; Li Minn Ang

doi:10.1109/InfoSEEE.2014.6946181

Uninformed multigoal pathfinding on grid maps

Kai Li Lim, Lee Seng Yeong, Sue Inn Ch'Ng, Kah Phooi Seng, Li Minn Ang

Research output: Chapter in Book/Conference paper › Conference paper

5 Citations (Scopus)

Abstract

This paper proposes multigoal implementations of the Dijkstra's shortest path algorithm and the boundary iterative-deepening depth-first search (BIDDFS). The algorithms were modified to allow for the search of more than one goal in a single expansion pass. The aim of this is to reduce the operational redundancy and hence the time taken for calculating multiple start-goal node pairs. Simulations using multigoal algorithms on 250× 250 open grid maps with nine goals have shown up to a 458% increase in time efficiency.

Original language	English
Title of host publication	Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014
Editors	S. Li, Y. Cheng, Y. Dai, X. Jiang
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	1552-1556
Number of pages	5
Volume	3
ISBN (Electronic)	9781479931965
DOIs	https://doi.org/10.1109/InfoSEEE.2014.6946181
Publication status	Published - 1 Jan 2014
Externally published	Yes
Event	2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014 - Sapporo City, Hokkaido, Japan Duration: 26 Apr 2014 → 28 Apr 2014

Conference

Conference	2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014
Country	Japan
City	Sapporo City, Hokkaido
Period	26/04/14 → 28/04/14

Access to Document

10.1109/InfoSEEE.2014.6946181

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Uninformed multigoal pathfinding on grid maps'. Together they form a unique fingerprint.

Cite this

Lim, K. L., Yeong, L. S., Ch'Ng, S. I., Seng, K. P., & Ang, L. M. (2014). Uninformed multigoal pathfinding on grid maps. In S. Li, Y. Cheng, Y. Dai, & X. Jiang (Eds.), Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014 (Vol. 3, pp. 1552-1556). [6946181] IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/InfoSEEE.2014.6946181

Lim, Kai Li ; Yeong, Lee Seng ; Ch'Ng, Sue Inn ; Seng, Kah Phooi ; Ang, Li Minn. / Uninformed multigoal pathfinding on grid maps. Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014. editor / S. Li ; Y. Cheng ; Y. Dai ; X. Jiang. Vol. 3 IEEE, Institute of Electrical and Electronics Engineers, 2014. pp. 1552-1556

@inproceedings{306b34f720a14a16a6f5a9b427d73ae1,

title = "Uninformed multigoal pathfinding on grid maps",

abstract = "This paper proposes multigoal implementations of the Dijkstra's shortest path algorithm and the boundary iterative-deepening depth-first search (BIDDFS). The algorithms were modified to allow for the search of more than one goal in a single expansion pass. The aim of this is to reduce the operational redundancy and hence the time taken for calculating multiple start-goal node pairs. Simulations using multigoal algorithms on 250× 250 open grid maps with nine goals have shown up to a 458% increase in time efficiency.",

author = "Lim, {Kai Li} and Yeong, {Lee Seng} and Ch'Ng, {Sue Inn} and Seng, {Kah Phooi} and Ang, {Li Minn}",

year = "2014",

month = jan,

day = "1",

doi = "10.1109/InfoSEEE.2014.6946181",

language = "English",

volume = "3",

pages = "1552--1556",

editor = "S. Li and Y. Cheng and Y. Dai and X. Jiang",

booktitle = "Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014 ; Conference date: 26-04-2014 Through 28-04-2014",

}

Lim, KL, Yeong, LS, Ch'Ng, SI, Seng, KP & Ang, LM 2014, Uninformed multigoal pathfinding on grid maps. in S Li, Y Cheng, Y Dai & X Jiang (eds), Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014. vol. 3, 6946181, IEEE, Institute of Electrical and Electronics Engineers, pp. 1552-1556, 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014, Sapporo City, Hokkaido, Japan, 26/04/14. https://doi.org/10.1109/InfoSEEE.2014.6946181

Uninformed multigoal pathfinding on grid maps. / Lim, Kai Li; Yeong, Lee Seng; Ch'Ng, Sue Inn; Seng, Kah Phooi; Ang, Li Minn.

Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014. ed. / S. Li; Y. Cheng; Y. Dai; X. Jiang. Vol. 3 IEEE, Institute of Electrical and Electronics Engineers, 2014. p. 1552-1556 6946181.

Research output: Chapter in Book/Conference paper › Conference paper

TY - GEN

T1 - Uninformed multigoal pathfinding on grid maps

AU - Lim, Kai Li

AU - Yeong, Lee Seng

AU - Ch'Ng, Sue Inn

AU - Seng, Kah Phooi

AU - Ang, Li Minn

PY - 2014/1/1

Y1 - 2014/1/1

N2 - This paper proposes multigoal implementations of the Dijkstra's shortest path algorithm and the boundary iterative-deepening depth-first search (BIDDFS). The algorithms were modified to allow for the search of more than one goal in a single expansion pass. The aim of this is to reduce the operational redundancy and hence the time taken for calculating multiple start-goal node pairs. Simulations using multigoal algorithms on 250× 250 open grid maps with nine goals have shown up to a 458% increase in time efficiency.

AB - This paper proposes multigoal implementations of the Dijkstra's shortest path algorithm and the boundary iterative-deepening depth-first search (BIDDFS). The algorithms were modified to allow for the search of more than one goal in a single expansion pass. The aim of this is to reduce the operational redundancy and hence the time taken for calculating multiple start-goal node pairs. Simulations using multigoal algorithms on 250× 250 open grid maps with nine goals have shown up to a 458% increase in time efficiency.

UR - http://www.scopus.com/inward/record.url?scp=84913534601&partnerID=8YFLogxK

U2 - 10.1109/InfoSEEE.2014.6946181

DO - 10.1109/InfoSEEE.2014.6946181

M3 - Conference paper

AN - SCOPUS:84913534601

VL - 3

SP - 1552

EP - 1556

BT - Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014

A2 - Li, S.

A2 - Cheng, Y.

A2 - Dai, Y.

A2 - Jiang, X.

PB - IEEE, Institute of Electrical and Electronics Engineers

T2 - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014

Y2 - 26 April 2014 through 28 April 2014

ER -

Lim KL, Yeong LS, Ch'Ng SI, Seng KP, Ang LM. Uninformed multigoal pathfinding on grid maps. In Li S, Cheng Y, Dai Y, Jiang X, editors, Proceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014. Vol. 3. IEEE, Institute of Electrical and Electronics Engineers. 2014. p. 1552-1556. 6946181 https://doi.org/10.1109/InfoSEEE.2014.6946181