Decentralized algorithms for vehicle routing in a stochastic time-varying environment

Proceedings of the IEEE Conference on Decision and Control

Volumn 4, Issue , 2004, Pages 3357-3363

  Frazzoli, Emilio ^a   Bullo, Francesco ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; RANDOM PROCESSES; TIME VARYING CONTROL SYSTEMS; TRAVELING SALESMAN PROBLEM;

AD-HOC NETWORKS; DECENTRALIZED ALGORITHMS; UNMANNED AERIAL VEHICLES (UAV); VEHICLE ROUTING;

UNMANNED VEHICLES;

EID: 14244266684     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1429220     Document Type: Conference Paper

References (26)

1. D. L. Estrin et al. Embedded, Everywhere: A Research Agenda for Networked Systems and Embedded Computers. National Academy Press, 2001.
2. S. Tilak, N. B. Abu-Ghazaleh, and W. Heinzelman. A taxonomy of wireless micro-sensor network models. SIGMOBILE Mobile Computing and Communication Review, 6(2):28-36, April 2002.
3. C. Schumacher, P. R. Chandler, S. J. Rasmussen, and D. Walker. Task allocation for wide area search munitions with variable path length. In Proc. American Control Conf., pages 3472-3477, Denver, CO, June 2003.
4. R. W. Beard, T. W. McLain, M. A. Goodrich, and E. P. Anderson. Coordinated target assignment and intercept for unmanned air vehicles. IEEE Trans. Robotics and Automation, 18(6):911-922, 2002.
5. A. Richards, J. Bellingham, M. Tillerson, and J. How. Coordination and control of multiple UAVs. In Proc. AIAA Conf. on Guidance, Navigation, and Control, Monterey, CA, August 2002.
6. A. E. Gil, K. M. Passino, and A. Sparks. Cooperative scheduling of tasks for networked uninhabted autonomous vehicles. In Proc. IEEE Conf. on Decision and Control, pages 522-527, Maui, Hawaii, December 2003.
7. W. Li and C. G. Cassandras. Stability properties of a cooperative receding horizon controller. In Proc. IEEE Conf. on Decision and Control, pages 492-497, Maui, Hawaii, December 2003.
8. D. J. Bertsimas and G. J. van Ryzin. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research, 39:601-615, 1991.
9. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research, 41(l):60-76, 1993.
10. R. C. Larson and A. R. Odoni. Urban Operations Research. Prentice-Hall, Englewood Cliffs, NJ, 1981.
11. P. K. Agarwal and M. Shark. Efficient algorithms for geometric optimization. ACM Computing Surveys, 30(4):412-458, 1998.
12. Z. Drezner, editor. Facility Location: A Survey of Applications and Methods. Springer Series in Operations Research. Springer Verlag, New York, 1995.
13. N. Megiddo and K. J. Supowit. On the complexity of some common geometric location problems. SIAM Journal on Computing, 13(1):182-196, 1984.
14. J. Cortés, S. Martínez, T. Karatas, and F. Bullo. Coverage control for mobile sensing networks. IEEE Transactions On Robotics and Automation, 20(2):243-255, 2004.
15. J. Beardwood, J. Halton, and J. Hammersley. The shortest path through many points. Proceedings of the Cambridge Philoshopy Society, 55:299-327, 1959.
16. G. Percus and O. C. Martin. Finite size and dimensional dependence of the Euclidean traveling salesman problem. Physical Review Letters, 76(8): 1188-1191, 1996.
17. D. S. Johnson, L. A. McGeoch, and E. E. Rothberg. Asymptotic experimental analysis for the held-karp traveling salesman bound. In Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 341-350, 1996.
18. N. J. Cerf, J. Beutet de Monvel, O. Bohigas, O. C. Martin, and A. G. Percus. The random link approximation for the Euclidean traveling salesman problem. Journal de Physique I, 7(1):117-136, 1997.
19. J. M. Steele. Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space. Mathematics of Operations Research, 15(4):749, 1990.
20. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. On the solution of traveling salesman problems. In Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung, pages 645-656, Berlin, Germany, August 1998. Proceedings of the International Congress of Mathematicians, Extra Volume ICM III.
21. N. Christofides. Bounds for the travelling-salesman problem. Operations Research, 20:1044-1056, 1972.
22. S. Arora. Nearly linear time approximation scheme for Euclidean TSP and other geometric problems. In Proc. 38th IEEE Annual Symposium on Foundations of Computer Science, pages 554-563, Miami Beach, FL, October 1997.
23. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21:498-516, 1973.
24. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing with general interarrival and service time distributions. Advances in Applied Probability, 25:947-978, 1993.
25. X. Lu, A. Regan, and S. Irani. An asymptotically optimal algorithm for dynamic traveling repair problem. In Proc. of the 81st Meeting of the Transportation Research Board, January 2002.
26. W. Feller. An Introduction to Probability Theory and Its Applications. Wiley, New York, NY, 1968.