Skip to main navigation Skip to search Skip to main content

Optimisation d’un réseau ad hoc de véhicules aériens sans pilote (UAV) dans un environnement urbain: Positionnement des UAV à l'aide de l'apprentissage automatique

Translated title of the thesis: Optimizing an ad-Hoc unmanned aerial vehicle (UAV) network in an urban environment: Positioning UAVs using machine learning
  • Assohoun Jean Honorat Koffi

Student thesis: Master's thesisMaster in Engineering: Engineering

Abstract

The recent but remarkable emergence of unmanned aerial vehicles (UAVs), which will soon occupy most of our service systems, is key to the expansion of new communication technologies and wireless networks. These machines can be used as flying base stations to extend and/or improve the coverage of the land mobile communication system in order to respond effectively to the ever-increasing demand for traffic. However, determining the best positions for these vehicles during their deployment remains a real and major challenge to achieve satisfactory results from them. In this study we aim to propose a new 3D deployment scheme of a multi-UAVs network in an area covered by a cluttered or damaged base station (BS), integrating machine learning to maximize the number of users served while maximizing operator benefits. First, we propose an algorithm to determine the optimal number of UAVs to be deployed to serve all users, considering their varied service requirements. We then determine the optimal locations of these aerial vehicles using a partitioning and positioning algorithm that integrates the auto-encoders to optimize the locations, before finding their altitude. The simulation of our algorithm is performed under MATLAB. The numerical results show that our proposed Deep K-means approach can serve a very large percentage of users based on the number of UAVs used while maximizing operator profit.
Date22 Feb 2021
Original languageFrench
Awarding Institution
  • École de technologie supérieure
SupervisorMichel Kadoch (Supervisor)

Cite this

'