메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1772-1778

Adapting RRT growth for heterogeneous environments

Author keywords

[No Author keywords available]

Indexed keywords

COST-SENSITIVE LEARNING; EXPANSION METHODS; EXPERIMENTAL ANALYSIS; EXPLORATION METHODS; GROWTH SELECTION; HETEROGENEOUS ENVIRONMENTS; PLANNING UNDER UNCERTAINTY; RAPIDLY-EXPLORING RANDOM TREES;

EID: 84893816554     PISSN: 21530858     EISSN: 21530866     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2013.6696589     Document Type: Conference Paper
Times cited : (23)

References (30)
  • 6
    • 0035558104 scopus 로고    scopus 로고
    • Reducing metric sensitivity in randomized trajectory design
    • P. Cheng and S. LaValle. Reducing metric sensitivity in randomized trajectory design. In Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), volume 1, pages 43-48 vol.1, 2001.
    • (2001) Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS) , vol.1 , pp. 43-48
    • Cheng, P.1    Lavalle, S.2
  • 7
    • 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
  • 11
    • 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
  • 13
    • 0001209809 scopus 로고    scopus 로고
    • Motion planning: A journey of robots, molecules, digital actors, and other artifacts
    • J. C. Latombe. Motion planning: A journey of robots, molecules, digital actors, and other artifacts. Int. Journal of Robotics Research, 18(11):1119-1128, 1999.
    • (1999) Int. Journal of Robotics Research , vol.18 , Issue.11 , pp. 1119-1128
    • Latombe, J.C.1
  • 14
    • 0035327156 scopus 로고    scopus 로고
    • Randomized kinodynamic planning
    • May
    • S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. Int. J. Robot. Res., 20(5):378-400, May 2001.
    • (2001) Int. J. Robot. Res. , vol.20 , Issue.5 , pp. 378-400
    • Lavalle, S.M.1    Kuffner, J.J.2
  • 16
    • 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
  • 17
    • 36348958517 scopus 로고    scopus 로고
    • Analysis of the evolution of C-Space models built through incremental exploration
    • April
    • M. Morales, R. Pearce, and N. M. Amato. Analysis of the evolution of C-Space models built through incremental exploration. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1029-1034, April 2007.
    • (2007) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 1029-1034
    • Morales, M.1    Pearce, R.2    Amato, N.M.3
  • 18
    • 84880152114 scopus 로고    scopus 로고
    • A machine learning approach for feature-sensitive motion planning
    • Springer, Berlin/Heidelberg,. book contains the proceedings of the International Workshop on the Algorithmic Foundations of Robotics (WAFR), Utrecht/Zeist, The Netherlands, 2004
    • M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato. A machine learning approach for feature-sensitive motion planning. In Algorithmic Foundations of Robotics VI, pages 361-376. Springer, Berlin/Heidelberg, 2005. book contains the proceedings of the International Workshop on the Algorithmic Foundations of Robotics (WAFR), Utrecht/Zeist, The Netherlands, 2004.
    • (2005) Algorithmic Foundations of Robotics VI , pp. 361-376
    • Morales, M.1    Tapia, L.2    Pearce, R.3    Rodriguez, S.4    Amato, N.M.5
  • 23
    • 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
  • 25
    • 0034443474 scopus 로고    scopus 로고
    • Visibility-based probabilistic roadmaps for motion planning
    • T. Simeon, J.-P. Laumond, and C. Nissoux. Visibility-based probabilistic roadmaps for motion planning. Advanced Robotics, 14(6):477-493, 2000.
    • (2000) Advanced Robotics , vol.14 , Issue.6 , pp. 477-493
    • Simeon, T.1    Laumond, J.-P.2    Nissoux, C.3


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