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 or Report/Conference proceedingConference Proceedingpeer-review

6 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
EditorsXiaohong Jiang, Shaozi Li, Ying Dai, Yun Cheng
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1552-1556
Number of pages5
ISBN (Electronic)9781479931965
DOIs
Publication statusPublished - 5 Nov 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

Publication series

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

Conference

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

Cite this