We address the problem of devising an optimized energy aware flight plan for multiple Unmanned Aerial Vehicles (UAVs) mounted Base Stations (BS) within heterogeneous networks. The chosen approach makes use of Q-learning algorithms, through the definition of a reward related to relevant quality and battery consumption metrics, providing also service overlapping avoidance between UAVs, that is two or more UAVs serving the same cluster area. Numerical simulations and different training show the effectiveness of the devised flight paths in improving the general quality of the heterogeneous network users.
Energy and quality aware multi-UAV flight path design through Q-learning algorithms / Zouaoui, Hend; Faricelli, Simone; Cuomo, Francesca; Colonnese, Stefania; Chiaraviglio, Luca. - 11618:(2019), pp. 246-257. (Intervento presentato al convegno Wired/Wireless Internet Communications tenutosi a Bologna) [10.1007/978-3-030-30523-9_20].
Energy and quality aware multi-UAV flight path design through Q-learning algorithms
Cuomo, Francesca;Colonnese, Stefania;
2019
Abstract
We address the problem of devising an optimized energy aware flight plan for multiple Unmanned Aerial Vehicles (UAVs) mounted Base Stations (BS) within heterogeneous networks. The chosen approach makes use of Q-learning algorithms, through the definition of a reward related to relevant quality and battery consumption metrics, providing also service overlapping avoidance between UAVs, that is two or more UAVs serving the same cluster area. Numerical simulations and different training show the effectiveness of the devised flight paths in improving the general quality of the heterogeneous network users.File | Dimensione | Formato | |
---|---|---|---|
Zouaoui_Energy_19.pdf
solo gestori archivio
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
970.15 kB
Formato
Adobe PDF
|
970.15 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.