Path Planning for a UAV Performing Reconnaissance of Static Ground Targets in Terrain

In this article we consider a path planning problem for a single fixed-wing aircraft performing an ISR (Intelligence Surveillance Reconnaissance) mission using EO (ElectroOptical) camera(s). We give a mathematical formulation of the general aircraft visual reconnaissance problem for static ground targets in terrain and show that, under simplifying assumptions, it can be reduced to a variant of the Traveling Salesman Probem which we call the PVDTSP (Polygon-Visiting Dubins Traveling Salesman Problem). We design a genetic algorithm to solve the PVDTSP and validate it in a Monte Carlo numerical study. For fixed computation time, the genetic algorithm produces reconnaissance tours on average nearly half the length (and thus can be flown in half the time) of those delivered by a random search. The modular design of the genetic algorithm allows it to easily be extended to handle realistic assumptions such as wind and airspace constraints.

[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]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[3]  F. Tung,et al.  Navigation and control. , 1968 .

[4]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[5]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[6]  Jean-Daniel Boissonnat,et al.  Shortest path synthesis for Dubins non-holonomic robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1994, J. Intell. Robotic Syst..

[8]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  Hongyan Wang,et al.  The complexity of the two dimensional curvature-constrained shortest-path problem , 1998 .

[10]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[11]  Xiaolin Hu,et al.  Dynamic traveling salesman problem based on evolutionary computation , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[12]  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).

[13]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.

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

[15]  Wayne Pullan,et al.  Adapting the genetic algorithm to the travelling salesman problem , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[16]  C. N Bouza,et al.  Spall, J.C. Introduction to stochastic search and optimization. Estimation, simulation and control. Wiley Interscience Series in Discrete Mathematics and Optimization, 2003 , 2004 .

[17]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[18]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[19]  J. Karl Hedrick,et al.  Optimal path planning in a constant wind with a bounded turning rate , 2005 .

[20]  Eric Feron,et al.  An Approximation Algorithm for the Curvature-Constrained Traveling Salesman Problem ∗ , 2005 .

[21]  P. Chandler,et al.  Cooperative Operations in Urban Terrain (COUNTER) , 2006, SPIE Defense + Commercial Sensing.

[22]  F. Borrelli,et al.  MILP and NLP Techniques for centralized trajectory planning of multiple unmanned air vehicles , 2006, 2006 American Control Conference.

[23]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[24]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[25]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[26]  Alison Eele,et al.  Path Planning with Avoidance Using Nonlinear Branch-and-Bound , 2007 .

[27]  Emilio Frazzoli,et al.  The curvature-constrained traveling salesman problem for high point densities , 2007, 2007 46th IEEE Conference on Decision and Control.

[28]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

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

[30]  Tal Shima,et al.  Co-Evolution Genetic Algorithm for UAV Distributed Tracking in Urban Environments , 2008 .

[31]  Tal Shima,et al.  Cooperative UAV Tracking Under Urban Occlusions and Airspace Limitations , 2008 .

[32]  David Gross,et al.  An Overview of the Cooperative Operations in UrbaN TERrain (COUNTER) Program , 2008 .

[33]  A. Richards,et al.  Comparison of Branching Strategies for Path-Planning with Avoidance using Nonlinear Branch-and-Bound , 2008 .