메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 620-629

An approximation algorithm for the curvature-constrained traveling salesman problem

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84962091275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (38)

References (11)
  • 1
    • 0032156828 scopus 로고    scopus 로고
    • Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
    • S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, 1998.
    • (1998) Journal of the ACM , vol.45 , Issue.5 , pp. 753-782
    • Arora, S.1
  • 3
    • 0000977157 scopus 로고
    • On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents
    • 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, 79:497-516, 1957.
    • (1957) American Journal of Mathematics , vol.79 , pp. 497-516
    • Dubins, L.E.1
  • 4
    • 0020097689 scopus 로고
    • On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
    • A. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12:23-39, 1982.
    • (1982) Networks , vol.12 , pp. 23-39
    • Frieze, A.1    Galbiati, G.2    Maffioli, F.3
  • 6
    • 0002436020 scopus 로고
    • Planning smooth paths for mobile robots
    • Z. Li and J. Canny, Editors Kluwer Academic
    • P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Z. Li and J. Canny, editors, Nonholonomic Motion Planning, pages 271-342. Kluwer Academic, 1992.
    • (1992) Nonholonomic Motion Planning , pp. 271-342
    • Jacobs, P.1    Canny, J.2
  • 7
    • 0002037506 scopus 로고
    • An efficient transformation of the generalized traveling salesman problem
    • C.E. Noon and J.C. Bean. An efficient transformation of the generalized traveling salesman problem. Information Systems and Operational Research, 31(1), 1993.
    • (1993) Information Systems and Operational Research , vol.31 , pp. 1
    • Noon, C.E.1    Bean, J.C.2
  • 9
    • 79960725433 scopus 로고    scopus 로고
    • On the stochastic traveling salesperson problem for Dubins' vehicle
    • Seville, Spain, December Submitted
    • K. Savla, F. Bullo, and E. Frazzoli. On the stochastic traveling salesperson problem for Dubins' vehicle. In IEEE Conference on Decision and Control, Seville, Spain, December 2005. Submitted.
    • (2005) IEEE Conference on Decision and Control
    • Savla, K.1    Bullo, F.2    Frazzoli, E.3
  • 10
    • 23944506066 scopus 로고    scopus 로고
    • On the point-to-point and traveling salesperson problems for Dubins' vehicle
    • Portland, OR June
    • K. Savla, E. Frazzoli, and F. Bullo. On the point-to-point and traveling salesperson problems for Dubins' vehicle. In Americal Control Conference, Portland, OR, June 2005.
    • (2005) Americal Control Conference
    • Savla, K.1    Frazzoli, E.2    Bullo, F.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.