Optimal Any-Angle Pathfinding In Practice
From MaRDI portal
Publication:2810130
DOI10.1613/jair.5007zbMath1356.68252DBLPjournals/jair/HaraborGOA16OpenAlexW2403099801WikidataQ63353496 ScholiaQ63353496MaRDI QIDQ2810130
Daniel Harabor, Vural Aksakalli, Alban Grastien, Dindar Oz
Publication date: 31 May 2016
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.5007
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 (5)
Path Counting for Grid-Based Navigation ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Path-length analysis for grid-based path planning ⋮ Fast optimal and bounded suboptimal Euclidean pathfinding ⋮ Anya
Uses Software
This page was built for publication: Optimal Any-Angle Pathfinding In Practice
