Cooperative UAV routing with limited sensor range

Collection of Technical Papers - AIAA Guidance, Navigation, and Control Conference 2006

Volumn 2, Issue , 2006, Pages 1380-1390

  Enright, J J ^a,b,c   Frazzoli, E ^a,b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Mechanical Engineering Department   (United States)

^c AIAA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE VEHICLES; ALGORITHMS; COMPUTER SIMULATION; MOTION PLANNING; PROBLEM SOLVING; SENSORS; STOCHASTIC CONTROL SYSTEMS;

DYNAMIC VEHICLE ROUTING PROBLEMS; STOCHASTICALLY-GENERATED TARGETS; UNINHABITED AERIAL VEHICLES (UAV);

UNMANNED VEHICLES;

EID: 33845727120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.2514/6.2006-6208     Document Type: Conference Paper

References (24)

1. Beard, R. W., McLain, T. W., Goodrich, M. A., and Anderson, E. P., "Coordinated Target assignment and intercept for unmanned air vehicles," IEEE Trans. on Robotics and Automation, Vol. 18, No. 6, 2002, pp. 911-922.
2. Richards, A., Bellingham, J., Tillerson, M., and How, J., "Coordination and Control of Multiple UAVs," Proc. of the AIAA Conf. on Guidance, Navigation, and Control, Monterey, CA, 2002.
3. Schumacher, C., Chandler, P. R., Rasmussen, S. J., and Waker, D., "Task allocation for wide area search munitions with variable path length," American Control Conference, Denver, CO, 2003, pp. 3472-3477.
4. Earl, M. and D'Andrea, R., "Iterative MILP methods for vehicle control problems," IEEE Trans. on Robotics, Vol. 21, December 2005, pp. 1158-1167.
5. Li, W. and Cassandras, C., "A Cooperative Receding Horizon Controller for Multivehicle Uncertain Environments," IEEE Trans. on Automatic Control, Vol. 51, No. 2, 2006, pp. 242-257.
6. Murphey, R., "Target-based weapon target assignment problems," Nonlinear Assignment Problems: Algorithms and Applications, edited by P. Pardalos and L. Pitsoulls, Kluwer Academic Publisher, 1999, pp. 39-53.
7. Arslan, G. and Shamma, J., "Autonomous Vehicle-Target Assignment: a game theoretic formulation," Submitted to the IEEE Trans. on Automatic Control.
8. Tanemura, M. and Hasegawa, H., "Geometrical models of territory I: Models for synchronous and asynchronous settlement of territories," Journal of Theoretical Biology, Vol. 82, 1980, pp. 447-496.
9. Psaraftis, H., "Dynamic Vehicle Routing Problems," Vehicle Routing: Methods and Studies, edited by B. Golden and A. Assad, Studies in Management Science and Systems, Elsevier, 1988.
10. Bertsimas, D. J. and van Ryzin, G. J., "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, Vol. 39, 1991, pp. 601-615.
11. Frazzoli, E. and Bullo, F., "Decentralized Algorithms for Vehicle Routing in a Stochastic Time-Varying Environment," Proc. IEEE Conf. on Decision and Control, Paradise Island, Bahamas, December 2004.
12. Arsie, A. and Frazzoli, E., "Efficient Routing of Multiple Vehicles with No Communications," International Journal of Robust and Nonlinear Control, 2006, Submitted.
13. Liu, Y., Cruz, J., and Sparks, A. G., "Coordinated networked uninhabited aer vehicles for persistent area denial," IEEE Conf. on Decision and Control, Paradise Island, Bahamas, 2004, pp. 3351-3356.
14. Cortés, J., Martínez, S., Karatas, T., and Bullo, F., "Coverage control for mobile sensing networks," IEEE Transactions on Robotics and Automation, Vol. 20, No. 2, 2004, pp. 243-255.
15. Moore, B. and Passino, K., "Distributed Balancing of AAVs for Uniform Surveillance Coverage," IEEE Conference on Decision and Control, 2005.
16. Little, J., "A proof of the queueing formula l = λw," Operations Research, Vol. 9, 1961, pp. 383-387.
17. Applegate, D., Bixby, R., Chvátal, V., and Cook, W., "On the solution of traveling salesman problems," Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung, Berlin, Germany, 1998, pp. 645-656, Proceedings of the International Congress of Mathematicians, Extra Volume ICM III.
18. Christofides, N., "Bounds for the travelling-salesman problem," Operations Research, Vol. 20, 1972, pp. 1044-1056.
19. Arora, S., "Nearly Linear Time Approximation Scheme for Euclidean TSP and Other Geometric Problems," Proc. 38th IEEE Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 554-563.
20. Lin, S. and Kernighan, B. W., "An effective heuristic algorithm for the traveling-salesman problem," Operations Research, Vol. 21, 1973, pp. 498-516.
21. Beardwood, J., Halton, J., and Hammersley, J., "The Shortest Path Through Many Points," Proceedings of the Cambridge Philoshopy Society, Vol. 55, 1959, pp. 299-327.
22. Percus, G. and Martin, O. C., "Finite size and dimensional dependence of the Euclidean traveling salesman problem," Physical Review Letters, Vol. 76, No. 8, 1996, pp. 1188-1191.
23. Johnson, D. S., McGeoch, L. A., and Rothberg, E. E., "Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound," Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 341-350.
24. Steele, J. M., "Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space," Mathematics of Operations Research, Vol. 15, No. 4, 1990, pp. 749.