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 | |
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/Territory | Japan |
City | Sapporo City, Hokkaido |
Period | 26/04/14 → 28/04/14 |