An Empirical Comparison of Any-Angle Path-Planning Algorithms
DOI:
https://doi.org/10.1609/socs.v6i1.18382Keywords:
Any-angle path-planning, Heuristic searchAbstract
We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime. Any-angle path-planning is a fairly new research area, and no direct comparison exists between these algorithms. We implement each algorithm from scratch and use similar implementations to provide a fair comparison.
Downloads
Published
2021-09-01
Issue
Section
Short Papers