軌道生成のための衝突回避空間の凸被覆最適化
Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation
ウェイポイントを囲む最大体積の凸ポリトープを反復的に求め、安全飛行回廊を構成して軌道生成を効率化するオンラインアルゴリズムを提案した。
著者: Yuwei Wu, Igor Spasojevic, Pratik Chaudhari, Vijay Kumar
分類: cs.RO
原文アブストラクト
We propose an online iterative algorithm to optimize a convex cover to under-approximate the free space for autonomous navigation to delineate Safe Flight Corridors (SFC). The convex cover consists of a set of polytopes such that the union of the polytopes represents obstacle-free space, allowing us to find trajectories for robots that lie within the convex cover. In order to find the SFC that facilitates trajectory optimization, we iteratively find overlapping polytopes of maximum volumes that include specified waypoints initialized by a geometric or kinematic planner. Constraints at waypoints appear in two alternating stages of a joint optimization problem, which is solved by a novel heuristic-based iterative algorithm with partially distributed variables. We validate the effectiveness of our proposed algorithm using a range of parameterized environments and show its applications for two-stage motion planning.
