Dynamic vehicle routing for robotic systems

Proceedings of the IEEE

Volumn 99, Issue 9, 2011, Pages 1482-1504

  Bullo, Francesco ^a   Frazzoli, Emilio ^b   Pavone, Marco ^c   Savla, Ketan ^d   Smith, Stephen L ^e  

^a University of California   (United States)

^b Massachusetts Institute of Technology Cambridge   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Adaptive algorithm; cooperative systems; intelligent robots; mobile agents; multirobot systems; partitioning algorithms; queueing analysis; unmanned aerial vehicles

Indexed keywords

ADAPTIVE ALGORITHMS; COMBINATORIAL OPTIMIZATION; INTELLIGENT ROBOTS; MOBILE AGENTS; QUALITY OF SERVICE; QUEUEING THEORY; ROBOTICS; STOCHASTIC SYSTEMS; UNMANNED AERIAL VEHICLES (UAV); VEHICLE ROUTING;

ACHIEVABLE PERFORMANCE; CO-OPERATIVE SYSTEMS; DYNAMIC VEHICLE ROUTING; MULTI-ROBOT SYSTEMS; PARTITIONING ALGORITHMS; PERFORMANCE CRITERION; QUEUEING ANALYSIS; SCIENCE AND TECHNOLOGY;

VEHICLES;

EID: 80052026757     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2011.2158181     Document Type: Conference Paper

References (62)

1. B. J. Moore and K. M. Passino, "Distributed task assignment for mobile agents," IEEE Trans. Autom. Control, vol. 52, no. 4, pp. 749-753, Apr. 2007. (Pubitemid 46621603)
2. S. L. Smith and F. Bullo, "Monotonic target assignment for robotic networks," IEEE Trans. Autom. Control, vol. 54, no. 9, pp. 2042-2057, Sep. 2009.
3. M. Alighanbari and J. P. How, "A robust approach to the UAV task assignment problem," Int. J. Robust Nonlinear Control, vol. 18, no. 2, pp. 118-134, 2008.
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. Robot. Autom., vol. 18, no. 6, pp. 911-922, Dec. 2002.
5. G. Arslan, J. R. Marden, and J. S. Shamma, "Autonomous vehicle-target assignment: A game theoretic formulation," ASME J. Dyn. Syst. Meas. Control, vol. 129, no. 5, pp. 584-596, 2007. (Pubitemid 47549395)
6. P. Toth and D. Vigo, Eds., The Vehicle Routing Problem. Philadelphia, PA: SIAM, 2001.
7. D. J. Bertsimas and G. J. van Ryzin, "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Oper. Res., vol. 39, no. 4, pp. 601-615, 1991.
8. D. J. Bertsimas and G. J. van Ryzin, "Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles," Oper. Res., vol. 41, no. 1, pp. 60-76, 1993.
9. D. J. Bertsimas and G. J. van Ryzin, "Stochastic and dynamic vehicle routing with general interarrival and service time distributions," Adv. Appl. Probab., vol. 25, pp. 947-978, 1993.
10. H. N. Psaraftis, "Dynamic vehicle routing problems," in Vehicle Routing: Methods and Studies, B. Golden and A. Assad, Eds. Amsterdam, The Netherlands: Elsevier (North-Holland), 1988, pp. 223-248.
11. M. Pavone, N. Bisnik, E. Frazzoli, and V. Isler, "A stochastic and dynamic vehicle routing problem with time windows and customer impatience," ACM/Springer J. Mobile Netw. Appl., vol. 14, no. 3, pp. 350-364, 2009.
12. M. Pavone and E. Frazzoli, "Dynamic vehicle routing with stochastic time constraints," in Proc. IEEE Int. Conf. Robot. Autom., Anchorage, AK, May 2010, pp. 1460-1467.
13. S. L. Smith, M. Pavone, F. Bullo, and E. Frazzoli, "Dynamic vehicle routing with priority classes of stochastic demands," SIAM J. Control Optim., vol. 48, no. 5, pp. 3224-3245, 2010.
14. S. D. Bopardikar, S. L. Smith, F. Bullo, and J. P. Hespanha, "Dynamic vehicle routing for translating demands: Stability analysis and receding-horizon policies," IEEE Trans. Autom. Control, vol. 55, no. 11, pp. 2554-2569, Nov. 2010.
15. M. Pavone, E. Frazzoli, and F. Bullo, "Adaptive and distributed algorithms for vehicle routing in a stochastic and dynamic environment," IEEE Trans. Autom. Control, vol. 56, no. 6, pp. 1259-1274, Jun. 2011.
16. A. Arsie, K. Savla, and E. Frazzoli, "Efficient routing algorithms for multiple vehicles with no explicit communications," IEEE Trans. Autom. Control, vol. 54, no. 10, pp. 2302-2317, Oct. 2009.
17. K. Savla, E. Frazzoli, and F. Bullo, "Traveling Salesperson Problems for the Dubins vehicle," IEEE Trans. Autom. Control, vol. 53, no. 6, pp. 1378-1391, Jun. 2008.
18. J. J. Enright, K. Savla, E. Frazzoli, and F. Bullo, "Stochastic and dynamic routing problems for multiple UAVs," AIAA J. Guid. Control Dyn., vol. 34, no. 4, pp. 1152-1166, 2009.
19. J. J. Enright and E. Frazzoli, "Cooperative UAV routing with limited sensor range," in Proc. AIAA Conf. Guid. Navig. Control, Keystone, CO, Aug. 2006, AIAA-2006-6208.
20. S. L. Smith and F. Bullo, "The dynamic team forming problem: Throughput and delay for unbiased policies," Syst. Control Lett., vol. 58, no. 10-11, pp. 709-715, 2009.
21. K. Savla, T. Temple, and E. Frazzoli, "Human-in-the-loop vehicle routing policies for dynamic environments," in Proc. IEEE Conf. Decision Control, Cancún, México, Dec. 2008, pp. 1145-1150.
22. M. Pavone, "Dynamic vehicle routing for robotic networks," Ph.D. dissertation, Dept. Aeronautics Astronautics, Massachusetts Inst. Technol., Cambridge, MA, Jun. 2010.
23. D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules," Commun. ACM, vol. 28, no. 2, pp. 202-208, 1985.
24. S. O. Krumke, W. E. de Paepe, D. Poensgen, and L. Stougie, "News from the online traveling repairman," Theor. Comput. Sci., vol. 295, no. 1-3, pp. 279-294, 2003.
25. S. Irani, X. Lu, and A. Regan, "On-line algorithms for the dynamic traveling repair problem," J. Scheduling, vol. 7, no. 3, pp. 243-258, 2004.
26. P. Jaillet and M. R. Wagner, "Online routing problems: Value of advanced information and improved competitive ratios," Transp. Sci., vol. 40, no. 2, pp. 200-210, 2006.
27. B. Golden, S. Raghavan, and E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges. New York: Springer-Verlag, 2008.
28. P. Van Hentenryck, R. Bent, and E. Upfal, "Online stochastic optimization under time constraints," Ann. Oper. Res., vol. 177, no. 1, pp. 151-183, 2009.
29. P. K. Agarwal and M. Sharir, "Efficient algorithms for geometric optimization," ACM Comput. Surv., vol. 30, no. 4, pp. 412-458, 1998.
30. Z. Drezner, Ed., Facility Location: A Survey of Applications and Methods. New York: Springer-Verlag, 1995.
31. H. Xu, "Optimal policies for stochastic and dynamic vehicle routing problems," Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, MA, 1995.
32. S. Bespamyatnikh, D. Kirkpatrick, and J. Snoeyink, "Generalizing ham sandwich cuts to equitable subdivisions," Discrete Comput. Geometry, vol. 24, no. 4, pp. 605-622, 2000.
33. M. Pavone, A. Arsie, E. Frazzoli, and F. Bullo, "Distributed algorithms for environment partitioning in mobile robotic networks," IEEE Trans. Autom. Control, vol. 56, no. 9, pp. 1259-1274, 2011, DOI: 10.1109/TAC. 2011.2112410.
34. J. D. Papastavrou, "A stochastic and dynamic routing policy using branching processes with state dependent immigration," Eur. J. Oper. Res., vol. 95, pp. 167-177, 1996. (Pubitemid 126391979)
35. L. E. Dubins, "On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents," Amer. J. Math., vol. 79, pp. 497-516, 1957.
36. S. M. LaValle, Planning Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 2006. [Online]. Available: http://planning.cs. uiuc.edu.
37. U. Boscain and B. Piccoli, Optimal Syntheses for Control Systems on 2-D Manifolds. New York: Springer-Verlag, 2004.
38. L. Pallottino and A. Bicchi, "On optimal cooperative conflict resolution for air traffic management systems," IEEE Trans. Intell. Transp. Syst., vol. 1, no. 4, pp. 221-231, Dec. 2000.
39. C. Tomlin, I. Mitchell, and R. Ghosh, "Safety verification of conflict resolution manoeuvres," IEEE Trans. Intell. Transp. Syst., vol. 2, no. 2, pp. 110-120, Jun. 2001. (Pubitemid 33675781)
40. P. Chandler, S. Rasmussen, and M. Pachter, "UAV cooperative path planning," in Proc. AIAA Conf. Guid. Navig. Control, Denver, CO, Aug. 2000, AIAA-2000-4370.
41. C. Schumacher, P. R. Chandler, S. J. Rasmussen, and D. Walker, "Task allocation for wide area search munitions with variable path length," in Proc. Amer. Control Conf., Denver, CO, 2003, pp. 3472-3477.
42. E. Zemel, "Probabilistic analysis of geometric location problems," Ann. Oper. Res., vol. 1, no. 3, pp. 215-238, 1984.
43. K. Savla, F. Bullo, and E. Frazzoli, "Traveling Salesperson Problems for a double integrator," IEEE Trans. Autom. Control, vol. 54, no. 4, pp. 788-793, Apr. 2009.
44. K. Savla and E. Frazzoli, "On endogenous reconfiguration for mobile robotic networks," in Proc. Workshop Algorithmic Found. Robot., Guanajuato, Mexico, Dec. 2008, pp. 53-67.
45. E. K. P. Chong, C. M. Kreucher, and A. O. Hero, III, "Monte-Carlo- based partially observable Markov decision process approximations for adaptive sensing," in Proc. Int. Workshop Discrete Event Syst., Göteborg, Sweden, May 2008, pp. 173-180.
46. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 4th ed. New York: Springer, 2007.
47. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
48. V. Sharma, M. Savchenko, E. Frazzoli, and P. Voulgaris, "Transfer time complexity of conflict-free vehicle routing with no communications," Int. J. Robot. Res., vol. 26, no. 3, pp. 255-272, 2007.
49. S. L. Smith, S. D. Bopardikar, and F. Bullo, "A dynamic boundary guarding problem with translating demands," in Proc. IEEE Conf. Decision Control/Chin. Control Conf/, Shanghai, China, Dec. 2009, pp. 8543-8548.
50. H. A. Waisanen, D. Shah, and M. A. Dahleh, "A dynamic pickup and delivery problem in mobile networks under information constraints," IEEE Trans. Autom. Control, vol. 53, no. 6, pp. 1419-1433, Jun. 2008.
51. M. R. Swihart and J. D. Papastavrou, "A stochastic and dynamic model for the single-vehicle pick-up delivery problem," Eur. J. Oper. Res., vol. 114, no. 3, pp. 447-464, 1999.
52. S. Itani, E. Frazzoli, and M. A. Dahleh, "Dynamic travelling repairperson problem for dynamic systems," in Proc. IEEE Conf. Decision Control, Cancún, México, Dec. 2008, pp. 465-470.
53. J. Beardwood, J. Halton, and J. Hammersly, "The shortest path through many points," in Proc. Cambridge Philosophy Soc., 1959, vol. 55, pp. 299-327.
54. J. M. Steele, "Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space," Math. Oper. Res., vol. 15, no. 4, pp. 749-770, 1990.
55. A. G. Percus and O. C. Martin, "Finite size and dimensional dependence of the Euclidean traveling salesman problem," Phys. Rev. Lett., vol. 76, no. 8, pp. 1188-1191, 1996. (Pubitemid 126586078)
56. R. C. Larson and A. R. Odoni, Urban Operations Research. Englewood Cliffs, NJ: Prentice-Hall, 1981.
57. 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, vol. Extra Volume ICM III, Proc. Int. Congr. Math., "erlin, Germany, Aug. 1998, pp. 645-656.
58. N. Christofides, "Worst-case analysis of a new heuristic for the traveling salesman problem," Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. 388, Apr. 1976.
59. S. Arora, "Nearly linear time approximation scheme for Euclidean TSP and other geometric problems," in Proc. IEEE Symp. Found. Comput. Sci., Miami Beach, FL, Oct. 1997, pp. 554-563.
60. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.
61. N. Megiddo and K. J. Supowit, "On the complexity of some common geometric location problems," SIAM J. Comput., vol. 13, no. 1, pp. 182-196, 1984. (Pubitemid 15494582)
62. C. H. Papadimitriou, "Worst-case and probabilistic analysis of a geometric location problem," SIAM J. Comput., vol. 10, no. 3, pp. 542-557, 1981.