Corpus ID: 18056022

LPI : Approximating Shortest Paths using Landmarks

@inproceedings{Grant2008LPIA,
  title={LPI : Approximating Shortest Paths using Landmarks},
  author={K. Grant and D. Mould},
  year={2008}
}
  • 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

    Figures and Tables from this paper.

    Risky Planning on Probabilistic Costmaps for Path Planning in Outdoor Environments
    • 23
    Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff
    • 16
    • Open Access
    Choosing landmarks for risky planning
    • 2
    • Open Access
    Planning and exploring under uncertainty
    • 2
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Computing the shortest path: A search meets graph theory
    • 769
    • Highly Influential
    • Open Access
    Near Optimal Hierarchical Path-Finding
    • 329
    • Open Access
    An Hierarchical Terrain Representation for Approximately Shortest Paths
    • 13
    • Open Access
    A Note on Two Problems in Connexion with Gr aphs
    • 1959
    A formal basis for heuristic determination of minimum path cost
    • 182
    DeLoura,Game Programming Gems
    • 2000
    HPA* Enhancements’, in Proceedings of the Third Artificial Intelligence and Interactive Digital E ntertainment Conference
    • 2007