메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 3114-3119

C-space subdivision and integration in feature-sensitive motion planning

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FEATURE EXTRACTION; INFORMATION THEORY; PROBLEM SOLVING;

EID: 33846121601     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2005.1570589     Document Type: Conference Paper
Times cited : (14)

References (21)
  • 1
    • 33846155813 scopus 로고    scopus 로고
    • N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective, pages 155-168, Natick, MA, 1998. A.K. Peters. Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics (WAFR), Houston, TX, 1998.
    • N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective, pages 155-168, Natick, MA, 1998. A.K. Peters. Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics (WAFR), Houston, TX, 1998.
  • 2
    • 0026369737 scopus 로고
    • Robot motion planning: A distributed representation approach
    • J. Barraquand and J. C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, 1991.
    • (1991) Int. J. Robot. Res , vol.10 , Issue.6 , pp. 628-649
    • Barraquand, J.1    Latombe, J.C.2
  • 5
    • 0020905681 scopus 로고
    • A subdivision algorithm in configuration space for findpath with rotation
    • R. A. Brooks and T. Lozano-Pérez. A subdivision algorithm in configuration space for findpath with rotation. In Proc. Int. Conf. Artif. Intel., pages 799-806, 1983.
    • (1983) Proc. Int. Conf. Artif. Intel , pp. 799-806
    • Brooks, R.A.1    Lozano-Pérez, T.2
  • 8
    • 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
  • 9
    • 0022674420 scopus 로고
    • Real-time obstacle avoidance for manipulators and mobile robots
    • O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res., 5(1):90-98, 1986.
    • (1986) Int. J. Robot. Res , vol.5 , Issue.1 , pp. 90-98
    • Khatib, O.1
  • 11
    • 0018533130 scopus 로고
    • An algorithm for planning collision-free paths among polyhedral obstacles
    • October
    • T. Lozano-Pérez 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-Pérez, T.1    Wesley, M.A.2
  • 14
    • 0003515034 scopus 로고    scopus 로고
    • A two level fuzzy PRM for manipulation planning
    • Technical Report TR2000-365, Computer Science, Rice University, Houston, TX
    • C. L. Nielsen and L. E. Kavraki. A two level fuzzy PRM for manipulation planning. Technical Report TR2000-365, Computer Science, Rice University, Houston, TX, 2000.
    • (2000)
    • Nielsen, C.L.1    Kavraki, L.E.2
  • 15
    • 0003861985 scopus 로고
    • A random approach to path planning
    • Technical Report RUU-CS-92-32, Computer Science, Utrecht University, The Netherlands
    • M. Overmars. A random approach to path planning. Technical Report RUU-CS-92-32, Computer Science, Utrecht University, The Netherlands, 1992.
    • (1992)
    • Overmars, M.1
  • 17
    • 33744584654 scopus 로고
    • Induction of decision trees
    • J.R. Quinlan. Induction of decision trees. In Machine Learning, volume 1, pages 81-106, 1986.
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, J.R.1
  • 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
  • 20
    • 0347647219 scopus 로고
    • On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds
    • J. T. Schwartz and M. Shark. On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math., 4:298-351, 1983.
    • (1983) Adv. Appl. Math , vol.4 , pp. 298-351
    • Schwartz, J.T.1    Shark, M.2
  • 21
    • 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가 분석하여 추출한 것입니다.