A resource allocation algorithm for multivehicle systems with nonholonomic constraints

IEEE Transactions on Automation Science and Engineering

Volumn 4, Issue 1, 2007, Pages 98-104

  Rathinam, Sivakumar ^a   Sengupta, Raja ^a   Darbha, Swaroop ^b  

^a Berkeley   (United States)

^b Texas AandM University   (United States)

Author keywords

Cooperative control; Dubins; Motion planning; Nonholonomic; Traveling salesman; Unmanned aerial vehicles (UAVs)

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MOTION PLANNING; PROBLEM SOLVING; RESOURCE ALLOCATION; TRAVELING SALESMAN PROBLEM;

COOPERATIVE CONTROL; FEASIBLE PATH; NONHOLONOMIC CONSTRAINTS;

UNMANNED VEHICLES;

EID: 33846321543     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2006.872110     Document Type: Article

References (31)

1. L. E. Dubins, "On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents," in Proc. Amer. J. Math., Jul. 1957, vol. 79, no. 3, pp. 487-516.
2. P. Chandler and M. Pachter, "Research issues in autonomous control of tactical UAVs," in Proc. Amer. Control Conf., 1998, pp. 394-398.
3. P. Chandler, S. Rasmussen, and M. Pachter, "UAV cooperative path planning," in Proc. GNC, 2000, pp. 1255-1265.
4. P. Chandler and M. Pachter, "Hierarchical control of autonomous control of tactical UAVs," in Proc. GNC, 2001, pp. 632-642.
5. P. Chandler, S. Rasmussen, and M. Pachter, "UAV cooperative control," presented at the Amer. Control Conf., 2001.
6. C. Schumacher, P. R. Chandler, and S. R. Rasmussen, "Task allocation for wide area search munitions via network flow optimization," in AIAA Guidance, Navigation, Control Conf. Exhibit., Montreal, QC, Canada, Aug. 6-9, 2001.
7. P. Chandler, M. Pachter, D. Swaroop, J. M. Fowler, J. K. Hewlett, S. Rasmussen, C. Schumacher, and K. Nygard, "Complexity in UAV cooperative control," presented at the Amer. Control Conf., Anchorage, AK, May 8-10, 2002.
8. T. Maddula, A. A. Minai, and M. M. Polycarpou, Multi-Target Assignment and Path Planning for Groups of UAVs, S. Butenko, R. Murphey, and P. Pardalos, Eds. Norwell, MA: Kluwer, Dec. 4-6, 2002.
9. R. Beard, T. Mclain, M. Goodrich, and E. Anderson, "Coordinated target assignment and intercept for unmanned air vehicles," IEEE Trans. Robot. Autom., vol. 18, no. 6, pp. 911-922, Dec. 2002.
10. J. Bellingham, M. Tillerson, A. Richards, and J. P. How, "Multi-task allocation and trajectory design for cooperating UAVs," presented at the Cooperative Control: Models, Applications and Algorithms at the Conference on Coordination, Control and Optimization, Nov. 2001.
11. A. Richards, J. Bellingham, M. Tillerson, and J. P. How, "Co-ordination and control of multiple UAVs," presented at the AIAA Guidance, Navigation, Control Conf., Aug. 2002.
12. M. Alighanbari, Y. Kuwata, and J. P. How, "Coordination and control of multiple UAVs with timing constraints and loitering," presented at the IEEE American Control Conf., Jun. 2003.
13. T. Mclain and R. Beard, "Cooperative path planning for timing critical missions," presented at the Amer. Control Conf., Denver, CO, Jun. 4-6, 2003.
14. G. Yang and V. Kapila, "Optimal path planning for unmanned air vehicles with kinematic and tactical constraints," in Proc. 41st IEEE Conf. Decision and Control, Dec. 2002, vol. 2, pp. 1301-1306.
15. S. Darbha, "Teaming strategies for a resource allocation and coordination problem in the cooperative control of UAVs," AFOSR Summer Fac. Res. Rep., Dayton, OH, 2001.
16. M. Blaser, "A new approximation algorithm for the asymmetric TSP with triangle inequality," in Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 638-645.
17. H. Kaplan, M. Lewenstein, N. Shafrir, and M. Sviridenko, "Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs," in Proc. 44th Annu. IEEE Symp. Foundations of Computer Science, 2003, pp. 56-65.
18. R. Kumar and H. Li, "On asymmetric TSP: transformation to symmetric TSP and performance symmetric TSP and performance bound," [Online]. Available: citeseer.ist.psu.edu/287458.html.
19. Z. Tang and U. Ozguner, "Motion planning for multi-target surveillance with mobile sensor agents," IEEE Trans. Robot. Autom., vol. 21, no. 5, pp. 898-908, Oct. 2005.
20. K. Savla, E. Frazzoli, and F. Bullo, "On the point-to-point and traveling salesperson problems for Dubin's vehicle," presented at the Amer. Control Conf., Portland, OR, Jun. 2005.
21. S. Rathinam, R. Sengupta, and S. Darbha, "Path planning for a collection of vehicles with yaw rate constraints," presented at the 5th Int. Conf. Cooperative Control and Optimization, Gainesville, FL, Jan. 20-22, 2005.
22. M. R. Garey and D. S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
23. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Upper Saddle River, NJ: Prentice-Hall, 1982.
24. S. Arora, "Polynomial-time approximation schemes for Euclidean TSP and other geometric problems," in Proc. 37th Annu. Symp. Foundations of Computer Science, 1996, pp. 2-11.
25. J. L. Bentley, "A parallel algorithm for constructing minimum spanning trees," J. Algorithms, vol. 1, no. 1, pp. 51-59, 1980.
26. D. Nash and S. N. Maheshwari, "Parallel algorithms for the connected components and minimal spanning trees," Inf. Process. Lett., vol. 14, no. 1, pp. 7-11, 1982.
27. D. B. Johnson and P. Metaxas, "A parallel algorithm for computing minimum spanning trees," in Proc. 4th Annu. Symp. Parallel Algorithms Architectures, San Diego, CA, 1992, pp. 363-372.
28. F. Dehne and S. Gotz, "Practical parallel algorithms for minimum spanning trees," in Proc. Workshop on Advances in Parallel and Distributed Systems, West Lafayette, IN, Oct. 1998, pp. 366-371.
29. S. Chung and A. Condon, "Parallel implementation of Bor uvka' s minimum spanning tree algorithm," in Proc. 10th Int. Parallel Processing Symp., Apr. 1996, pp. 302-315.
30. D. A. Bader and G. Cong, "A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors," presented at the IPDPS, 2004.
31. R. C. Chang and R. C. T. Lee, "An O(NlogN) minimal spanning tree algorithm for N points in the plane," BIT, vol. 26, pp. 7-16, 1986.