Optimal Control Synthesis with Relaxed Global Temporal Logic Specifications for Homogeneous Multi-robot Teams
Kamale, Disha, Vasile, Cristian-Ioan
–arXiv.org Artificial Intelligence
In this work, we address the problem of control synthesis for a homogeneous team of robots given a global temporal logic specification and formal user preferences for relaxation in case of infeasibility. The relaxation preferences are represented as a Weighted Finite-state Edit System and are used to compute a relaxed specification automaton that captures all allowable relaxations of the mission specification and their costs. For synthesis, we introduce a Mixed Integer Linear Programming (MILP) formulation that combines the motion of the team of robots with the relaxed specification automaton. Our approach combines automata-based and MILP-based methods and leverages the strengths of both approaches while avoiding their shortcomings. Specifically, the relaxed specification automaton explicitly accounts for the progress towards satisfaction, and the MILP-based optimization approach avoids the state-space explosion associated with explicit product-automata construction, thereby efficiently solving the problem. The case studies highlight the efficiency of the proposed approach.
arXiv.org Artificial Intelligence
Jun-3-2024
- Country:
- North America > United States
- Pennsylvania > Northampton County
- Bethlehem (0.04)
- California > Alameda County
- Berkeley (0.04)
- Pennsylvania > Northampton County
- Asia > Middle East
- Republic of Türkiye
- Karaman Province > Karaman (0.04)
- Aksaray Province > Aksaray (0.04)
- Republic of Türkiye
- North America > United States
- Genre:
- Research Report (0.82)
- Industry:
- Leisure & Entertainment > Games (0.41)
- Technology: