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.
View on arXiv@article{fishell2025_2503.11475,
title={ Research Vision: Multi-Agent Path Planning for Cops And Robbers Via Reactive Synthesis },
author={ William Fishell and Andoni Rodriguez and Mark Santolucito },
journal={arXiv preprint arXiv:2503.11475},
year={ 2025 }
}