GPUで高速化するマルチエージェント軌道最適化の凸近似
GPU Accelerated Convex Approximations for Fast Multi-Agent Trajectory Optimization
非凸な衝突回避制約を凸な無制約QPに再定式化し、行列分解をオフライン化してGPUで数十エージェントの軌道を1秒未満で計算する手法を提案した。
著者: Fatemeh Rastgar, Houman Masnavi, Jatan Shrestha, Karl Kruusamae, Alvo Aabloo, Arun Kumar Singh
分類: cs.RO, math.OC
原文アブストラクト
In this paper, we present a computationally efficient trajectory optimizer that can exploit GPUs to jointly compute trajectories of tens of agents in under a second. At the heart of our optimizer is a novel reformulation of the non-convex collision avoidance constraints that reduces the core computation in each iteration to that of solving a large scale, convex, unconstrained Quadratic Program (QP). We also show that the matrix factorization/inverse computation associated with the QP needs to be done only once and can be done offline for a given number of agents. This further simplifies the solution process, effectively reducing it to a problem of evaluating a few matrix-vector products. Moreover, for a large number of agents, this computation can be trivially accelerated on GPUs using existing off-the-shelf libraries. We validate our optimizer's performance on challenging benchmarks and show substantial improvement over state of the art in computation time and trajectory quality.
関連論文
- DiffCoord: 分散マルチエージェント軌道最適化のための微分可能な協調マルチエージェント軌道最適化
