An Empirical Comparison of Any-Angle Path-Planning Algorithms

Authors

  • Tansel Uras University of Southern California
  • Sven Koenig University of Southern California

DOI:

https://doi.org/10.1609/socs.v6i1.18382

Keywords:

Any-angle path-planning, Heuristic search

Abstract

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.

SoCS 2015 Proceedings Cover

Downloads

Published

2021-09-01

How to Cite

Uras, T., & Koenig, S. (2021). An Empirical Comparison of Any-Angle Path-Planning Algorithms. Proceedings of the International Symposium on Combinatorial Search, 6(1), 206–210. https://doi.org/10.1609/socs.v6i1.18382

Issue

Vol. 6 No. 1 (2015): Eighth Annual Symposium on Combinatorial Search

Section

Short Papers