Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102795
Title: Solvability sets in pursuit problem with two pursuers and one evader
Authors: Kumkov, S. S.
Le, Menec, S.
Patsko, V. S.
Issue Date: 2014
Publisher: IFAC Secretariat
Citation: Kumkov S. S. Solvability sets in pursuit problem with two pursuers and one evader / S. S. Kumkov, S. Le Menec, V. S. Patsko. — DOI 10.3182/20140824-6-za-1003.01853 // IFAC Proceedings Volumes (IFAC-PapersOnline). — 2014. — Vol. 19. — P. 1543-1549.
Abstract: The paper deals with a differential game with two pursuers and one evader. Dynamics of each object is described by a stationary linear system of a general type with a scalar control. The payoff is the minimum of two one-dimensional misses between the first pursuer and the evader and between the second pursuer and the evader. The misses are calculated at the instants fixed in advance. A method is described for constructing the level sets of the value function (i.e., the solvability ones for the game under consideration). For the case of "strong" pursuers, the optimal strategies are described. Results of simulations are given. The zero-sum game investigated can be useful for the research of the final stage of a space pursuit, where two pursuing objects and one evader are involved. © IFAC.
Keywords: FIXED TERMINATION INSTANT
GROUP DIFFERENTIAL PURSUIT-EVASION GAMES
LINEAR DYNAMICS
OPTIMAL FEEDBACK CONTROL
VALUE FUNCTION
AUTOMATION
LINEAR SYSTEMS
NUMERICAL METHODS
FIXED TERMINATION INSTANT
LINEAR DYNAMICS
OPTIMAL FEEDBACK CONTROL
PURSUIT EVASION GAMES
VALUE FUNCTIONS
GAME THEORY
URI: http://hdl.handle.net/10995/102795
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84929728524
PURE ID: 305776
2548cef6-383f-40ac-a4e2-b0c5cf9c0f3c
ISSN: 14746670
ISBN: 9783902823625
DOI: 10.3182/20140824-6-za-1003.01853
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84929728524.pdf2 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.