Abstract

T. Uras and S. Koenig. An Empirical Comparison of Any-Angle Path-Planning Algorithms [Short Paper]. In Proceedings of the Symposium on Combinatorial Search (SOCS), pages 206-210, 2015.

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.

Our code of several any-angle path planning algorithms (including Theta*) is available. If you use the code, please reference it as follows in your publications: 'T. Uras and S. Koenig. An Empirical Comparison of Any-Angle Path-Planning Algorithms. In Proceedings of the Symposium on Combinatorial Search, 2015. Code available at: http://idm-lab.org/anyangle'

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.


This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.