메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2640-2645

Sampling heuristics for optimal motion planning in high dimensions

Author keywords

[No Author keywords available]

Indexed keywords

BI-DIRECTIONAL; CONFIGURATION SPACE; HIGH DIMENSIONS; HIGH-DIMENSIONAL; MOTION PLANNERS; NAVIGATION PROBLEM; OPTIMAL MOTION PLANNING; PLANNING ALGORITHMS; SAMPLING-BASED;

EID: 84455188406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2011.6048838     Document Type: Conference Paper
Times cited : (159)

References (12)
  • 1
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • L. Kavraki, P. Svestka, J. claude Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," in IEEE ICRA, 1996, pp. 566-580.
    • (1996) IEEE ICRA , pp. 566-580
    • Kavraki, L.1    Svestka, P.2    Latombe, J.C.3    Overmars, M.4
  • 3
    • 0033726628 scopus 로고    scopus 로고
    • Rrt-connect: An efficient approach to single-query path planning
    • J. Kuffner and S. M. Lavalle, "Rrt-connect: An efficient approach to single-query path planning," in IEEE ICRA, 2000, pp. 995-1001.
    • (2000) IEEE ICRA , pp. 995-1001
    • Kuffner, J.1    Lavalle, S.M.2
  • 4
    • 80052218929 scopus 로고    scopus 로고
    • Sampling-based algorithms for optimal motion planning
    • June
    • S. Karaman and E. Frazzoli, "Sampling-based algorithms for optimal motion planning," Int. J. Rob. Res., vol. 30, pp. 846-894, June 2011.
    • (2011) Int. J. Rob. Res. , vol.30 , pp. 846-894
    • Karaman, S.1    Frazzoli, E.2
  • 5
    • 33750985645 scopus 로고    scopus 로고
    • Approaches for heuristically biasing rrt growth
    • October
    • C. Urmson and R. Simmons, "Approaches for heuristically biasing rrt growth," in IEEE/RSJ IROS, October 2003.
    • (2003) IEEE/RSJ IROS
    • Urmson, C.1    Simmons, R.2
  • 6
  • 7
    • 69549120301 scopus 로고    scopus 로고
    • Transition-based RRT for path planning in continuous cost spaces
    • Sep.
    • L. Jaillet, J. Cortes, and T. Simeon, Transition-based RRT for path planning in continuous cost spaces. IEEE/RSJ IROS, Sep. 2008.
    • (2008) IEEE/RSJ IROS
    • Jaillet, L.1    Cortes, J.2    Simeon, T.3
  • 8
    • 51649093114 scopus 로고    scopus 로고
    • Balancing exploration and exploitation in motion planning
    • M. Rickert, O. Brock, and A. Knoll, "Balancing exploration and exploitation in motion planning," in IEEE ICRA, 2008, pp. 2812-2817.
    • (2008) IEEE ICRA , pp. 2812-2817
    • Rickert, M.1    Brock, O.2    Knoll, A.3
  • 9
    • 84455171463 scopus 로고    scopus 로고
    • Rapidly-exploring roadmaps: Weighing exploration vs. refinement in optimal motion planning
    • R. Alterovitz, S. Patil, and A. Derbakova, "Rapidly-exploring roadmaps: Weighing exploration vs. refinement in optimal motion planning," in IEEE ICRA, 2011.
    • (2011) IEEE ICRA
    • Alterovitz, R.1    Patil, S.2    Derbakova, A.3
  • 10
    • 29144506706 scopus 로고    scopus 로고
    • Dynamic-domain rrts: Efficient exploration by controlling the sampling domain
    • A. Yershova, L. Jaillet, T. Simeon, and S. M. LaValle, "Dynamic-domain rrts: Efficient exploration by controlling the sampling domain," in IEEE ICRA, 2005, pp. 3867-3872.
    • (2005) IEEE ICRA , pp. 3867-3872
    • Yershova, A.1    Jaillet, L.2    Simeon, T.3    LaValle, S.M.4
  • 12
    • 0032099153 scopus 로고    scopus 로고
    • SANDROS: A dynamic search graph algorithm for motion planning
    • P. C. Chen and Y. K. Hwang, "SANDROS: A dynamic search graph algorithm for motion planning," IEEE Transactions on Robotics & Automation, vol. 14, no. 3, pp. 390-403, 1998.
    • (1998) IEEE Transactions on Robotics & Automation , vol.14 , Issue.3 , pp. 390-403
    • Chen, P.C.1    Hwang, Y.K.2


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