arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.12848cs.GTcs.SYeess.SY
收藏

规避感知受限追捕者的最优策略

Optimal Evasion from a Sensing-Limited Pursuer

Dipankar Maity, Alexander Von Moll, Daigo Shishika, Michael Dorothy

AI总结:

针对有限感知追捕者的部分信息追逃博弈,本文推导固定终止时间下最大化终端距离的最优规避策略,并求解追捕者可选终止时间时的Nash均衡。

摘要:

本文研究一种部分信息追逃博弈,其中追捕者(Pursuer)配备有限距离传感器,用于探测逃跑者(Evader)。在给定固定终止时间的条件下,我们推导了逃跑者的最优规避策略,以最大化其在终止时刻与追捕者之间的距离。分析表明,在某些参数区间内,最优逃跑策略包含一种“冒险”机动:逃跑者的轨迹会极其接近追捕者的感知边界,随后绕到追捕者后方。此外,我们还探讨了追捕者可以选择终止时间的特殊情形;在该场景下,我们确定了关于终止时间与规避策略的一个(Nash)均衡策略对。

英文摘要:

This paper investigates a partial-information pursuit evasion game in which the Pursuer has a limited-range sensor to detect the Evader. Given a fixed final time, we derive the optimal evasion strategy for the Evader to maximize its distance from the pursuer at the end. Our analysis reveals that in certain parametric regimes, the optimal Evasion strategy involves a 'risky' maneuver, where the Evader's trajectory comes extremely close to the pursuer's sensing boundary before moving behind the Pursuer. Additionally, we explore a special case in which the Pursuer can choose the final time. In this scenario, we determine a (Nash) equilibrium pair for both the final time and the evasion strategy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑