On the number of pursuers that guarantees the capture of the evader in the game on the graph of icosahedral edges
The article is devoted to the study of the change in the optimal number of pursuers when removing one edge in a differential game on graphs. It is shown that when one edge of the icosahedron is removed, two pursuers are sufficient to capture the evader, whereas for the icosahedron itself, this number is 3.
Authors
- Абдулла Азамов (ORCID: https://orcid.org/0000-0003-3516-0904)
- A. G. Holboyev
- Азамат Холбоев
Institutions
- Academy of Sciences Republic of Uzbekistan (UZ)
- National Pedagogical University of Uzbekistan named after Nizami (UZ)
Publication Details
- Journal
- Mathematical Game Theory and Applications
- Published
- 2024-12-03
- DOI
- https://doi.org/10.17076/mgta_2024_3_77
- Primary Topic
- Guidance and Control Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00