메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 404-410

Reachability analysis of sampling based planners

Author keywords

Motion planning; Potential held local planner; PRM; Reachability analysis

Indexed keywords

PROBABILISTIC LOGICS; PROBLEM SOLVING;

EID: 33846131978     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2005.1570152     Document Type: Conference Paper
Times cited : (19)

References (14)
  • 1
    • 0018730847 scopus 로고
    • Complexity of the mover's problem and generalizations
    • J. Reif, "Complexity of the mover's problem and generalizations, " in IEEE Syrup. on Foundations of Computer Science, 1979, pp. 421-427.
    • (1979) IEEE Syrup. on Foundations of Computer Science , pp. 421-427
    • Reif, J.1
  • 3
    • 0022706013 scopus 로고    scopus 로고
    • M.B.-Or, D. Kozen, and J. Reif, The complexity of elementary algebra and geometry, Computer and Systems Sciences, 32, pp. 251-264, 1986.
    • M.B.-Or, D. Kozen, and J. Reif, "The complexity of elementary algebra and geometry," Computer and Systems Sciences, vol. 32, pp. 251-264, 1986.
  • 5
    • 26344452629 scopus 로고
    • Automatic motion planning for complex articulated bodies
    • Paris Research Laboratory, Tech. Rep
    • J. Barraquand, "Automatic motion planning for complex articulated bodies," Paris Research Laboratory, Tech. Rep., 1991.
    • (1991)
    • Barraquand, J.1
  • 6
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • L. Kavraki, P. S̃vestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Trans. on Robotics and Automation, vol. 12, no. 4, pp. 566-580, 1996.
    • (1996) IEEE Trans. on Robotics and Automation , vol.12 , Issue.4 , pp. 566-580
    • Kavraki, L.1    S̃vestka, P.2    Latombe, J.-C.3    Overmars, M.4


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