Michele Da Re
Distributed algorithms for autonomous target search problems.
Rel. Fabio Fagnani, Sara Bernardini, Nicola Gatti. Politecnico di Torino, Corso di laurea magistrale in Ingegneria Matematica, 2020
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (3MB) | Preview |
Abstract
Search-and-Tracking (SaT) is a problem where an autonomous vehicles such as an UAV (Unmanned Aerial Vehicle, commonly known as 'drone') has the task of tracking a target while it moves and, whenever the target is lost, perform a search phase. In this work, the problem is approached with a focus on the search phase and with the assumption that the target is moving towards its destination along the optimal ruote and without trying to evade the search. Previous work on this problem developed a Monte Carlo simulation that allows the UAV to select a number of candidate locations where to perform the search.
The goal is to find a sequence of such locations that is time-feasible and that maximazes an objective function that is related to the probability of success and the expected time of target recovery
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
Ente in cotutela
URI
![]() |
Modifica (riservato agli operatori) |
