메뉴 건너뛰기




Volumn , Issue , 2011, Pages 887-892

Path planning for unmanned ground vehicle in urban parking area

Author keywords

path planning; unmanned ground vehicle

Indexed keywords

COLLISION-FREE PATHS; COLLISION-FREE TRAJECTORY; HYBRID VEHICLES; LINE SEGMENT; PARKING AREAS; RAPIDLY-EXPLORING RANDOM TREES; SHORT-PATH; STATIC OBSTACLES; TEST VEHICLE; UNMANNED GROUND VEHICLES; URBAN AREAS; VISUALIZERS;

EID: 84856549481     PISSN: 15987833     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (5)
  • 1
    • 0000606666 scopus 로고    scopus 로고
    • Algorithmic and Computational Robotics: New Directions, chapter Rapidly-exploring random trees
    • Wellesley, MA
    • S. M. LaValle and J. J. Kuffner, "Algorithmic and Computational Robotics: New Directions, chapter Rapidly-exploring random trees"Progress and prospects, pp. 293-308, Wellesley, MA, 2001
    • (2001) Progress and Prospects , pp. 293-308
    • LaValle, S.M.1    Kuffner, J.J.2
  • 5
    • 33745918686 scopus 로고    scopus 로고
    • Section 24.3: Dijkstra's algorithm
    • (Second ed.). MIT Press andMcGraw-Hill. ISBN 0-262-03293-7
    • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Section 24.3: Dijkstra's algorithm". Introduction to Algorithms (Second ed.). MIT Press andMcGraw-Hill. pp. 595-601. ISBN 0-262-03293-7
    • (2001) Introduction to Algorithms , pp. 595-601
    • Cormen, T.H.1    Leiserson, C.E.2    Rivest, R.L.3    Stein, C.4


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