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 paperConference 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 languageEnglish
Title of host publicationProceedings - 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014
EditorsS. Li, Y. Cheng, Y. Dai, X. Jiang
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages1552-1556
Number of pages5
Volume3
ISBN (Electronic)9781479931965
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014 - Sapporo City, Hokkaido, Japan
Duration: 26 Apr 201428 Apr 2014

Conference

Conference2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014
CountryJapan
CitySapporo City, Hokkaido
Period26/04/1428/04/14

    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