CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper studies a discrete-time pursuit–evasiongame within a convex polygonal environment. Building on solutions of the classic lion-and-man problem, two strategies are proposed for the pursuer, which guarantee exact capture in finite time and provide upper bounds on the time-to-capture at each move of the game. A numerical procedure for updating the so-called center of the game, which is instrumental for computing the lion's move, is devised. Numerical simulations show that optimizing the center position, with respect to a suitable cost function taking into account the structure of the environment, allows one to remarkably reduce the number of moves required to capture the evader.
Casini, M., Criscuoli, M., & Garulli, A. (2019). A discrete-time pursuit–evasion game in convex polygonal environments. SYSTEMS & CONTROL LETTERS, 125, 22-28.
| Titolo: | A discrete-time pursuit–evasion game in convex polygonal environments |
| Autori: | |
| Rivista: | |
| Citazione: | Casini, M., Criscuoli, M., & Garulli, A. (2019). A discrete-time pursuit–evasion game in convex polygonal environments. SYSTEMS & CONTROL LETTERS, 125, 22-28. |
| Anno: | 2019 |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| Casini-2019-A-discrete-time-pursuitevasion-game.pdf | PDF editoriale | NON PUBBLICO - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11365/1070287
Copyright © 2021