Intelligent foresight for UAV routing problems

This paper describes an Intelligent Foresight (IF) method for improving the response time of a UAV routing optimisation, using the optimal solution of a smaller size scenario, as a warm-start for the Ant Colony Optimisation. The method aims to predict the revised routing and allocation of UAVs in the event of a new task arising. The new task location is not known: solutions are calculated for a range of possible locations. Therefore, a smart way of sampling and tessellating the plane is introduced to distinguish the areas where the solution will not change if that task is added. This hybrid optimisation was created to offer near-optimal solutions, under the condition that its computational time would be less than an exact method would require to solve only one scenario. The IF method was tested for a variety of scenarios and benchmarked against the Gurobi software. The results showed that the IF offers a good approximation of how the solution will change with its computational time remaining approximately the same, regardless the size or the complexity of the scenarios solved.

[1]  Nicos Christofides,et al.  Vehicle routing with a sparse feasibility graph , 1997 .

[2]  Han-Lim Choi,et al.  Real-Time Multi-UAV Task Assignment in Dynamic and Uncertain Environments , 2009 .

[3]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[4]  Efstratios N. Pistikopoulos,et al.  An Algorithm for the Solution of Multiparametric Mixed Integer Linear Programming Problems , 2000, Ann. Oper. Res..

[5]  Amedeo R. Odoni,et al.  The Air Traffic Flow Management Problem: An Integer Optimization Approach , 2008, IPCO.

[6]  Donald R. Jones,et al.  A Taxonomy of Global Optimization Methods Based on Response Surfaces , 2001, J. Glob. Optim..

[7]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[8]  Gerhard Reinelt,et al.  Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[9]  Jonathan P. How,et al.  Coordination and control of multiple UAVs with timing constraints and loitering , 2003, Proceedings of the 2003 American Control Conference, 2003..

[10]  Arthur Richards,et al.  Ant Colony Optimization for routing and tasking problems for teams of UAVs , 2014, 2014 UKACC International Conference on Control (CONTROL).

[11]  El-Ghazali Talbi,et al.  Hybridizing exact methods and metaheuristics: A taxonomy , 2009, Eur. J. Oper. Res..

[12]  Daobo Wang,et al.  UAV path planning method based on ant colony optimization , 2010, 2010 Chinese Control and Decision Conference.

[13]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[14]  Haibin Duan,et al.  Improved Ant Colony Algorithm for Global Optimal Trajectory Planning of UAV under Complex Environment , 2007, Int. J. Comput. Sci. Appl..

[15]  F. Bullo,et al.  Decentralized algorithms for vehicle routing in a stochastic time-varying environment , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[16]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[17]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[18]  Andreas T. Ernst,et al.  A Lagrangian-ACO matheuristic for car sequencing , 2014, EURO J. Comput. Optim..

[19]  Jürgen Branke,et al.  Waiting Strategies for Dynamic Vehicle Routing , 2005, Transp. Sci..

[20]  Luís Santos,et al.  An improved heuristic for the capacitated arc routing problem , 2009, Comput. Oper. Res..

[21]  E. Pistikopoulos,et al.  A multiparametric programming approach for linear process engineering problems under uncertainty , 1997 .

[22]  Andreas T. Ernst,et al.  Hybrids of Integer Programming and ACO for Resource Constrained Job Scheduling , 2014, Hybrid Metaheuristics.

[23]  Ken Darby-Dowman,et al.  A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound , 2005, Eur. J. Oper. Res..

[24]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

[25]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[26]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[27]  K. Nieminen,et al.  Genetic algorithm for nding a good rst integer solution for MILP , 2003 .

[28]  Atsuo Suzuki,et al.  Locational optimization problems solved through Voronoi diagrams , 1997 .

[29]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[30]  Malcolm J. A. Strens,et al.  Combining Planning with Reinforcement Learning for Multi-robot Task Allocation , 2004, Adaptive Agents and Multi-Agent Systems.

[31]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[32]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[33]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..