Path-length analysis for grid-based path planning

DOI10.1016/j.artint.2021.103560zbMath1478.68419OpenAlexW3184816460MaRDI QIDQ2060684

Alex Nash, Sven Koenig, James P. Bailey, Craig A. Tovey

Publication date: 13 December 2021

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2021.103560

zbMATH Keywords

path planningroboticscomputational geometrysearchany-angle path planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Related Items (1)

On approximating shortest paths in weighted triangular tessellations

Cites Work

• Unnamed Item
• There are planar graphs almost as good as the complete graph
• Optimal Any-Angle Pathfinding In Practice
• Using interpolation to improve path planning: The Field D* algorithm
• The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones

This page was built for publication: Path-length analysis for grid-based path planning