On the Value of Information in Dynamic Multiple-Vehicle Routing Problems

Cooperative Control of Distributed Multi-Agent Systems

Volumn , Issue , 2007, Pages 139-176

  Arsie, Alessandro ^a   Enright, John J ^b   Frazzoli, Emilio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Constant factor approximation algorithm; Distributed multiagent system cooperative control; Dynamic vehicle routing; Motion coordination strategies; Multiple vehicle Tiling Policy; Non communication strategy; Spatio temporal Poisson point process; Voronoi tessellations; Weapon Target Assignment (WTA) problem

Indexed keywords

EID: 79953152362     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470724200.ch7     Document Type: Chapter

References (37)

1. Agarwal PK and Sharir M 1998 Efficient algorithms for geometric optimization. ACM Computing Surveys 30(4), 412-458.
2. Applegate D, Bixby R, Chvàtal V and Cook W 1998 On the solution of traveling salesman problems. Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung, pp. 645-656, Berlin, Germany. Proceedings of the International Congress of Mathematicians, Extra Volume ICM III.
3. Arora S 1997 Nearly linear time approximation scheme for Euclidean TSP and other geometric problems. In Proc. 38th IEEE Annual Symposium on Foundations of Computer Science, pp. 554-563, Miami Beach, FL.
4. Arsie A and Frazzoli E 2006 Efficient routing with no communications. International Journal of Robust and Nonlinear Control. Submitted, downloadable at http://www.arxiv.org/math.OC/45940504.
5. Arslan G and Shamma J 2006 Autonomous vehicle-target assignment: a game theoretic formulation. Submitted to the IEEE Trans. on Automatic Control.
6. Beard RW, McLain TW, Goodrich MA and Anderson EP 2002 Coordinated target assignment and intercept for unmanned air vehicles. IEEE Trans. on Robotics and Automation 18(6), 911-922.
7. Beardwood J, Halton J and Hammersley J 1959 The shortest path through many points. In Proceedings of the Cambridge Philosophy Society 55, 299-327.
8. Bertsimas DJ and van Ryzin GJ 1991 A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research 39, 601-615.
9. Bertsimas DJ and van Ryzin GJ 1993a Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research 41(1), 60-76.
10. Bertsimas DJ and van Ryzin GJ 1993b Stochastic and dynamic vehicle routing with general interarrival and service time distributions. Advances in Applied Probability 25, 947-978.
11. Carmi P, Har-Peled S and Katz M 2005 On the Fermat-Weber center of a convex object. Computational Geometry 32(3), 188-195.
12. Chandrasekaran R and Tamir A 1990 Algebraic optimization: the Fermat-Weber location problem. Mathematical Programming 46, 219-224.
13. Christofides N 1972 Bounds for the travelling-salesman problem. Operations Research 20, 1044-1056.
14. Cortès J, Martìnez S, Karatas T and Bullo F 2004 Coverage control for mobile sensing networks. IEEE Transactions on Robotics and Automation 20(2), 243-255.
15. Drezner Z (ed.) 1995 Facility Location: A Survey of Applications and Methods. Springer Series in Operations Research. Springer Verlag, New York.
16. Earl M and D'Andrea R 2005 Iterative MILP methods for vehicle control problems. IEEE Trans. on Robotics 21, 1158-1167.
17. Enright JJ and Frazzoli E 2006 Cooperative UAV routing with limited sensor range. AIAA Conf. on Guidance, Navigation, and Control, Keystone, CO, AIAA Paper 2006-2008.
18. Fekete SP, Mitchell JSB and Weinbrecht K 2000 On the continuous Weber and k-median problems. In Proceedings of the Sixteenth Annual Symposium on Computational Geometry (Hong Kong, 2000), pp. 70-79. ACM, New York.
19. Frazzoli E and Bullo F 2004 Decentralized algorithms for vehicle routing in a stochastic timevarying environment. In Proc. 43rd IEEE Conf. on Decision and Control, Paradise Island, Bahamas, pp. 3357-3363.
20. Johnson DS, McGeoch LA and Rothberg EE 1996 Asymptotic experimental analysis for the held-karp traveling salesman bound. In Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 341-350.
21. Li W and Cassandras C 2006 A cooperative receding horizon controller for multivehicle uncertain environments. IEEE Trans. on Automatic Control 51(2), 242-257.
22. Lin S and Kernighan BW 1973 An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 498-516.
23. Little J 1961 A proof of the queueing formula l = ?w. Operations Research 9, 383-387.
24. Liu Y, Cruz J and Sparks AG 2004 Coordinated networked uninhabited AER vehicles for persistent area denial. IEEE Conf. on Decision and Control, pp. 3351-3356, Paradise Island, Bahamas.
25. Lloyd SP 1982 Least squares quantization in PCM. IEEE Trans. on Information Theory 28(2), 129-137.
26. MacQueen J 1967 Some methods for the classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Math. Stat. and Prob. (ed. LeCam LM and Neyman J), pp. 281-297. University of California Press, Berkeley, CA.
27. Moore B and Passino K 2005 Distributed balancing of AAVs for uniform surveillance coverage. 44th IEEE Conference on Decision and Control, pp. 7060-7065.
28. Murphey R 1999 Target-based weapon target assignment problems. In Nonlinear Assignment Problems:Algorithms and Applications (ed. Pardalos P and Pitsoulis L). pp. 39-53, Kluwer Academic Publisher.
29. Okabe A, Boots B, Sugihara K and Chiu S 2000 Spatial Tessellations: Concepts and Applications of Voronoi Diagrams Wiley Series in Probability and Statistics second edn. John Wiley & Sons, Chichester, UK.
30. Percus G and Martin OC 1996 Finite size and dimensional dependence of the Euclidean traveling salesman problem. Physical Review Letters 76(8), 1188-1191.
31. Psaraftis H 1988 Dynamic vehicle routing problems. In Vehicle Routing: Methods and Studies (ed. Golden B and Assad A) Studies in Management Science and Systems, Elsevier.
32. Richards A, Bellingham J, Tillerson M and How J 2002 Coordination and control of multiple UAVs. In Proc. of the AIAA Conf. on Guidance, Navigation, and Control, Monterey, CA, AIAA Paper 2002-4588.
33. Sabin M and Gray R 1986 Global convergence and empirical consistency of the generalized Lloyd algorithm. IEEE Trans. on Information Theory, 32(2), 148-155.
34. Schumacher C, Chandler PR, Rasmussen SJ and Walker D 2003 Task allocation for wide area search munitions with variable path length. In Proc. of the American Control Conference, pp. 3472-3477, Denver, CO.
35. Steele JM 1990 Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space. Mathematics of Operations Research 15(4), 749.
36. Tanemura M and Hasegawa H 1980 Geometrical models of territory I: Models for synchronous and asynchronous settlement of territories. Journal of Theoretical Biology 82, 477-496.
37. Wesolowsky G 1993 The Weber problem: History and perspectives. Location Science 1, 5-23.