STL-GO: Multi-Agent Path Planning with Spatio-Temporal and Topological Constraints
A new arXiv paper (2607.28679) introduces a planning method for multi-agent systems that must satisfy spatio-temporal and topological constraints, formalized using Spatio-Temporal Logic with Graph Operators (STL-GO). The approach addresses challenges in applications like multi-robot wildfire fighting and unmanned aerial inspection in factories, where agents must coordinate actions in time and space while respecting interaction topologies (e.g., sensing, communication, task graphs). The paper tackles the problem of encoding multiple, potentially time-varying graphs into a planning framework, a significant computational challenge. The work is relevant to the growing field of autonomous multi-robot systems and formal methods for robotics.
Key facts
- arXiv paper 2607.28679 proposes multi-agent planning using STL-GO.
- STL-GO is a spatio-temporal logic with graph operators.
- The logic supports reasoning about multiple agents and their topologies.
- Applications include multi-robot wildfire fighting and factory inspection.
- The problem involves encoding time-varying graphs.
- The paper addresses spatio-temporal and topological constraints.
- The approach is for planning multi-agent paths.
- The paper is announced as 'new' on arXiv.
Entities
Institutions
- arXiv