Euclidean Distance-Optimal Post-processing of Grid-Based Paths

Authors

  • Guru Koushik Senthil Kumar Carnegie Mellon University
  • Sandip Aine Carnegie Mellon University
  • Maxim Likhachev Carnegie Mellon University

Keywords:

Post-processing Algorithm, Search Based Planning, Euclidean Distance Optimal, Visibility Graphs

Abstract

Paths planned over grids can often be suboptimal in an Euclidean space and contain a large number of unnecessary turns. Consequently, researchers have looked into post-processing techniques to improve the paths after they are planned. In this paper, we propose a novel post-processing technique, called Homotopic Visibility Graph Planning (HVG) which differentiates itself from existing post-processing methods in that it is guaranteed to shorten the path such that it is at least as short as the provably shortest path that lies within the same topological class as the initially computed path. We propose the algorithm, provide proofs and compare it experimentally against other post-processing methods and any-angle planning algorithms.

Downloads

Published

2022-06-13

How to Cite

Senthil Kumar, G. K., Aine, S., & Likhachev, M. (2022). Euclidean Distance-Optimal Post-processing of Grid-Based Paths. Proceedings of the International Conference on Automated Planning and Scheduling, 32(1), 321-328. Retrieved from https://ojs.aaai.org/index.php/ICAPS/article/view/19816