Asosiy kontentga oʻtish
Maqola

Evasion differential game of a faster evader from multiple pursuers

Gafurjan IbragimovUniversity of Public Safety of the Republic of UzbekistanT.G. TursunalievTashkent International University of Financial Management and Technologies
2026ru
ABI

Annotatsiya

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$.

Hali tarjima qilinmagan

Identifikatorlar

Iqtiboslar va manbalar

0 ta iqtibos0 ta foydalanilgan manba