障害物密集環境における実行可能性保証とデッドロック解消を両立するマルチロボット軌道計画
Multi-Robot Trajectory Planning with Feasibility Guarantee and Deadlock Resolution: An Obstacle-Dense Environment
障害物が多い環境で複数ロボットの軌道計画を行う際、安全コリドーをオンライン生成して最適化の実行可能性を保証しつつ、動的優先度と右手則でデッドロックを解消する手法を提案。最大8機のナノクアッドコプターで実機検証した。
著者: Yuda Chen, Chenghan Wang, Meng Guo, Zhongkui Li
分類: cs.RO
原文アブストラクト
This article presents a multi-robot trajectory planning method which not only guarantees optimization feasibility and but also resolves deadlocks in obstacle-dense environments. The method is proposed via formulating a recursive optimization problem, where a novel safe corridor is generated online to ensure obstacle avoidance in trajectory planning. A dynamic-priority mechanism is combined with the right-hand rule to handle potential deadlocks that are much harder to resolve due to static obstacles. Comparisons with other state-of-the-art results are conducted to validate the improved safety and success rate. Additional hardware experiments are carried out with up to eight nano-quadrotors in various cluttered scenarios.
