메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 3856-3861

Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain

Author keywords

Motion planning; RRTs; Voronoi bias

Indexed keywords

PROBLEM SOLVING; QUERY LANGUAGES; TREES (MATHEMATICS);

EID: 33846123309     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2005.1570709     Document Type: Conference Paper
Times cited : (254)

References (36)
  • 9
    • 0036058306 scopus 로고    scopus 로고
    • A random loop generator for planning the motions of closed kinematic chains using PRM methods
    • J. Cortés, T. Siméon, and J.P. Laumond. A random loop generator for planning the motions of closed kinematic chains using PRM methods. In IEEE Int. Conf. Robot. & Autom., 2002.
    • (2002) IEEE Int. Conf. Robot. & Autom
    • Cortés, J.1    Siméon, T.2    Laumond, J.P.3
  • 12
    • 0025693334 scopus 로고
    • Solving findpath by combination of goal-directed and randomized search
    • May
    • B. Glavina. Solving findpath by combination of goal-directed and randomized search. In IEEE Int. Conf. Robot. & Autom., pages 1718-1723, May 1990.
    • (1990) IEEE Int. Conf. Robot. & Autom , pp. 1718-1723
    • Glavina, B.1
  • 14
    • 0033685603 scopus 로고    scopus 로고
    • A framework for using the workspace medial axis in PRM planners
    • C. Holleman and L. E. Kavraki. A framework for using the workspace medial axis in PRM planners. In IEEE Int. Conf. Robot. & Autom., pages 1408-1413, 2000.
    • (2000) IEEE Int. Conf. Robot. & Autom , pp. 1408-1413
    • Holleman, C.1    Kavraki, L.E.2
  • 15
    • 33846147210 scopus 로고    scopus 로고
    • D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In et al. P. Agarwal, editor, Robotics: The Algorithmic Perspective, pages 141-154. A.K. Peters, Wellesley, MA, 1998.
    • D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In et al. P. Agarwal, editor, Robotics: The Algorithmic Perspective, pages 141-154. A.K. Peters, Wellesley, MA, 1998.
  • 17
    • 0346148675 scopus 로고    scopus 로고
    • S. Kagami, J. Kuffner, K. Nishiwaki, and K. Okada M. Inaba. Humanoid arm motion planning using stereo vision and RRT search. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2003.
    • S. Kagami, J. Kuffner, K. Nishiwaki, and K. Okada M. Inaba. Humanoid arm motion planning using stereo vision and RRT search. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2003.
  • 18
    • 0141615936 scopus 로고    scopus 로고
    • Planning collision-free reaching motions for interative object manipulation and grasping
    • M. Kallmann, A. Aubel, T. Abaci, and D. Thalmann. Planning collision-free reaching motions for interative object manipulation and grasping. Eurographics, 22(3), 2003.
    • (2003) Eurographics , vol.22 , Issue.3
    • Kallmann, M.1    Aubel, A.2    Abaci, T.3    Thalmann, D.4
  • 19
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • June
    • 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. & Autom., 12(4):566-580, June 1996.
    • (1996) IEEE Trans. Robot. & Autom , vol.12 , Issue.4 , pp. 566-580
    • Kavraki, L.E.1    Svestka, P.2    Latombe, J.-C.3    Overmars, M.H.4
  • 20
    • 0344877235 scopus 로고    scopus 로고
    • Motion planning of aerial robot using rapidly-exploring random trees with dynamic constraints
    • J. Kim and J. P. Ostrowski. Motion planning of aerial robot using rapidly-exploring random trees with dynamic constraints. In IEEE Int. Conf. Robot. & Autom., 2003.
    • (2003) IEEE Int. Conf. Robot. & Autom
    • Kim, J.1    Ostrowski, J.P.2
  • 22
    • 3042630071 scopus 로고    scopus 로고
    • Kinodynamic motion planning: Connecting exploration trees using trajectory optimization methods
    • F. Lamiraux, E. Ferre, and E. Vallee. Kinodynamic motion planning: connecting exploration trees using trajectory optimization methods. In IEEE Int. Conf. Robot. & Autom., pages 3987-3992, 2004.
    • (2004) IEEE Int. Conf. Robot. & Autom , pp. 3987-3992
    • Lamiraux, F.1    Ferre, E.2    Vallee, E.3
  • 23
    • 18844395372 scopus 로고    scopus 로고
    • Rapidly-exploring random trees: A new tool for path planning
    • Iowa State University, Oct
    • S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University, Oct. 1998.
    • (1998) Computer Science Dept , vol.TR 98-11
    • LaValle, S.M.1
  • 24
    • 3042585027 scopus 로고    scopus 로고
    • Online, 2004. Available at
    • S. M. LaValle. Planning Algorithms. [Online], 2004. Available at http://msl.cs.uiuc.edu/planning/.
    • Planning Algorithms
    • LaValle, S.M.1
  • 25
    • 0000606666 scopus 로고    scopus 로고
    • Rapidly-exploring random trees: Progress and prospects
    • B. R. Donald, K. M. Lynch, and D. Rus, editors, A K Peters, Wellesley, MA
    • S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 293-308. A K Peters, Wellesley, MA, 2001.
    • (2001) Algorithmic and Computational Robotics: New Directions , pp. 293-308
    • LaValle, S.M.1    Kuffner, J.J.2
  • 29
    • 3142714803 scopus 로고    scopus 로고
    • A single-query bi-directional probabilistic roadmap planner with lazy collision checking
    • G. Sánchez and J.-C. Latombe. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In Int. Symp. Robotics Research, 2001.
    • (2001) Int. Symp. Robotics Research
    • Sánchez, G.1    Latombe, J.-C.2
  • 30
    • 0032136882 scopus 로고    scopus 로고
    • Multilevel path planning for nonholonomic robots using semiholonomic subsystems
    • S. Sekhavat, P. Svestka, J.-P. Laumond, and M. H. Overmars. Multilevel path planning for nonholonomic robots using semiholonomic subsystems. Int. J. Robot. Res., 17:840-857, 1998.
    • (1998) Int. J. Robot. Res , vol.17 , pp. 840-857
    • Sekhavat, S.1    Svestka, P.2    Laumond, J.-P.3    Overmars, M.H.4
  • 31
  • 34
    • 0029184080 scopus 로고
    • Coordinated motion planning for multiple car-like robots using probabilistic roadmaps
    • P. Svestka and M. H. Overmars. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. In IEEE Int. Conf. Robot. & Autom., pages 1631-1636, 1995.
    • (1995) IEEE Int. Conf. Robot. & Autom , pp. 1631-1636
    • Svestka, P.1    Overmars, M.H.2
  • 35
    • 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 IEEE Int. Conf. Robot. & Autom., pages 1024-1031, 1999.
    • (1999) IEEE Int. Conf. Robot. & Autom , pp. 1024-1031
    • Wilmarth, S.A.1    Amato, N.M.2    Stiller, P.F.3
  • 36


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