메뉴 건너뛰기




Volumn , Issue , 2012, Pages 2655-2662

UOBPRM: A uniformly distributed obstacle-based PRM

Author keywords

[No Author keywords available]

Indexed keywords

BRIDGE TESTS; C-SPACE; GAUSSIANS; MOTION PLANNING PROBLEMS; ROADMAP; SAMPLING METHOD;

EID: 84872288915     PISSN: 21530858     EISSN: 21530866     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2012.6385875     Document Type: Conference Paper
Times cited : (49)

References (14)
  • 3
    • 0036100047 scopus 로고    scopus 로고
    • Using motion planning to study protein folding pathways
    • Special issue of Int. Conf. Comput. Molecular Biology (RECOMB) 2001
    • N. M. Amato and G. Song. Using motion planning to study protein folding pathways. J. Comput. Biol., 9(2):149-168, 2002. Special issue of Int. Conf. Comput. Molecular Biology (RECOMB) 2001.
    • (2002) J. Comput. Biol. , vol.9 , Issue.2 , pp. 149-168
    • Amato, N.M.1    Song, G.2
  • 4
    • 0029706727 scopus 로고    scopus 로고
    • A randomized roadmap method for path and manipulation planning
    • N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 113-120, 1996.
    • (1996) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 113-120
    • Amato, N.M.1    Wu, Y.2
  • 5
    • 0026369737 scopus 로고
    • Robot motion planning: A distributed representation approach
    • J. Barraquand and J. C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, 1991.
    • (1991) Int. J. Robot. Res. , vol.10 , Issue.6 , pp. 628-649
    • Barraquand, J.1    Latombe, J.C.2
  • 9
    • 0344014348 scopus 로고    scopus 로고
    • Bridge test for sampling narrow passages with probabilistic roadmap planners
    • D. Hsu, T. Jiang, J.H. Reif, and Z. Sun. Bridge test for sampling narrow passages with probabilistic roadmap planners. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 4420-4426, 2003.
    • (2003) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 4420-4426
    • Hsu, D.1    Jiang, T.2    Reif, J.H.3    Sun, Z.4
  • 10
    • 0028599944 scopus 로고
    • Randomized preprocessing of configuration space for fast path planning
    • L. Kavraki and J. C. Latombe. Randomized preprocessing of configuration space for fast path planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 2138-2145, 1994.
    • (1994) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 2138-2145
    • Kavraki, L.1    Latombe, J.C.2
  • 11
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • August
    • L. E. Kavraki, P. Švestka, J. C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Automat., 12(4):566-580, August 1996.
    • (1996) IEEE Trans. Robot. Automat. , vol.12 , Issue.4 , pp. 566-580
    • Kavraki, L.E.1    Švestka, P.2    Latombe, J.C.3    Overmars, M.H.4
  • 14
    • 23844440873 scopus 로고    scopus 로고
    • Using motion planning to study RNA folding kinetics
    • Special issue of Int. Conf. Comput. Molecular Biology (RECOMB) 2004
    • X. Tang, B. Kirkpatrick, S. Thomas, G. Song, and N. M. Amato. Using motion planning to study RNA folding kinetics. J. Comput. Biol., 12(6):862-881, 2005. Special issue of Int. Conf. Comput. Molecular Biology (RECOMB) 2004.
    • (2005) J. Comput. Biol. , vol.12 , Issue.6 , pp. 862-881
    • Tang, X.1    Kirkpatrick, B.2    Thomas, S.3    Song, G.4    Amato, N.M.5


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