Multi-Vehicle Cooperative Control Using Mixed Integer Linear Programming
Matthew G. Earl, Raffaello D'Andrea

TL;DR
This paper introduces a mixed integer linear programming approach to synthesize cooperative strategies for multi-vehicle control, demonstrated on RoboFlag adversarial scenarios, with an analysis of computational complexity.
Contribution
It presents a novel method to formulate multi-vehicle control as mixed logical dynamical systems and solve for strategies using MILP, applied to RoboFlag scenarios.
Findings
Effective synthesis of cooperative strategies demonstrated
Computational complexity analysis provided
Applicable to adversarial multi-vehicle scenarios
Abstract
We present methods to synthesize cooperative strategies for multi-vehicle control problems using mixed integer linear programming. Complex multi-vehicle control problems are expressed as mixed logical dynamical systems. Optimal strategies for these systems are then solved for using mixed integer linear programming. We motivate the methods on problems derived from an adversarial game between two teams of robots called RoboFlag. We assume the strategy for one team is fixed and governed by state machines. The strategy for the other team is generated using our methods. Finally, we perform an average case computational complexity study on our approach.
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
TopicsFormal Methods in Verification · Blockchain Technology Applications and Security · Supply Chain and Inventory Management
