A real-time network approach for including obstacles and flight dynamics in UAV route planning

The procedure presented within considers the problem of calculating flight time for unmanned aerial vehicles (UAVs) while incorporating a subset of important flight dynamics characteristics in an operational field that contains obstacles. These flight time calculations are parameter inputs in mission planning and dynamic reassignment problems. The addition of pseudonodes and the addition of penalties into the associated edge weights are the basis for how the network generation procedure includes flight dynamics. The procedure includes a method for handling pop-up targets or obstacles in a dynamic reassignment problem. To guarantee that the optimal path includes flight dynamics, a selective Dijkstra’s algorithm computes the shortest path. A complex mission plan consisting of thirty targets and three obstacles is the largest test scenario of nine developed scenarios. Our network generation procedure, along with the shortest path calculations of all 992 node pairs of interest, solves in approximately one second. This procedure allows for the fast computation needed to generate parameters for use in a dynamic domain such as mission planning and dynamic reassignment algorithms.

[1]  John T. Wen,et al.  A path space approach to nonholonomic motion planning in the presence of obstacles , 1997, IEEE Trans. Robotics Autom..

[2]  J. A. Goldman,et al.  Path planning problems and solutions , 1994, Proceedings of National Aerospace and Electronics Conference (NAECON'94).

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

[4]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[5]  Irene Casas,et al.  An Automated Network Generation Procedure for Routing of Unmanned Aerial Vehicles (UAVs) in a GIS Environment , 2007 .

[6]  J. Hespanha,et al.  Discrete approximations to continuous shortest-path: application to minimum-risk path planning for groups of UAVs , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[8]  Vladimir J. Lumelsky,et al.  Classification of the Dubins set , 2001, Robotics Auton. Syst..

[9]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[10]  Johannes O. Royset,et al.  Routing Military Aircraft with a Constrained Shortest-Path Algorithm , 2009 .

[11]  D.B. Kingston,et al.  Time-dependent cooperative assignment , 2005, Proceedings of the 2005, American Control Conference, 2005..

[12]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[13]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Richard C. Larson,et al.  Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel , 1983, Oper. Res..

[16]  Madjid Tavana,et al.  A multi-criteria vehicle-target allocation assessment model for network-centric Joint Air Operations , 2008 .

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

[18]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

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

[20]  David J. Grymin,et al.  Simplified Model Development and Trajectory Determination for a UAV using the Dubins Set , 2009 .

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

[22]  Rajan Batta,et al.  A Flight Time Approximation Model for Unmanned Aerial Vehicles: Estimating the Effects of Path Variations and Wind , 2014 .

[23]  Tal Shima,et al.  Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms , 2006, Comput. Oper. Res..

[24]  Meir Pachter,et al.  Optimization of air vehicles operations using mixed-integer linear programming , 2007, J. Oper. Res. Soc..

[25]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[26]  Jeffery L. Kennington,et al.  Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation , 2001, J. Heuristics.

[27]  Joseph S. B. Mitchell.  Shortest paths among obstacles in the plane , 1996, Int. J. Comput. Geom. Appl..

[28]  J. T. Moore,et al.  Devising a quick-running heuristic for an unmanned aerial vehicle (UAV) routing system , 2005, J. Oper. Res. Soc..

[29]  Corey Schumacher,et al.  UAV Scheduling via the Vehicle Routing Problem with Time Windows , 2007 .

[30]  James A. Storer,et al.  Shortest paths in the plane with polygonal obstacles , 1994, JACM.

[31]  Rakesh Nagi,et al.  Finding rectilinear least cost paths in the presence of convex polygonal congested regions , 2009, Comput. Oper. Res..

[32]  Tom Caldwell,et al.  On finding minimum routes in a network with turn penalties , 1961, CACM.

[33]  Mark H. Karwan,et al.  A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms , 2013 .

[34]  Rakesh Nagi,et al.  Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles , 2008, Comput. Oper. Res..

[35]  J. Wilde,et al.  Team Planning for Unmanned Vehicles in the Risk-Aware Mixed-Initiative Dynamic Replanning System , 2007, OCEANS 2007.

[36]  Rakesh Nagi,et al.  Commentary on facility location in the presence of congested regions with the rectilinear distance metric , 2004 .

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

[38]  M. Grassi,et al.  AIAA Guidance, Navigation, and Control Conference , 2008 .

[39]  Chase C. Murray,et al.  An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations , 2010 .

[40]  Danny Ziyi Chen,et al.  A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment , 1997, IEEE Trans. Robotics Autom..

[41]  Jean Berger,et al.  A hybrid genetic approach for airborne sensor vehicle routing in real-time reconnaissance missions , 2007 .

[42]  I. Michael Ross,et al.  A Pseudospectral Method for Real-Time Motion Planning and Obstacle Avoidance , 2007 .

[43]  U. S. Air Force.  The U.S. Air Force Remotely Piloted Aircraft and Unmanned Aerial Vehicle Strategic Vision , 2005 .

[44]  Lakhmi C. Jain,et al.  Path Planning and Obstacle Avoidance for Autonomous Mobile Robots: A Review , 2006, KES.

[45]  Rakesh Nagi,et al.  Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans , 2012, Comput. Oper. Res..

[46]  S. Uryasev,et al.  Aircraft routing under the risk of detection , 2006 .

[47]  Tom M. Cavalier,et al.  Facility location in the presence of congested regions with the rectilinear distance metric , 1997 .