Coordinated Road Network Search for Multiple UAVs Using Dubins Path

This paper proposes a coordinated road network search algorithm for multiple heterogeneous unmanned aerial vehicles (UAVs). The road network search problem can be interpreted as the problem to seek minimum-weight postman tours with a graphic representation of the road network. Therefore, the conventional Chinese Postman Problem (CPP) is first presented. We, then, consider physical constraints of UAVs into the search problem, since they cannot be addressed in the typical CPP. This modified search problem is formulated as Multi-choice Multidimensional Knapsack Problem (MMKP), which is to find an optimal solution minimising flight time. The Dubins path planning produces the shortest and flyable paths in consideration of physical constraints, so that the Dubins path is used to calculate the cost function of the modified search problem. The performance of the proposed multiple UAVs road network search algorithm is verified via numerical simulation for a given map.

[1]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[2]  Jonathan P. How,et al.  Multi-Task Allocation and Path Planning for Cooperating UAVs , 2003 .

[3]  Raja Sengupta,et al.  A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints , 2007, IEEE Transactions on Automation Science and Engineering.

[4]  Dino Ahr,et al.  Contributions to Multiple Postmen Problems , 2004 .

[5]  André Langevin,et al.  A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal , 2005, Comput. Oper. Res..

[6]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

[7]  Emilio Frazzoli,et al.  Traveling Salesperson Problems for the Dubins Vehicle , 2008, IEEE Transactions on Automatic Control.

[8]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[9]  Marios M. Polycarpou,et al.  Balancing search and target response in cooperative unmanned aerial vehicle (UAV) teams , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  Antonios Tsourdos,et al.  Differential Geometric Path Planning of Multiple UAVs , 2007 .

[11]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[12]  Nathalie Perrier,et al.  A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal , 2006, Comput. Oper. Res..

[13]  M. Pachter,et al.  Complexity in UAV cooperative control , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[14]  Mhand Hifi,et al.  A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem , 2006, Comput. Optim. Appl..

[15]  Joel W. Burdick,et al.  A Coverage Algorithm for Multi-robot Boundary Inspection , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[16]  Swaroop Darbha,et al.  A Resource Allocation Algorithm for Multi-Vehicle Systems with Non holnomic Constraints , 2005 .

[17]  Shao‐Chi Chang,et al.  The effect of alliance experience and intellectual capital on the value creation of international strategic alliances , 2008 .

[18]  T. Glenn Bailey,et al.  Reactive Tabu Search in unmanned aerial reconnaissance simulations , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[19]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[20]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .