Combining heuristic and landmark search for path planning

Authors:
Kevin Grant;David Mould
Affiliations:
University of Lethbridge, Lethbridge, AB, Canada;Carleton University, Ottawa, ON, Canada
Venue:
Future Play '08 Proceedings of the 2008 Conference on Future Play: Research, Play, Share
Year:
2008

Citing 4
Cited 1

Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Searching connected API subgraph via text phrases

Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a hybridization of heuristic search and the LPI algorithm. Our approach uses heuristic search to find paths to landmarks, and employs a small amount of landmark information to correct itself when the heuristic search deviates from the shortest path. The use of the heuristic allows lower memory usage than LPI, while the use of the landmarks permits the algorithm to operate effectively even with a poor heuristic. When the heuristic accuracy is very high, the algorithm tends towards greedy search; when the heuristic accuracy is low, the algorithm tends towards LPI. Experiments show that the memory usage of LPI can be reduced by more than half while preserving the accuracy of the solutions.