发表机构
Beihang University; Zhongguancun Laboratory; Hangzhou Innovation Institute, Beihang University; China North Vehicle Research Institute（北京航空航天大学; 中关村实验室; 北京航空航天大学杭州创新研究院; 中国北方车辆研究所）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文研究两个攻击者与一个防御者的可达-规避博弈，针对攻击者异构最大速度信息不对称场景，提出临界速度对框架，证明慢速欺骗策略可误导防御者并提升攻击者收益。
AI 中文摘要
本文研究了一个涉及两个攻击者和一个防御者的可达-规避博弈，其中攻击者旨在最大化到达目标区域的数目，而防御者则旨在最小化该数目。与传统的完全信息模型不同，我们考虑了一种信息不对称场景，其中攻击者的异构最大速度是私下已知的，但公开披露为位于连续区间内。然而，现有关于不确定速度的研究主要集中于同构设置，而异构性将不确定性从共同能力水平扩展到攻击者的相对能力配置。为了解决在无限多种可能速度组合下产生的捕获顺序模糊性，我们建立了一个临界速度对框架，该框架刻画了不同能力配置何时会诱发不同的最优捕获顺序，并支持对防御者猜测行为的分析以及攻击者信息限制策略的设计。我们证明，在某些初始条件下，攻击者可以通过慢速欺骗策略误导防御者做出次优决策，从而获得比完全信息博弈更优的收益。数值可视化揭示了此类困境条件的普遍存在。
英文摘要
This letter investigates a reach-avoid game involving two Attackers and one Defender, where the Attackers aim to maximize the number reaching the target region while the Defender seeks to minimize it. In contrast to conventional complete information formulations, we consider an information asymmetry scenario where the Attackers' heterogeneous maximum speeds are privately known but publicly disclosed to lie within continuous ranges. Existing studies on uncertain speeds, however, have primarily focused on homogeneous settings, whereas heterogeneity extends the uncertainty from a common capability level to the relative capability configuration of the Attackers. To address the resulting capture-order ambiguity over infinitely many possible speed combinations, we establish a critical speed pair framework that characterizes when different capability configurations induce different optimal capture orders, and enables the analysis of the Defender's guessing behavior and the design of information-limiting strategies for the Attackers. We demonstrate that under certain initial conditions, the Attackers can mislead the Defender into making suboptimal decisions through a slow-speed deception strategy, achieving superior payoffs compared to the complete information game. Numerical visualizations reveal the widespread occurrence of such dilemma conditions.
