Approaching a coalition of evaders

MaRDI QIDQ580208zbMATH OpenFDO

Authors Igor I. Shevchenko

Publication date 1986

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

coalition of evadersoptimal pursuit strategypursuer

Mathematics Subject Classification ID

Differential games (aspects of game theory) (91A23) Positional games (pursuit and evasion, etc.) (91A24) Game theory (91A99)

Review text

This paper studies a very simple model of conflict in which a pursuer approaches a coalition of evaders. The distance between the pursuer and the coalition is defined as the distance to the remotest evader. In the special case of two evaders, the optimal pursuit strategy is derived, as well as the guaranteed distance to the coalition. For the case of more than two evaders, an upper bound of this distance, which corresponds to a programmed method of selection of a pair of evaders being approached, is obtained.

Recommendations

• Approaching Coalitions of Evaders on the Average
• Successive pursuit with a bounded detection domain
• Strategy of evasion from many pursuers
• scientific article; zbMATH DE number 3924559
• scientific article; zbMATH DE number 1944082

Cited in

(4)

• Evasion with weak superiority
• Minimizing the distance to one evader while chasing another
• Strategy of evasion from many pursuers
• Approaching Coalitions of Evaders on the Average

This page was built for publication: Approaching a coalition of evaders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580208)