Path-length analysis for grid-based path planning

DOI10.1016/J.ARTINT.2021.103560MaRDI QIDQ2060684zbMATH OpenOpenAlexFDO

Authors James Bailey, Alex Nash, Sven Koenig, 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

any-angle path planningcomputational geometrypath planningroboticssearch

Mathematics Subject Classification ID

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

Recommendations

• The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
• Theta^*: any-angle path planning on grids
• The 2ᵏ neighborhoods for grid path planning
• Optimal any-angle pathfinding in practice
• scientific article; zbMATH DE number 2088034

Cites work

• scientific article; zbMATH DE number 2088034 (Why is no real title available?)
• Optimal any-angle pathfinding in practice
• The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
• There are planar graphs almost as good as the complete graph
• Using interpolation to improve path planning: The Field D* algorithm

Cited in

(9)

• Optimal any-angle pathfinding in practice
• An iterative algorithm to determine the number of time steps in path generation methods
• Theta^*: any-angle path planning on grids
• scientific article; zbMATH DE number 2088034 (Why is no real title available?)
• Path Counting for Grid-Based Navigation
• The 2ᵏ neighborhoods for grid path planning
• Path planning using intervals and graphs
• On approximating shortest paths in weighted triangular tessellations
• Generative models for grid-based and image-based pathfinding

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060684)