Discrete optimization methods to determine trajectories for Dubins' vehicles

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 17-24

  Medeiros, André César ^a   Urrutia, Sebastián ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Dubins' paths; Robotics; Traveling Salesman Problem

Indexed keywords

EID: 77954897657     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.003     Document Type: Article

References (6)

1. Aggarwal, A., D. Coppersmith, S. Khanna, R. Motwani, and B. Schieber, The angular-metric traveling salesman problem, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (1997), 221-229.
2. Dubins L.E. On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. American Journal of Mathematics 1957, 79:497-516.
3. Dantzig G.B., Fulkerson D.R., Johnson S.M. Solution of large scale traveling salesman problem. Oper. Res. 1954, 2:393-410.
4. LaValle S.M. Planning Algorithms 2006, Cambridge University Press, also available at. http://msl.cs.uiuc.edu/planning/.
5. Savla, K., E. Frazzoli, and F. Bullo, On the point-to-point and traveling salesperson problems for Dubins' vehicle, American Control Conference, Portland, OR (2005), 786-791.
6. Shkel A.M., Lumelsky V.J. Classification of the Dubins set. Robotics and Autonomous Systems 2001, 34:179-202.