時間最適経路パラメータ化アルゴリズムの汎用・高速・堅牢な実装
A General, Fast, and Robust Implementation of the Time-Optimal Path Parameterization Algorithm
動的制約下で経路の時間最適パラメータ化(TOPP)を求める際の動的特異点問題を完全に解決し、C++/Pythonでオープンソース実装を提供して堅牢性と速度を実証した論文。
著者: Quang-Cuong Pham
分類: cs.RO
原文アブストラクト
Finding the Time-Optimal Parameterization of a given Path (TOPP) subject to kinodynamic constraints is an essential component in many robotic theories and applications. The objective of this article is to provide a general, fast and robust implementation of this component. For this, we give a complete solution to the issue of dynamic singularities, which are the main cause of failure in existing implementations. We then present an open-source implementation of the algorithm in C++/Python and demonstrate its robustness and speed in various robotics settings.
