Guaranteed strategies for escaping encirclement


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

This paper considers a conflict situation on the plane as follows. A fast evader E has to break out the encirclement of slow pursuers Pj1,...,jn = {Pj1,..., Pjn }, n ≥ 3, with a miss distance not smaller than r ≥ 0. First, we estimate the minimum guaranteed miss distance from E to a pursuer Pa, a ∈ {j1,..., jn}, when the former moves along a given straight line. Then the obtained results are used to calculate the guaranteed estimates to a group of two pursuers Pb,c = {Pb, Pc}, b, c ∈ {j1,..., jn}, bc, when E maneuvers by crossing the rectilinear segment PbPc, and the state passes to the domain of the game space where E applies a strategy under which the miss distance to any of the pursuers is not decreased. In addition, we describe an approach to the games with a group of pursuers Pj1,...jn, n ≥ 3, in which E seeks to break out the encirclement by passing between two pursuers Pb and Pc, entering the domain of the game space where E can increase the miss distance to all pursuers by straight motion. By comparing the guaranteed miss distances with r for all alternatives b, c ∈ {j1,..., jn}, bc, and a ∉ {b, c}, it is possible to choose the best alternative and also to extract the histories of the game in which the designed evasion strategies guarantee a safe break out from the encirclement.

作者简介

I. Shevchenko

Pacific Research Fishery Center (TINRO-Center); Far Eastern Federal University

编辑信件的主要联系方式.
Email: igor.shevchenko@tinro-center.ru
俄罗斯联邦, Vladivostok; Vladivostok

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017