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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mařík V., Štěpánková O., Katanský J., a kol., Umělá inteligence 1, Academia, 1993
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ě
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.
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.
Pearl J., Heuristics, Intelligent Search Strategies for Computer Problem
Rich E., Knight K.: Artifical Intelligence-Second Edition.McGraw-Hill, Inc., New York, 1991.
Řeřucha V., Inteligentní řízení kráčejícího robota, Vojenská akademie v Brně, 1997
Solving, Addison-Wesley, Reading, Mass., 1984
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ondroušek, V., Věchet, S., Krejsa, J., Houška, P. (2007). Verification of the walking gait generation algorithms using branch and bound methods. In: Jabłoński, R., Turkowski, M., Szewczyk, R. (eds) Recent Advances in Mechatronics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73956-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-73956-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73955-5
Online ISBN: 978-3-540-73956-2
eBook Packages: EngineeringEngineering (R0)