時間情報を活用した探索によるロボット運動計画の高速化
TIE: Time-Informed Exploration For Robot Motion Planning
サンプリングベースの運動計画において、到達可能性解析に基づく「時間情報付き集合」を定義し、初期解発見後の探索を時間最適解の改善に絞ることで収束を加速する手法を提案した。
著者: Sagar Suhas Joshi, Seth Hutchinson, Panagiotis Tsiotras
分類: cs.RO
原文アブストラクト
Anytime sampling-based methods are an attractive technique for solving kino-dynamic motion planning problems. These algorithms scale well to higher dimensions and can efficiently handle state and control constraints. However, an intelligent exploration strategy is required to accelerate their convergence and avoid redundant computations. Using ideas from reachability analysis, this work defines a "Time-Informed Set", that focuses the search for time-optimal kino-dynamic planning after an initial solution is found. Such a Time-Informed Set (TIS) includes all trajectories that can potentially improve the current best solution and hence exploration outside this set is redundant. Benchmarking experiments show that an exploration strategy based on the TIS can accelerate the convergence of sampling-based kino-dynamic motion planners.
