메뉴 건너뛰기




Volumn , Issue , 2013, Pages 2407-2414

Lazy Toggle PRM: A single-query approach to motion planning

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; DESCRIPTIVE COMPLEXITY; HIGH-DIMENSIONAL; NARROW SPACES; PROBABILISTIC ROAD MAPS; QUERY TIME; ROAD-MAPS; ROADMAP;

EID: 84887264306     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2013.6630904     Document Type: Conference Paper
Times cited : (29)

References (25)
  • 7
    • 84959555568 scopus 로고    scopus 로고
    • Toward optimal configuration space sampling
    • B. Burns and O. Brock. Toward optimal configuration space sampling. In Proc. Robotics: Sci. Sys. (RSS), pages 105-112, 2005.
    • (2005) Proc. Robotics: Sci. Sys. (RSS) , pp. 105-112
    • Burns, B.1    Brock, O.2
  • 8
    • 84455202774 scopus 로고    scopus 로고
    • Toggle PRM: Simultaneous mapping of C-free and C-obstacle-A study in 2D
    • San Francisco, California, USA, Septempber
    • J. Denny and N. M. Amato. Toggle PRM: Simultaneous mapping of C-free and C-obstacle-A study in 2D-. In Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), pages 2632-2639, San Francisco, California, USA, Septempber 2011.
    • (2011) Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS) , pp. 2632-2639
    • Denny, J.1    Amato, N.M.2
  • 9
    • 84864441973 scopus 로고    scopus 로고
    • The toggle local planner for samplingbased motion planning
    • St. Paul, Minnesota, USA, May
    • J. Denny and N. M. Amato. The toggle local planner for samplingbased motion planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1779-1786, St. Paul, Minnesota, USA, May 2012.
    • (2012) Proc IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 1779-1786
    • Denny, J.1    Amato, N.M.2
  • 10
    • 84887303855 scopus 로고    scopus 로고
    • Toggle PRM: A coordinated mapping of C-free and C-obstacle in arbitrary dimension
    • Cambridge, Massachusetts, USA, June
    • J. Denny and N. M. Amato. Toggle PRM: A coordinated mapping of C-free and C-obstacle in arbitrary dimension. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), Cambridge, Massachusetts, USA, June 2012.
    • (2012) Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR)
    • Denny, J.1    Amato, N.M.2
  • 11
    • 0344014348 scopus 로고    scopus 로고
    • Bridge test for sampling narrow passages with probabilistic roadmap planners
    • D. Hsu, T. Jiang, J. 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.3    Sun, Z.4
  • 12
    • 33745294939 scopus 로고    scopus 로고
    • On the probabilistic foundations of probabilistic roadmap planning
    • July
    • D. Hsu, J.-C. Latombe, and H. Kurniawati. On the probabilistic foundations of probabilistic roadmap planning. Int. J. Robot. Res., 25:627-643, July 2006.
    • (2006) Int. J. Robot. Res. , vol.25 , pp. 627-643
    • Hsu, D.1    Latombe, J.-C.2    Kurniawati, H.3
  • 13
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • August
    • L. E. Kavraki, P. ?Svestka, 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    Svestka, P.2    Latombe, J.C.3    Overmars, M.H.4
  • 16
    • 0344445620 scopus 로고    scopus 로고
    • A general framework for sampling on the medial axis of the free space
    • September
    • J.-M. Lien, S. L. Thomas, and N. M. Amato. A general framework for sampling on the medial axis of the free space. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 4439-4444, September 2003.
    • (2003) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 4439-4444
    • Lien, J.-M.1    Thomas, S.L.2    Amato, N.M.3
  • 17
    • 0018533130 scopus 로고
    • An algorithm for planning collision-free paths among polyhedral obstacles
    • October
    • T. Lozano-Perez and M. A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22(10):560-570, October 1979.
    • (1979) Communications of the ACM , vol.22 , Issue.10 , pp. 560-570
    • Lozano-Perez, T.1    Wesley, M.A.2
  • 19
    • 0018730847 scopus 로고
    • Complexity of the mover's problem and generalizations
    • San Juan, Puerto Rico, October
    • J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 421-427, San Juan, Puerto Rico, October 1979.
    • (1979) Proc. IEEE Symp. Foundations of Computer Science (FOCS) , pp. 421-427
    • Reif, J.H.1
  • 24
    • 0032632832 scopus 로고    scopus 로고
    • MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space
    • S. A. Wilmarth, N. M. Amato, and P. F. Stiller. MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), volume 2, pages 1024-1031, 1999.
    • (1999) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , vol.2 , pp. 1024-1031
    • Wilmarth, S.A.1    Amato, N.M.2    Stiller, P.F.3


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