메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 7-12

Non-gaited humanoid locomotion planning

Author keywords

Equilibrium; Humanoid robots; Motion planning; Multi step planning; Non gaited locomotion

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; GAIT ANALYSIS; ITERATIVE METHODS; MOBILE ROBOTS; NAVIGATION SYSTEMS; PROBABILITY;

EID: 33846589759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICHR.2005.1573537     Document Type: Conference Paper
Times cited : (107)

References (19)
  • 3
    • 33645684128 scopus 로고    scopus 로고
    • Multi-step motion planning: Application to free-climbing robots,
    • Ph.D. dissertation, Stanford University, Stanford, CA
    • T. Bretl, "Multi-step motion planning: Application to free-climbing robots," Ph.D. dissertation, Stanford University, Stanford, CA, 2005.
    • (2005)
    • Bretl, T.1
  • 4
    • 33846148145 scopus 로고    scopus 로고
    • Toward autonomous free-climbing robots
    • Siena, Italy
    • T. Bretl, J. Latombe, and S. Rock, "Toward autonomous free-climbing robots," in Int. Symp. Rob. Res., Siena, Italy, 2003.
    • (2003) Int. Symp. Rob. Res
    • Bretl, T.1    Latombe, J.2    Rock, S.3
  • 5
    • 33846601313 scopus 로고    scopus 로고
    • Multi-step motion planning for free-climbing robots
    • T. Bretl, S. Lall, J. Latombe, and S. Rock, "Multi-step motion planning for free-climbing robots," in WAFR, 2004.
    • (2004) WAFR
    • Bretl, T.1    Lall, S.2    Latombe, J.3    Rock, S.4
  • 6
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • L. Kavraki, P. Svestka, J. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," in IEEE Trans. Robot. Automat., vol. 12(4), 1996, pp. 566-580.
    • (1996) IEEE Trans. Robot. Automat , vol.12 , Issue.4 , pp. 566-580
    • Kavraki, L.1    Svestka, P.2    Latombe, J.3    Overmars, M.4
  • 7
    • 0003606752 scopus 로고    scopus 로고
    • Autonomous agents for real-time animation,
    • Ph.D. dissertation, Stanford University, Stanford, CA
    • J. Kuffner, "Autonomous agents for real-time animation," Ph.D. dissertation, Stanford University, Stanford, CA, 1999.
    • (1999)
    • Kuffner, J.1
  • 12
    • 0036058306 scopus 로고    scopus 로고
    • A random loop generator for planning the motions of closed kinematic chains using prm methods
    • J. Cortes, 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. Rob. Aut., 2002.
    • (2002) IEEE Int. Conf. Rob. Aut
    • Cortes, J.1    Siméon, T.2    Laumond, J.-P.3
  • 13
    • 0032641069 scopus 로고    scopus 로고
    • A probabilistic roadmap approach for systems with closed kinematic chains
    • S. M. LaValle, J. H. Yakey, and L. E. Kavraki, "A probabilistic roadmap approach for systems with closed kinematic chains," in IEEE Int. Conf. Rob. Aut., 1999.
    • (1999) IEEE Int. Conf. Rob. Aut
    • LaValle, S.M.1    Yakey, J.H.2    Kavraki, L.E.3
  • 14
    • 0026202120 scopus 로고
    • A combined optimization method for solving the inverse kinematics problem of mechanical manipulators
    • L. Wang and C. Chen, "A combined optimization method for solving the inverse kinematics problem of mechanical manipulators," in IEEE Trans. On Robotics and Applications, vol. 7, no. 4, 1991, pp. 489-499.
    • (1991) IEEE Trans. On Robotics and Applications , vol.7 , Issue.4 , pp. 489-499
    • Wang, L.1    Chen, C.2
  • 15
    • 0030421708 scopus 로고    scopus 로고
    • Obb-tree: A hierarchical structure for rapid interference detection
    • S. Gottschalk, M. C. Lin, and D. Manocha, "Obb-tree: A hierarchical structure for rapid interference detection," in ACM Siggraph, 1996.
    • (1996) ACM Siggraph
    • Gottschalk, S.1    Lin, M.C.2    Manocha, D.3
  • 16
    • 0002726880 scopus 로고    scopus 로고
    • Obprm: An obstacle-based prm for 3d workspaces
    • N. M. Amato, O. B. Bayazit, and L. K. Dale, "Obprm: An obstacle-based prm for 3d workspaces," in WAFR, 1998.
    • (1998) WAFR
    • Amato, N.M.1    Bayazit, O.B.2    Dale, L.K.3
  • 17
    • 79957971363 scopus 로고    scopus 로고
    • Finding narrow passages with probabilistic roadmaps: The small step retraction method
    • M. Saha and J.-C. Latombe, "Finding narrow passages with probabilistic roadmaps: The small step retraction method," in IEEE/RSJ Int. Conf. Int. Rob. Sys., 2005.
    • (2005) IEEE/RSJ Int. Conf. Int. Rob. Sys
    • Saha, M.1    Latombe, J.-C.2
  • 19
    • 3142714803 scopus 로고    scopus 로고
    • A single-query bi-directional probabilistic roadmap planner with lazy collision checking
    • Lome, Victoria, Australia
    • G. Sanchez-Ante and J. Latombe, "A single-query bi-directional probabilistic roadmap planner with lazy collision checking," in Int. Symp. Rob. Res., Lome, Victoria, Australia, 2001.
    • (2001) Int. Symp. Rob. Res
    • Sanchez-Ante, G.1    Latombe, J.2


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