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

arXiv: https://arxiv.org/abs/2503.11475 · HTML: https://mlsanity.com/paper/2503.11475/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 14 of its 27 references that are in the map.
- First posted on arXiv 14 Mar 2025.

## Builds on (most cited first, 14 of 14)

- [Verification-Guided Shielding for Deep Reinforcement Learning](https://mlsanity.com/paper/2406.06507/) (2024)
- [Shield Synthesis for LTL Modulo Theories](https://mlsanity.com/paper/2406.04184/) (2024)
- [Boolean Abstractions for Realizability Modulo Theories (Extended version)](https://mlsanity.com/paper/2310.17292/) (2023)
- [Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)](https://mlsanity.com/paper/2204.13693/) (2022)
- [The Reactive Synthesis Competition (SYNTCOMP): 2018-2021](https://mlsanity.com/paper/2206.00251/) (2022)
- [Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts](https://mlsanity.com/paper/1709.04986/) (2017)
- [GenSys: A Scalable Fixed-point Engine for Maximal Controller Synthesis over Infinite State Spaces](https://mlsanity.com/paper/2107.08794/) (2021)
- [Reactive Synthesis Modulo Theories Using Abstraction Refinement](https://mlsanity.com/paper/2108.00090/) (2021)
- [Solving Infinite-State Games via Acceleration (Full Version)](https://mlsanity.com/paper/2305.16118/) (2023)
- [Localized Attractor Computations for Infinite-State Games (Full Version)](https://mlsanity.com/paper/2405.09281/) (2024)
- [Synthesis of coordination programs from linear temporal logic](https://mlsanity.com/paper/1911.03807/) (2019)
- [Predictable and Performant Reactive Synthesis Modulo Theories via Functional Synthesis](https://mlsanity.com/paper/2407.09348/) (2024)
- [Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)](https://mlsanity.com/paper/2411.07078/) (2024)
- [Constrained LTL Specification Learning from Examples](https://mlsanity.com/paper/2412.02905/) (2024)

## Abstract (arXiv)

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.