Advertisement

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

  • V. Ondroušek
  • S. Věchet
  • J. Krejsa
  • P. Houška

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Mařík V., Štěpánková O., Katanský J., a kol., Umělá inteligence 1, Academia, 1993Google Scholar
  2. [2]
    Ondroušek V.; Březina, T.; Krejsa J.; Houška, P.: Using Virtual Prototype for the testing of algorithms generating robot’s walking gait, Simulation Modelling of Mechatronic Systems II, pp.121–130, ISBN 84-3341-80-21, (2006), VUT v BrněGoogle Scholar
  3. [3]
    Ondroušek V., Březina T., The Automatic Generation of Walking Policies for a Four-legged Robot in a Nondeterministic Space, Sborník národní konference Inženýrská mechanika, Svratka, 2006.Google Scholar
  4. [4]
    Ondroušek V., Březina T., Krejsa J., The Walking Policies Automatic Generation Using Beam Search, in: Proc. of the 12th International Conference on Soft Computing MENDEL 2006, Brno, Czech Republic, pp.145–150.Google Scholar
  5. [5]
    Pearl J., Heuristics, Intelligent Search Strategies for Computer ProblemGoogle Scholar
  6. [6]
    Rich E., Knight K.: Artifical Intelligence-Second Edition.McGraw-Hill, Inc., New York, 1991.Google Scholar
  7. [8]
    Řeřucha V., Inteligentní řízení kráčejícího robota, Vojenská akademie v Brně, 1997Google Scholar
  8. [7]
    Solving, Addison-Wesley, Reading, Mass., 1984Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • V. Ondroušek
    • 1
  • S. Věchet
    • 1
  • J. Krejsa
    • 1
  • P. Houška
    • 1
  1. 1.Institute of Automatization and Computer Science, Faculty of Mechanics EngineeringBrno University of TechnologyBrnoCzech Republic

Personalised recommendations