Premium
Strategy of evasion from many pursuers
Author(s) -
Zak V. L.
Publication year - 1986
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.4660070406
Subject(s) - evasion (ethics) , piecewise , constraint (computer aided design) , interval (graph theory) , object (grammar) , differential game , terminology , mathematical optimization , computer science , function (biology) , differential (mechanical device) , motion (physics) , mathematics , artificial intelligence , engineering , combinatorics , geometry , aerospace engineering , mathematical analysis , linguistics , philosophy , immune system , evolutionary biology , immunology , biology
A differential game of evasion with many participants (a game of kind in the terminology of Isaacs 1 ) is considered. One controlled object (the evader) seeks to avoid contact with each of several pursuers. The motion of the evader is subject to a phase constraint. An efficient method (up to the explicit formulae) of constructing the evader's strategy is proposed. This strategy ensures evasion on the infinite time interval and the fulfilment of the phase constraint. The evader's control corresponding to this strategy is always a piecewise‐programme function of time, and the number of programme pieces is finite (there is an upper estimate for this number). There is a lower estimate for the minimal distance between the evader and the pursuers.