モバイルロボットの経路計画のための高速化Reeds-Shepp法と終端姿勢未指定Reeds-Shepp法
Accelerated Reeds-Shepp and Under-Specified Reeds-Shepp Algorithms for Mobile Robot Path Planning
幾何学的推論により最適なReeds-Shepp経路計算を高速化し、終端姿勢が未指定の問題にも対応した手法を提案。従来比15倍の高速化を実現し、オープンソース実装を公開。
著者: Ibrahim Ibrahim, Wilm Decré, Jan Swevers
分類: cs.RO, cs.CG
原文アブストラクト
In this study, we present a simple and intuitive method for accelerating optimal Reeds-Shepp path computation. Our approach uses geometrical reasoning to analyze the behavior of optimal paths, resulting in a new partitioning of the state space and a further reduction in the minimal set of viable paths. We revisit and reimplement classic methodologies from the literature, which lack contemporary open-source implementations, to serve as benchmarks for evaluating our method. Additionally, we address the under-specified Reeds-Shepp planning problem where the final orientation is unspecified. We perform exhaustive experiments to validate our solutions. Compared to the modern C++ implementation of the original Reeds-Shepp solution in the Open Motion Planning Library, our method demonstrates a 15x speedup, while classic methods achieve a 5.79x speedup. Both approaches exhibit machine-precision differences in path lengths compared to the original solution. We release our proposed C++ implementations for both the accelerated and under-specified Reeds-Shepp problems as open-source code.
