arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.14407eess.SYcs.SY
收藏

基于势对策的异质追逐者接力追逐问题

Relay Pursuit of an Evader by a Heterogeneous Group of Pursuers Using Potential Games

Yoonjae Lee, Efstathios Bakolas

摘要:

我们提出了一个分散的解决方案的追求-逃避游戏涉及一个异质组的理性(自私)的追求者和一个单一的逃避者的基础上潜在的游戏框架。在这个游戏中,逃避者的目标是延迟(或者,如果可能的话,避免)被任何追捕者捕获,而每个追捕者只有在符合他的最佳利益的情况下才试图捕获后者。我们的方法在原则上类似于[1]中介绍的所谓的中继追踪策略,其中只有能够比其他人更快地捕获逃避者的追踪者才是活跃的。与后一种方法形成鲜明对比的是,这里的主动追踪者不是由反应式自组织规则确定的,而是来自相应的潜在博弈的解。我们假设每个追捕者都有不同的能力,他是否追捕逃避者的决定是基于他个人效用的最大化(以其他追捕者的选择和行动为条件)。追捕者的效用既取决于他们通过捕获逃避者而获得的奖励,也取决于捕获时间(捕获逃避者的成本),因此追捕者应该只在所产生的成本相对较小时才寻求捕获。主动追踪者-逃避者分配(换句话说,哪些追踪者应该是主动的)的确定通过使追踪者交换信息并通过执行用于被称为空间自适应游戏(SAP)的游戏的学习算法来更新他们自己的动作来迭代地完成。我们通过大量的数值模拟来说明我们的算法的性能。

英文摘要:

We propose a decentralized solution for a pursuit-evasion game involving a heterogeneous group of rational (selfish) pursuers and a single evader based on the framework of potential games. In the proposed game, the evader aims to delay (or, if possible, avoid) capture by any of the pursuers whereas each pursuer tries to capture the latter only if this is to his best interest. Our approach resembles in principle the so-called relay pursuit strategy introduced in [1], in which only the pursuer that can capture the evader faster than the others is active. In sharp contrast with the latter approach, the active pursuer herein is not determined by a reactive ad-hoc rule but from the solution of a corresponding potential game. We assume that each pursuer has different capabilities and his decision whether to go after the evader or not is based on the maximization of his individual utility (conditional on the choices and actions of the other pursuers). The pursuers' utilities depend on both the rewards that they will receive by capturing the evader and the time of capture (cost of capturing the evader) so that a pursuer should only seek capture when the incurred cost is relatively small. The determination of the active pursuer-evader assignments (in other words, which pursuers should be active) is done iteratively by having the pursuers exchange information and updating their own actions by executing a learning algorithm for games known as Spatial Adaptive Play (SAP). We illustrate the performance of our algorithm by means of extensive numerical simulations.

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

↑