Path Planning for a Collection of Vehicles With Yaw Rate Constraints

Multi-vehicle systems are naturally encountered in civil and military applications. Cooperation amongst individual “miniaturized” vehicles allows for flexibility to accomplish missions that a single large vehicle may not readily be able to accomplish. While accomplishing a mission, motion planning algorithms are required to efficiently utilize a common resource (such as the total fuel in the collection of vehicles) or to minimize a collective cost function (such as the maximum time taken by the vehicles to reach their intended destination). The objective of this chapter is to present a constant factor approximation algorithm for planning the path of each vehicle in a collection of vehicles, where the motion of each vehicle must satisfy yaw rate constraints.

[1]  Wright-Patterson Afb,et al.  Hierarchical Control for Autonomous Teams , 2001 .

[2]  Markus Bläser,et al.  A new approximation algorithm for the asymmetric TSP with triangle inequality , 2003, TALG.

[3]  M. Pachter,et al.  Research issues in autonomous control of tactical UAVs , 1998, Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207).

[4]  Ümit Özgüner,et al.  Motion planning for multitarget surveillance with mobile sensor agents , 2005, IEEE Transactions on Robotics.

[5]  Steven R. Rasmussen,et al.  Task Allocation for Wide Area Search Munitions via Iterative Network Flow , 2002 .

[6]  Timothy W. McLain,et al.  Cooperative path planning for timing-critical missions , 2003, Proceedings of the 2003 American Control Conference, 2003..

[7]  Timothy W. McLain,et al.  Coordinated target assignment and intercept for unmanned air vehicles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

[9]  Max Donath,et al.  American Control Conference , 1993 .

[10]  Wright-Patterson Afb,et al.  UAV Cooperative Path Planning , 2000 .

[11]  F. Bullo,et al.  On the point-to-point and traveling salesperson problems for Dubins' vehicle , 2005, Proceedings of the 2005, American Control Conference, 2005..

[12]  Wright-Patterson Afb,et al.  TASK ALLOCATION FOR WIDE AREA SEARCH MUNITIONS VIA NETWORK FLOW OPTIMIZATION , 2001 .

[13]  Marios M. Polycarpou,et al.  Multi-Target Assignment and Path Planning for Groups of UAVs , 2004 .

[14]  Vikram Kapila,et al.  Optimal path planning for unmanned air vehicles with kinematic and tactical constraints , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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

[16]  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..

[17]  Phillip R. Chandler,et al.  UAV cooperative control , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[18]  Phillip R. Chandler,et al.  Dynamic network flow optimization models for air vehicle resource allocation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[19]  Jonathan P. How,et al.  COORDINATION AND CONTROL OF MULTIPLE UAVs , 2002 .

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