Jul 2026
Multi-Agent Planning with Spatio-Temporal and Topological Constraints using STL-GO
Two encodings of the problem of planning multi-agent paths that satisfy constraints written in STL-GO are presented, one based on mixed-integer programming (MIP) and another based on satisfiability modulo theory (SMT), with soundness guarantees.
Sheryl Paul, Vidisha Kudalkar, Anand Balakrishnan et al.
· arXiv.org · 0 citations