메뉴 건너뛰기




Volumn , Issue , 2012, Pages 166-172

Costmap planning in high dimensional configuration spaces

Author keywords

[No Author keywords available]

Indexed keywords

CONFIGURATION SPACE; HIERARCHICAL PARTITIONING; HIGH-DIMENSIONAL; HIGHER-DIMENSIONAL PROBLEMS; PATH PLANNING PROBLEMS; PATH-PLANNING ALGORITHM;

EID: 84866905273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AIM.2012.6265953     Document Type: Conference Paper
Times cited : (11)

References (18)
  • 1
    • 0000606666 scopus 로고    scopus 로고
    • Rapidly-exploring random trees : Progress and prospects
    • B. Donald, K. Lynch, and D. Rus, Eds. Boston: A.K. Peters
    • S. LaValle and J. Kuffner, "Rapidly-exploring random trees : Progress and prospects," in Algorithmic and Computational Robotics: New Directions, B. Donald, K. Lynch, and D. Rus, Eds. Boston: A.K. Peters, 2001, pp. 293-308.
    • (2001) Algorithmic and Computational Robotics: New Directions , pp. 293-308
    • Lavalle, S.1    Kuffner, J.2
  • 7
    • 84863574079 scopus 로고    scopus 로고
    • Incremental sampling-based algorithms for optimal motion planning
    • submitted
    • S. Karaman and E. Frazzoli, "Incremental sampling-based algorithms for optimal motion planning," Int. Journal of Robotics Research, 2010, submitted.
    • (2010) Int. Journal of Robotics Research
    • Karaman, S.1    Frazzoli, E.2


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