ベジェ曲線最適化による動力学制約下のマルチエージェント動作計画
Multi-Agent Motion Planning with B\'ezier Curve Optimization under Kinodynamic Constraints
複数エージェントの動力学制約を考慮し、ベジェ曲線最適化を用いた3段階の動作計画手法PSBを提案。交通交差点や障害物の多いグリッドマップで最大49.79%のコスト改善を達成。
著者: Jingtian Yan, Jiaoyang Li
分類: cs.RO, cs.MA
原文アブストラクト
Multi-Agent Motion Planning (MAMP) is a problem that seeks collision-free dynamically-feasible trajectories for multiple moving agents in a known environment while minimizing their travel time. MAMP is closely related to the well-studied Multi-Agent Path-Finding (MAPF) problem. Recently, MAPF methods have achieved great success in finding collision-free paths for a substantial number of agents. However, those methods often overlook the kinodynamic constraints of the agents, assuming instantaneous movement, which limits their practicality and realism. In this paper, we present a three-level MAPF-based planner called PSB to address the challenges posed by MAMP. PSB fully considers the kinodynamic capability of the agents and produces solutions with smooth speed profiles that can be directly executed by the controller. Empirically, we evaluate PSB within the domains of traffic intersection coordination for autonomous vehicles and obstacle-rich grid map navigation for mobile robots. PSB shows up to 49.79% improvements in solution cost compared to existing methods.
関連論文
- 多様体制約付きハミルトン・ヤコビ到達可能性学習による分散型マルチエージェント動作計画マルチエージェント動作計画
- プロトコルとしての衝突ベース探索:異種エージェント・ソルバー・独立タスクのためのマルチエージェント動作計画マルチエージェント動作計画
- 連続時間における時間的ロバスト性を考慮したマルチエージェントSTL動作計画マルチエージェント動作計画
