線形安全回廊を用いた実現可能性保証付きクアッドロータ群のオンライン分散軌道計画
Online Distributed Trajectory Planning for Quadrotor Swarm with Feasibility Guarantee using Linear Safe Corridor
線形安全回廊(LSC)で実行可能制約のみの分散軌道最適化を定式化し、スラック変数なしで安全な軌道を生成するマルチエージェント軌道計画法を提案。優先度ベースのゴール計画でデッドロックを防ぎ、10機の実機飛行で有効性を検証した。
著者: Jungwon Park, Dabin Kim, Gyeong Chan Kim, Dahyun Oh, H. Jin Kim
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
This paper presents a new online multi-agent trajectory planning algorithm that guarantees to generate safe, dynamically feasible trajectories in a cluttered environment. The proposed algorithm utilizes a linear safe corridor (LSC) to formulate the distributed trajectory optimization problem with only feasible constraints, so it does not resort to slack variables or soft constraints to avoid optimization failure. We adopt a priority-based goal planning method to prevent the deadlock without an additional procedure to decide which robot to yield. The proposed algorithm can compute the trajectories for 60 agents on average 15.5 ms per agent with an Intel i7 laptop and shows a similar flight distance and distance compared to the baselines based on soft constraints. We verified that the proposed method can reach the goal without deadlock in both the random forest and the indoor space, and we validated the safety and operability of the proposed algorithm through a real flight test with ten quadrotors in a maze-like environment.
