메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 889-894

Efficiently biasing PRMs with passage potentials

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MOBILE ROBOTS;

EID: 33845669142     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1641822     Document Type: Conference Paper
Times cited : (6)

References (14)
  • 2
    • 0003028359 scopus 로고
    • A probabilistic learning approach to motion planning
    • K. Goldberg, D. Halperin, J. C. Latombe, and R. Wilson, Eds. A. K. Peters
    • M. Overmars and P. Svestka, "A Probabilistic Learning Approach to Motion Planning," in Algorithmic Foundations of Robotics (WAFR), K. Goldberg, D. Halperin, J. C. Latombe, and R. Wilson, Eds. A. K. Peters, 1995, pp. 19-37.
    • (1995) Algorithmic Foundations of Robotics (WAFR) , pp. 19-37
    • Overmars, M.1    Svestka, P.2
  • 4
    • 84864645023 scopus 로고    scopus 로고
    • A comparative study of probabilistic roadmap planners
    • J.-D. Boissonnat, J. Burdick, K. Goldberg, and S. Hutchinson, Eds. Springer-Verlag
    • R. Geraerts and M. Overmars, "A Comparative Study of Probabilistic Roadmap Planners," in Algorithmic Foundations of Robotics (WAFR), J.-D. Boissonnat, J. Burdick, K. Goldberg, and S. Hutchinson, Eds. Springer-Verlag, 2003, pp. 43-58.
    • (2003) Algorithmic Foundations of Robotics (WAFR) , pp. 43-58
    • Geraerts, R.1    Overmars, M.2
  • 6
    • 0002726880 scopus 로고    scopus 로고
    • OBPRM: An obstacle-based PRM for 3D workspaces
    • P. Agarwal, L. E. Kavraki, and M. Mason, Eds. AK Peters
    • N. M. Amato, B. Bayazit, L. Dale, C. Jones, and D. Vallejo, "OBPRM: An Obstacle-based PRM for 3D Workspaces," in Robotics: The Algorithmic Perspective, P. Agarwal, L. E. Kavraki, and M. Mason, Eds. AK Peters, 1998, pp. 156-168.
    • (1998) Robotics: The Algorithmic Perspective , pp. 156-168
    • Amato, N.M.1    Bayazit, B.2    Dale, L.3    Jones, C.4    Vallejo, D.5
  • 8
    • 0001185779 scopus 로고    scopus 로고
    • On finding narrow passages with probabilistic roadmap planners
    • P. Agarwal, L. E. Kavraki, and M. Mason, Eds. AK Peters
    • D. Hsu, L. E. Kavraki, J. C. Latombe, R. Motwani, and S. Sorkin, "On Finding Narrow Passages with Probabilistic Roadmap Planners," in Robotics: The Algorithmic Perspective, P. Agarwal, L. E. Kavraki, and M. Mason, Eds. AK Peters, 1998, pp. 141-154.
    • (1998) Robotics: The Algorithmic Perspective , pp. 141-154
    • Hsu, D.1    Kavraki, L.E.2    Latombe, J.C.3    Motwani, R.4    Sorkin, S.5
  • 9
    • 0344014348 scopus 로고    scopus 로고
    • The bridge test for sampling narrow passages with probabilistic roadmap planners
    • Taipei, Taiwan: IEEE
    • D. Hsu, T. Jiang, J. Reif, and Z. Sun, "The Bridge Test for Sampling Narrow Passages with Probabilistic Roadmap Planners," in International Conference on Robotics and Automation. Taipei, Taiwan: IEEE, 2003.
    • (2003) International Conference on Robotics and Automation
    • Hsu, D.1    Jiang, T.2    Reif, J.3    Sun, Z.4
  • 12
    • 0033685603 scopus 로고    scopus 로고
    • A framework for using the workspace medial axis in PRM planners
    • San Francisco, California: IEEE
    • C. Holleman and L. E. Kavraki, "A Framework for Using the Workspace Medial Axis in PRM Planners," in International Conference on Robotics and Automation. San Francisco, California: IEEE, 2000.
    • (2000) International Conference on Robotics and Automation
    • Holleman, C.1    Kavraki, L.E.2
  • 13
    • 0022674420 scopus 로고
    • Real-time obstacle avoidance for manipulators and mobile robots
    • O. Khatib, "Real-time Obstacle Avoidance for Manipulators and Mobile Robots," The International Journal of Robotics Research, vol. 5, no. 1, pp. 90-98, 1986.
    • (1986) The International Journal of Robotics Research , vol.5 , Issue.1 , pp. 90-98
    • Khatib, O.1


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