Revisiting a Three-Player Pursuit-Evasion Game

János Szőts (), Andrey V. Savkin () and István Harmati ()
Additional contact information
János Szőts: Budapest University of Technology and Economics
Andrey V. Savkin: University of New South Wales
István Harmati: Budapest University of Technology and Economics

Journal of Optimization Theory and Applications, 2021, vol. 190, issue 2, No 10, 601 pages

Abstract: Abstract We consider the game of a holonomic evader passing between two holonomic pursuers. The optimal trajectories of this game are known. We give a detailed explanation of the game of kind’s solution and present a computationally efficient way to obtain trajectories numerically by integrating the retrograde path equations. Additionally, we propose a method for calculating the partial derivatives of the Value function in the game of degree. This latter result applies to differential games with homogeneous Value.

Keywords: Game theory; Optimal strategies; Differential games; Pursuit-Evasion; 49N75 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-021-01899-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:190:y:2021:i:2:d:10.1007_s10957-021-01899-8

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-021-01899-8

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().