Capture, Shield, or Neutralize: Engagement-Aware Pursuit-Evasion
Abstract
This paper introduces a hierarchical control architecture for multi-agent adversarial environments, decoupling strategic task planning from rigorous safety assurance. The system formulates pursuit-evasion as a zero-sum receding-horizon game, solved via an iterative minimax \acl{mpc} scheme. This allows pursuers to anticipate and block evader trajectories using transverse velocity penalties rather than relying on reactive heuristic formations. To guarantee collision-free operation without compromising the convexity of the \acl{mpc}, a discrete-time \acl{cbf} operates as an inner-loop safety filter. Through simulated experiments, we demonstrate the framework's adaptability. By simply altering the weights of the shared zero-sum payoff and \acl{cbf} constraints, the swarm can fluidly switch from aggressive pursuit-evasion tactics to strict perimeter defense and area denial, demonstrating robust performance across varying rules of engagement without structural changes to the control logic. The source code is available: https://github.com/ananya-ac/pursuit-evasion-mpc-cbf.
Cite
@article{arxiv.2607.10986,
title = {Capture, Shield, or Neutralize: Engagement-Aware Pursuit-Evasion},
author = {Ananya Acharya and Trenton Goyette and Masoud Ataei and Adrian Stoica and Vikas Dhiman and Mohammad Javad Khojasteh},
journal= {arXiv preprint arXiv:2607.10986},
year = {2026}
}