Research Vision: Multi-Agent Path Planning for Cops And Robbers Via Reactive Synthesis

2025-03-14

AI Summary

This paper addresses the realizability and strategy synthesis problems for path planning in generalized multi-agent pursuit-evasion games (cops-and-robbers games). We propose a unified framework based on Linear Temporal Logic over finite traces (LTL_f) and cooperative synthesis, pioneering the application of reactive program synthesis to such games. Our approach formally models dynamic multi-agent interaction constraints and automatically decides the existence of a winning capture strategy. Integrating formal modeling, automata theory, and coordinated synthesis algorithms, it unifies realizability checking and strategy generation into a single workflow, producing executable, coordinated control programs. Key contributions include: (i) establishing a rigorous mapping between pursuit-evasion games and reactive program synthesis; (ii) extending beyond traditional single-agent assumptions to support asynchronous, partially observable multi-agent cooperative strategy synthesis; and (iii) providing a formally verifiable foundation for control synthesis in safety-critical multi-robot systems.

Technology Category

• Multiagent Systems: Multiagent Planning
• Game Theory and Economic Paradigms: Cooperative Game Theory
• Humans and AI: Human-Aware Planning and Behavior Prediction

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Responsible Web: Machine-in-the-loop, human agency and autonomy
• Search and Retrieval-Augmented AI: Agentic search

Abstract

We propose the problem of multi-agent path planning for a generalization of the classic Cops and Robbers game via reactive synthesis. Specifically, through the application of LTLt and Coordination Synthesis, we aim to check whether various Cops and Robbers games are realizable (a strategy exists for the cops which guarantees they catch the robbers). Additionally, we construct this strategy as an executable program for the multiple system players in our games. In this paper we formalize the problem space, and propose potential directions for solutions. We also show how our formalization of this generalized cops and robbers game can be mapped to a broad range of other problems in the reactive program synthesis space.

Problem

• Multi-agent path planning for Cops and Robbers game
• Check realizability of strategies using LTLt and Coordination Synthesis
• Map generalized game to reactive program synthesis problems

Innovation

• Multi-agent path planning via reactive synthesis
• LTLt and Coordination Synthesis for strategy verification
• Executable program construction for system players