On the point-to-point and traveling salesperson problems for Dubins' vehicle

Proceedings of the American Control Conference

Volumn 2, Issue , 2005, Pages 786-791

  Savla, Ketan ^a   Frazzoli, Emilio ^b   Bullo, Francesco ^a  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED CURVATURE; CONSTRAINT FACTOR APPROXIMATION; POINT-TO-POINT PROBLEMS; WORST-CASE PERFORMANCE;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; CONSTRAINT THEORY; VEHICLES;

TRAVELING SALESMAN PROBLEM;

EID: 23944506066     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Beardwood, J. Halton, and J. Hammersly, "The shortest path through many points," in Proceedings of the Cambridge Philosophy Society, vol. 55, pp. 299-327, 1959.
2. J. M. Steele, "Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space," Mathematics of Operations Research, vol. 15, no. 4, p. 749, 1990.
3. 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, (Berlin, Germany), pp. 645-656, Aug. 1998. Proceedings of the International Congress of Mathematicians, Extra Volume ICM III.
4. 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, (Miami Beach, FL), pp. 554-563, Oct. 1997.
5. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations Research, vol. 21, pp. 498-516, 1973.
6. A. Aggarwal, D. Coppersmith, S. Khanna, R. Motwani, and B. Schieber, "The angular-metric traveling salesman problem," SIAM Journal on Computing, vol. 29, no. 3, pp. 697-711, 1999.
7. L. E. Dubins, "On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents," American Journal of Mathematics, vol. 79, pp. 497-516, 1957.
8. A. M. Shkel and V. J. Lumelsky, "Classification of the Dubins set," Robotics and Autonomous Systems, vol. 34, pp. 179-202, 2001.
9. J.-D. Boissonnat and S. Lazard, "A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles," International Journal of Computational Geometry and Applications, vol. 13, pp. 189-229, 2003.
10. Z. Tang and Ü. Özgüner, "On motion planning for multi-target surveillance by multiple mobile sensor agents." Preprint, Aug. 2004.
11. R. W. Beard, T. W. McLain, M. A. Goodrich, and E. P. Anderson, "Coordinated target assignment and intercept for unmanned air vehicles," IEEE Transactions on Robotics and Automation, vol. 18, no. 9, pp. 911-922, 2002.
12. K. J. Supowit, E. M. Reingold, and D. A. Plaisted, "The traveling salesman problem and minimum matching in the unit square," SIAM Journal on Computing, vol. 12, pp. 144-156, 1983.
13. K. Savla, E. Frazzoli, and F. Bullo, "On the stochastic analysis of traveling salesperson problem for Dubins' vehicle," in IEEE Conf. on Decision and Control, Dec. 2005. Submitted.
14. E. Frazzoli and F. Bullo, "Decentralized algorithms for vehicle routing in a stochastic time-varying environment," in IEEE Conf. on Decision and Control, (Paradise Island, Bahamas), pp. 3357-3363, Dec. 2004.