Answers are grounded in this paper and cite their sources.
This article addresses an asymmetric multiagent pursuit-evasion (MPE) differential gaming scenario, where pursuers, subject to the presence of external disturbances and unknown dynamics, aim to collaboratively intercept escaping evaders. The core technical challenge lies in designing a distributed optimal gaming protocol for such incomplete-information MPE games in an adversarial environment while guaranteeing the attainment of the Nash equilibrium. To address this problem, a model-based differential gaming framework is presented to eliminate the coupled terms in the associated Hamilton-Jacobi-Isaacs (HJI) equations and accordingly derive a distributed Nash equilibrium solution for multiagent systems (MASs). To dispense with prior knowledge of the pursuers' dynamics, a data-driven off-policy reinforcement learning (RL) algorithm is devised to learn the pursuers' optimal strategies online. Finally, simulation results are elaborated to validate the effectiveness of the proposed gaming strategy.
No takes yet. Share an insight, caveat, or question.
Shi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: