Over the past few years, Unmanned Aerial Vehicles (UAVs) have become more and more popular. The complexity of routing UAVs has not been fully investigated in the literature. In this paper, we provide a formal definition of the UAV Routing and Trajectory Optimisation Problem (UAVRTOP). Next, we introduce a taxonomy and review recent contributions in UAV trajectory optimisation, UAV routing and articles addressing these problems, and their variants, simultaneously. We conclude with the identification of future research opportunities.

This paper deals with the Close-Enough Traveling Salesman Problem (CETSP). In the CETSP, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we propose a simple yet effective exact algorithm, based on Branch-and-Bound and Second Order Cone Programming (SOCP). The proposed algorithm was tested in 824 instances suggested in the literature. Optimal solutions are obtained for open problems with up to a thousand vertices. We consider both instances in the two-and three-dimensional space.

In this paper, we introduce the Glider Routing and Trajectory Optimisation Problem (GRTOP), the problem of finding optimal routes and trajectories for a fleet of gliders with the mission of surveying a set of locations. We propose a novel MINLP formulation for the GRTOP. In our approach, we consider the gliders' flight dynamics during the definition of the routes. In order to achieve better convergence, we linearise the gliders' dynamics and relax the dynamic constraints of our model, converting the proposed MINLP into a MISOCP. Several different discretisation techniques and solvers are compared. The formulation is tested on 180 randomly generated instances. In addition, we solve instances inspired by risk maps of flooding-prone cities across the UK.

No abstract

No abstract