1 Verification of the walking gait generation algorithms using branch and bound methods

被引：0
|
作者：
Ondrousek, V. [1 ]
Vechet, S. [1 ]
Krejsa, J. [1 ]
Houska, P. [1 ]
机构：
[1] Brno Univ Technol, Fac Mech Engn, Inst Automat & Comp Sci, Technicka 2, Brno 61669, Czech Republic
来源：
RECENT ADVANCES IN MECHATRONICS | 2007年
关键词：
D O I：
10.1007/978-3-540-73956-2_31
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The contribution is focused on generation of walking gates for quadruped robot using heuristic search state space algorithms. The efficiency of classical A* algorithm is improved by using branch and bound methods. Simulation verification shows reduction of number of states space nodes generated during the search.
引用
收藏
页码：151 / +
页数：2
相关论文
共 50 条
  • [1] Comparison of Gait Generation methods in Quadruped Walking
    Darici, Osman
    Yalcin, Mehmet Kuersat
    Temeltas, Hakan
    2008 IEEE/ASME INTERNATIONAL CONFERENCE ON ADVANCED INTELLIGENT MECHATRONICS, VOLS 1-3, 2008, : 1 - +
  • [2] Gait verification using probabilistic methods
    Bazin, AI
    Nixon, MS
    WACV 2005: SEVENTH IEEE WORKSHOP ON APPLICATIONS OF COMPUTER VISION, PROCEEDINGS, 2005, : 60 - 65
  • [3] Walking Pattern Classification and Walking Distance Estimation Algorithms Using Gait Phase Information
    Wang, Jeen-Shing
    Lin, Che-Wei
    Yang, Ya-Ting C.
    Ho, Yu-Jen
    IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 2012, 59 (10) : 2884 - 2892
  • [4] Bifurcation Analysis Using Rigorous Branch and Bound Methods
    Smith, Andrew P.
    Crespo, Luis G.
    Munoz, Cesar A.
    Lowenberg, Mark H.
    2014 IEEE CONFERENCE ON CONTROL APPLICATIONS (CCA), 2014, : 2095 - 2100
  • [5] Protein Decoy Generation Using Branch and Bound with Efficient Bounding
    Paluszewski, Martin
    Winter, Pawel
    ALGORITHMS IN BIOINFORMATICS, WABI 2008, 2008, 5251 : 382 - 393
  • [6] Implementation of parallel optimization algorithms using generalized branch and bound template
    Baravykaite, M.
    Zilinskas, J.
    COMPUTER AIDED METHODS IN OPTIMAL DESIGN AND OPERATIONS, 2006, 7 : 21 - +
  • [7] PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS USING BRANCH AND BOUND METHODS
    WILLIS, RJ
    HASTINGS, NAJ
    OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) : 341 - 349
  • [8] A STUDY OF PARALLEL BRANCH-AND-BOUND ALGORITHMS WITH BEST-BOUND-1ST SEARCH
    TROYA, JM
    ORTEGA, M
    PARALLEL COMPUTING, 1989, 11 (01) : 121 - 126
  • [9] TRIPOD GAIT GENERATION FOR A HEXAPOD USING GEOMETRICAL METHODS
    Rajput, Jahanzeb
    Hasan, Khalid M.
    INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2011, 26 (04): : 353 - 361
  • [10] Disassembly sequence plan generation using a branch-and-bound algorithm
    Güngör, A
    Gupta, SM
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (03) : 481 - 509
12345