Article

On the Number of Pursuers That Guarantees the Capture of the Evader in a Game on the Graph of Icosahedral Edges

Абдулла АзамовInstitute of Mathematics, Uzbekistan Academy of Science, 100174, Tashkent, UzbekistanA. G. HolboyevTashkent State Pedagogical University, 100185, Tashkent, Uzbekistan

Doklady Mathematicsjournal2024en

ABI

Abstract

We study how the optimal number of pursuers in a differential game on a graph changes when an edge is removed from the graph. It is shown that, when one edge of an icosahedron is removed, two pursuers are sufficient to capture the evader, whereas, for the icosahedron itself, this number is 3.

Topics

Optimization and Search Problems Artificial Intelligence in Games Guidance and Control Systems

Identifiers

DOI: 10.1134/s1064562424602671

Citations and references

Cited by 012 references

Metrics — AkademScholar · Coming soon