In this paper, we present the route planning algorithm for light aircraft. Our goal is to find a collision-free, kinodynamic compatible route in a three dimensional space. Moreover, we take into account the interactions of the aircraft with wind. We develop a series of algorithms to recast the flying environment and present it with a series of polyhedrons. We introduce a mixed-integer linear formulation of the problem. Moreover, we create a two-stage approach which can find the near-optimal route with a reasonable computational time. Numerical results show the efficiency of our approach. In this research, we find the minimum-time route between two locations. We only study the route planning for a given aircraft. In the future steps, we would like to expand the algorithm for the case where there are several flying aircraft within the same area. This algorithm has been proven to be computationally efficient. It can be applied for the network of drones with minor changes in the formulation. The proposed route, in this paper which is based on the traveling time, may not be fuel-efficient. In the future step, approaches such as aircraft performance model can be integrated in our resolution method to investigate the trade-off between flying time and fuel consumption and derive a multi-objective version of the route planning problem investigated in this paper.
Collected and summarized from the source below by Ta Ngoc Diep: https://db.vista.gov.vn:2095/science/article/pii/S0968090X18311628