skip to main content
10.1145/1496984.1496987acmotherconferencesArticle/Chapter ViewAbstractPublication PagesfutureplayConference Proceedingsconference-collections
research-article

Combining heuristic and landmark search for path planning

Published: 03 November 2008 Publication History

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.

References

[1]
Freeciv. www.freeciv.org.
[2]
E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, pages 269--271, 1959.
[3]
R. W. Floyd. Algorithm 97: Shortest path. Commun. ACM, 5(6):345, 1962.
[4]
A. V. Goldberg and C. Harrelson. Computing the Shortest Path: A* Search meets Graph Theory. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 156--165, 2005.
[5]
K. Grant and D. Mould. LPI: Approximating Shortest Paths using Landmarks. In Eighteenth European Conference on Artificial Intelligence - Workshop on AI and Games, 2008.
[6]
P. E. Hart, N. J. Nilsson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs. IEEE Trans. Syst. Sci. and Cybernetics, SSC-4(2):100--107, 1968.
[7]
D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. J. ACM, 24(1):1--13, 1977.
[8]
D. Mould and M. Horsch. An Hierarchical Terrain Representation for Approximately Shortest Paths. In Proceedings of Ninth Pacific Rim International Conference on Artificial Intelligence (PRICAI), pages 104--113, 2004.
[9]
S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Pearson Education, 2003.

Cited By

View all
  • (2022)Do people prefer a landmark route over a shortest route?Cartography and Geographic Information Science10.1080/15230406.2022.207546949:5(407-425)Online publication date: 8-Jun-2022
  • (2013)HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor EnvironmentsISPRS International Journal of Geo-Information10.3390/ijgi20307292:3(729-748)Online publication date: 9-Aug-2013
  • (2012)Searching connected API subgraph via text phrasesProceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering10.1145/2393596.2393606(1-11)Online publication date: 11-Nov-2012

Index Terms

  1. Combining heuristic and landmark search for path planning

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    Future Play '08: Proceedings of the 2008 Conference on Future Play: Research, Play, Share
    November 2008
    297 pages
    ISBN:9781605582184
    DOI:10.1145/1496984
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 November 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. LPI
    2. Path planning
    3. heuristics
    4. precomputation

    Qualifiers

    • Research-article

    Conference

    FuturePlay08
    FuturePlay08: FuturePlay 2008 Academic Games Conference
    November 3 - 5, 2008
    Ontario, Toronto, Canada

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Do people prefer a landmark route over a shortest route?Cartography and Geographic Information Science10.1080/15230406.2022.207546949:5(407-425)Online publication date: 8-Jun-2022
    • (2013)HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor EnvironmentsISPRS International Journal of Geo-Information10.3390/ijgi20307292:3(729-748)Online publication date: 9-Aug-2013
    • (2012)Searching connected API subgraph via text phrasesProceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering10.1145/2393596.2393606(1-11)Online publication date: 11-Nov-2012

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media