Optimal any-angle pathfinding in practice

DOI10.1613/JAIR.5007MaRDI QIDQ2810130zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel Damir Harabor, Alban Grastien, Dindar Oz, Vural Aksakalli

Publication date 31 May 2016

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.5007

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

• Theta^*: any-angle path planning on grids
• Optimal any-angle pathfinding on a sphere
• The 2ᵏ neighborhoods for grid path planning
• Fast optimal and bounded suboptimal Euclidean pathfinding
• Path-length analysis for grid-based path planning

Cited in

(13)

• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• Path-length analysis for grid-based path planning
• Fast optimal and bounded suboptimal Euclidean pathfinding
• Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot
• Theta^*: any-angle path planning on grids
• Optimal Exploration of Terrains with Obstacles
• Anya
• Optimal any-angle pathfinding on a sphere
• Path Counting for Grid-Based Navigation
• The 2ᵏ neighborhoods for grid path planning
• Regarding goal bounding and jump point search
• Optimal algorithm for shape from shading and path planning
• On approximating shortest paths in weighted triangular tessellations

Describes a project that uses

Uses Software

• Theta*

This page was built for publication: Optimal any-angle pathfinding in practice

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