메뉴 건너뛰기




Volumn , Issue , 2014, Pages 4674-4679

An improved RRT-based motion planner for autonomous vehicle in cluttered environments

Author keywords

[No Author keywords available]

Indexed keywords

VEHICLES;

EID: 84929192371     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2014.6907542     Document Type: Conference Paper
Times cited : (41)

References (21)
  • 1
    • 0022674420 scopus 로고
    • Real-time obstacle avoidance for manipulators and mobile robots
    • O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research, 5(1):90-98, 1986
    • (1986) International Journal of Robotics Research , vol.5 , Issue.1 , pp. 90-98
    • Khatib, O.1
  • 2
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E.W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.10.1007/BF01386390.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 4
    • 0025725109 scopus 로고
    • Potential field methods and their inherent limitations for mobile robot navigation
    • Y. Koren and J. Borenstein. Potential field methods and their inherent limitations for mobile robot navigation. In IEEE Conference on Robotics and Automation, 1991
    • (1991) IEEE Conference on Robotics and Automation
    • Koren, Y.1    Borenstein, J.2
  • 10
    • 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 Journal, vol. 14, no.6, 2000
    • (2000) Advanced Robotics Journal , vol.14 , Issue.6
    • Simeon, T.1    Laumond, J.P.2    Nissoux, C.3
  • 11
    • 0344014348 scopus 로고    scopus 로고
    • The bridge test for smapling narrow passages with probabilistic roadmap planners
    • D. Hsu, Tingting Jiang, J. Reif, and Zheng Sun, "The bridge test for smapling narrow passages with probabilistic roadmap planners", in IEEE ICRA, 2003, vol.3, pp.4420-4426 vol.3.
    • (2003) IEEE ICRA , vol.3 , Issue.3 , pp. 4420-4426
    • Hsu, D.1    Jiang, T.2    Reif, J.3    Sun, Z.4
  • 12
    • 33846123309 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.3856-3861.
    • (2005) IEEE ICRA , pp. 3856-3861
    • Yershova, A.1    Jaillet, L.2    Simeon, T.3    Lavalle, S.M.4
  • 18
    • 84865512057 scopus 로고    scopus 로고
    • Collision-free and smooth trajectory computation in cluttered environments
    • J. Pan, L. Zhang, and D. Manocha. Collision-free and smooth trajectory computation in cluttered environments. The International Journal of Robotics Research. 2012, 31(10):1155-1175.
    • (2012) The International Journal of Robotics Research , vol.31 , Issue.10 , pp. 1155-1175
    • Pan, J.1    Zhang, L.2    Manocha, D.3
  • 20
    • 30344482560 scopus 로고    scopus 로고
    • Finding narrow passages with probabilistic roadmaps: The small step retraction method
    • Dec
    • M. Saha, J. Latombe, Y. Chang, Lin and F, Prinz, "Finding narrow passages with probabilistic roadmaps: the small step retraction method", Intelligent Robots and Systems, vol.19, no.3, pp.301-319, Dec 2005.
    • (2005) Intelligent Robots and Systems , vol.19 , Issue.3 , pp. 301-319
    • Saha, M.1    Latombe, J.2    Chang Lin, Y.3    Prinz, F.4


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