軌道推定と計画の同時求解フレームワークSTEAP
STEAP: simultaneous trajectory estimation and planning
連続時間軌道を毎時刻計算し、その過去部分を推定、未来部分を計画として同時に解く確率推論手法を提案し、移動マニピュレータで実証した。
著者: Mustafa Mukadam, Jing Dong, Frank Dellaert, Byron Boots
分類: cs.RO
原文アブストラクト
We present a unified probabilistic framework for simultaneous trajectory estimation and planning (STEAP). Estimation and planning problems are usually considered separately, however, within our framework we show that solving them simultaneously can be more accurate and efficient. The key idea is to compute the full continuous-time trajectory from start to goal at each time-step. While the robot traverses the trajectory, the history portion of the trajectory signifies the solution to the estimation problem, and the future portion of the trajectory signifies a solution to the planning problem. Building on recent probabilistic inference approaches to continuous-time localization and mapping and continuous-time motion planning, we solve the joint problem by iteratively recomputing the maximum a posteriori trajectory conditioned on all available sensor data and cost information. Our approach can contend with high-degree-of-freedom (DOF) trajectory spaces, uncertainty due to limited sensing capabilities, model inaccuracy, the stochastic effect of executing actions, and can find a solution in real-time. We evaluate our framework empirically in both simulation and on a mobile manipulator.
