Optimal number of pursuers in differential games on the 1-skeleton of an orthoplex
We study a differential game of many pursuers and one evader. All the players move only along the one-skeleton graph of an orthoplex of dimension d+1. It is assumed that the maximal speeds of the pursuers are less than the speed of the evader. By definition, the pursuit is completed if the position...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Julkaistu: |
MDPI AG
2021
|