Guaranteed time of pursuit for the strategy of parallel approach

Authors

  • S.V. Pashko

DOI:

https://doi.org/10.15407/dopovidi2014.04.043

Keywords:

strategy of parallel approach, time of pursuit

Abstract

This paper is concerned with differential pursuit-evasion games, in which several players chase one, using the strategy of parallel approach. The strategy of evasion is constructed, and its optimality is proved. Optimal strategies of evasion are investigated. Linear programming problems, which specify the optimal strategies of evasion, are stated.

Downloads

References

Petrosyan L. A., Tomskiy G. V. Geometry of simple pursuit. Novosibirsk: Nauka, 1983 (in Russian).

Vieira Marcos A. M., Govindan R., Sukhatme G. S. J. of Intelligent Service Robotics. Special Iss. on Networked Robots, 2009, 2: 247–263.

Rikhsiev B. B. Differential games with simple movements. Tashkent: FAN, 1989 (in Russian).

Karmanov V. G. Mathematical programming. Moscow: FIZMATLIN, 2004 (in Russian).

Kolmogorov A. N., Fomin S. V. Elements of the theory of functions and functional analysis. Moscow: Nauka, 1972 (in Russian).

Pashko S. V. Probl. upravleniia i informatiki, 2012, No. 6: 30–43 (in Russian).

Downloads

Published

17.02.2025

How to Cite

Pashko, S. (2025). Guaranteed time of pursuit for the strategy of parallel approach . Reports of the National Academy of Sciences of Ukraine, (4), 43–48. https://doi.org/10.15407/dopovidi2014.04.043

Issue

No. 4 (2014): Reports of the National Academy of Sciences of Ukraine

Section

Information Science and Cybernetics

License

Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.