Contribution to the optimization of the flight duration of autonomous drones: Flight path planning

Abstract

Unmanned aerial vehicle(UAV) are suitable tools to provide a fast wireless communication infrastructure. They can be deployed to support the capacity of conventional base stations(BS) when they are overloaded. This can happen in some cases as special events or abnormal congestion in a cell. However, UAVs entail multiple constraints such as the cost of service, lifetime of drones , and the need for fast and high-quality service. Although previous research papers propose a mixed programming model to address this challenging problem, given that drones can perform multiple supports for many BSs. This raises different questions as : how to manage the cost of service ? and how to maximize the quality of the services while minimizing the time service including capacity of the drone. for this purpose , we consider the question as a single, how the branch-and-bound approach can be tailored to solve the vehicle routing problem faster. Subsequently, a dual approach was used. The used method takes the different aspect into consideration and captures changes in total profit. the performance of our method is analyzed and compared with a different approach, by considering another aspect of optimization.