Corpus ID: 18056022

LPI : Approximating Shortest Paths using Landmarks

  title={LPI : Approximating Shortest Paths using Landmarks},
  author={K. Grant and D. Mould},
  • K. Grant, D. Mould
  • Published 2008
  • We present LPI, a novel approach for finding approximate shortest paths in weighted graphs. The basis of the algorithm is the presence of landmarksplaced at vertices throughout the graph. Each landmark stores the shortest path from itself to all other vertices. LPI works by searching the intersection points along the landmark paths to approximate a path between two points. We show that the paths computed by LPI are quite accurate: within 1% of optimal in the majority of cases, while reducing… CONTINUE READING
    5 Citations

    Figures and Tables from this paper.

    Regions Discovery Algorithm for Pathfinding in Grid Based Maps
    • 1
    Choosing landmarks for risky planning
    • L. Murphy, P. Corke, P. Newman
    • Mathematics, Computer Science
    • 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
    • 2011
    • 2
    • PDF
    Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff
    • L. Murphy, P. Newman
    • Mathematics, Computer Science
    • 2011 IEEE International Conference on Robotics and Automation
    • 2011
    • 16
    • PDF
    Risky Planning on Probabilistic Costmaps for Path Planning in Outdoor Environments
    • 23
    Planning and exploring under uncertainty
    • 2
    • PDF


    Computing the shortest path: A search meets graph theory
    • 771
    • Highly Influential
    • PDF
    An Hierarchical Terrain Representation for Approximately Shortest Paths
    • 13
    • PDF
    Near Optimal Hierarchical Path-Finding
    • 339
    • PDF
    A Note on Two Problems in Connexion with Gr aphs
    • Numerische Mathematik ,
    • 1959
    A formal basis for heuristic determination of minimum path cost
    • 178
    DeLoura,Game Programming Gems
    • Charles River Media,
    • 2000
    HPA* Enhancements’, in Proceedings of the Third Artificial Intelligence and Interactive Digital E ntertainment Conference
    • 2007