Cooperative Multi-Agent Trajectory Generation with Modular Bayesian Optimization
Gilhyun Ryou, Ezra Tal, Sertac Karaman

TL;DR
This paper introduces a modular Bayesian optimization framework for efficiently generating time-optimal, collision-free trajectories for multi-agent systems like UAVs, improving speed and computational efficiency over existing methods.
Contribution
A novel modular Bayesian optimization model with Gaussian process surrogates that reduces computational cost and enables minimal constraints in multi-agent trajectory planning.
Findings
Trajectories are faster than baseline methods.
Validated in real-world quadcopter experiments.
Efficient multi-fidelity evaluation scheme.
Abstract
We present a modular Bayesian optimization framework that efficiently generates time-optimal trajectories for a cooperative multi-agent system, such as a team of UAVs. Existing methods for multi-agent trajectory generation often rely on overly conservative constraints to reduce the complexity of this high-dimensional planning problem, leading to suboptimal solutions. We propose a novel modular structure for the Bayesian optimization model that consists of multiple Gaussian process surrogate models that represent the dynamic feasibility and collision avoidance constraints. This modular structure alleviates the stark increase in computational cost with problem dimensionality and enables the use of minimal constraints in the joint optimization of the multi-agent trajectories. The efficiency of the algorithm is further improved by introducing a scheme for simultaneous evaluation of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Autonomous Vehicle Technology and Safety · Transportation and Mobility Innovations
