TY - JOUR
T1 - A probabilistic safety-aware strategy in stochastic multi-agent reach-avoid games
AU - Zhang, Ye
AU - Zhu, Yutong
AU - Yuan, Huanhuan
AU - Yuan, Yuan
N1 - Publisher Copyright:
© 2025 The Franklin Institute. Published by Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
PY - 2025/12
Y1 - 2025/12
N2 - In this paper, a defender-focused stochastic model for multi-agent systems is considered in a reach-avoid game. During the pursuit-evasion process between defenders and attackers, the problem of collision avoidance with both obstacles and other defenders is addressed. First, a safety-aware predictive planning method is proposed for stationed attackers. Obstacle avoidance and finite-time stability are guaranteed in the probabilistic game based on the strategy from zero-sum game analysis. Then, for pursuit of maneuvering attackers, a collision-free cross-pursuit strategy is used to achieve successful pursuit and safety of the defenders at the same time. A high-probability pursuit region is computed based on stochastic reachable sets. When there is a potential of conflict between two defenders, a collision-free re-allocation is initiated to guarantee the completion of the pursuit under the influence of flow-field disturbances. The feasibility and performance of the proposed strategy is demonstrated by simulation results.
AB - In this paper, a defender-focused stochastic model for multi-agent systems is considered in a reach-avoid game. During the pursuit-evasion process between defenders and attackers, the problem of collision avoidance with both obstacles and other defenders is addressed. First, a safety-aware predictive planning method is proposed for stationed attackers. Obstacle avoidance and finite-time stability are guaranteed in the probabilistic game based on the strategy from zero-sum game analysis. Then, for pursuit of maneuvering attackers, a collision-free cross-pursuit strategy is used to achieve successful pursuit and safety of the defenders at the same time. A high-probability pursuit region is computed based on stochastic reachable sets. When there is a potential of conflict between two defenders, a collision-free re-allocation is initiated to guarantee the completion of the pursuit under the influence of flow-field disturbances. The feasibility and performance of the proposed strategy is demonstrated by simulation results.
KW - Cooperative probabilistic games
KW - Nash equilibrium
KW - Reach-avoid games
KW - Stochastic reachability
UR - https://www.scopus.com/pages/publications/105025806773
U2 - 10.1016/j.jfranklin.2025.108172
DO - 10.1016/j.jfranklin.2025.108172
M3 - 文章
AN - SCOPUS:105025806773
SN - 0016-0032
VL - 362
JO - Journal of the Franklin Institute
JF - Journal of the Franklin Institute
IS - 18
M1 - 108172
ER -