EUVIMEDEUVIMED entdecken
Crossref

Evasion differential game of a faster evader from multiple pursuers

G.I. Ibragimov, T.G. Tursunaliev

Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki · 20.06.2026 · 36 (2) · 255-276

DOI: 10.35634/vm260204 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, erschienen am 20.06.2026. Verfasst von G.I. Ibragimov und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study a linear differential game involving a single evader and $m$ pursuers, $m\geq2$, in $\mathbb R^n$. The pursuers' control sets are unit balls, while the evader's control set is a ball of radius $\sigma$, where $\sigma>1$. We say that evasion is possible if the state of the evader does not coincide with the state of any pursuer for all $t\geq0$. To solve the evasion problem, a strategy is proposed for the evader, and it is shown that evasion is possible from any given initial positions of players. Using this strategy, we show that the maximum number of approach times of the pursuers to the evader is bounded above by $m(m+1)/2$.

Zitieren

APA

Ibragimov, G., & Tursunaliev, T. (2026). Evasion differential game of a faster evader from multiple pursuers. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 36(2), 255-276. https://doi.org/10.35634/vm260204

Vancouver

Ibragimov G, Tursunaliev T. Evasion differential game of a faster evader from multiple pursuers. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki. 2026;36(2):255-276. doi:10.35634/vm260204

BibTeX
@article{Ibragimov2026,
  author = {Ibragimov, G.I. and Tursunaliev, T.G.},
  title = {Evasion differential game of a faster evader from multiple pursuers},
  journal = {Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki},
  year = {2026},
  volume = {36},
  number = {2},
  pages = {255--276},
  doi = {10.35634/vm260204}
}
Kostenlos starten →