Publication detail
Verification of the walking gait generation algorithms using branch and bound methods
ONDROUŠEK, V. KREJSA, J. VĚCHET, S. HOUŠKA, P.
Czech title
Verification of the walking gait generation algorithms using branch and bound methods
English title
Verification of the walking gait generation algorithms using branch and bound methods
Type
conference paper
Language
en
Original abstract
The contribution is focused on generation of walking gates for quadruped robot using heuristic search state space algorithms. The efficiency of clas-sical A* algorithm is improved by using branch and bound methods. Simu-lation verification shows reduction of number of states space nodes gener-ated during the search.
Czech abstract
The contribution is focused on generation of walking gates for quadruped robot using heuristic search state space algorithms. The efficiency of clas-sical A* algorithm is improved by using branch and bound methods. Simu-lation verification shows reduction of number of states space nodes gener-ated during the search.
English abstract
The contribution is focused on generation of walking gates for quadruped robot using heuristic search state space algorithms. The efficiency of clas-sical A* algorithm is improved by using branch and bound methods. Simu-lation verification shows reduction of number of states space nodes gener-ated during the search.
Keywords in Czech
walking robot, gait planning, branch and bound
Keywords in English
walking robot, gait planning, branch and bound
RIV year
2007
Released
01.09.2007
Publisher
Springer
Location
Berlin
ISBN
978-3-540-73955-5
Book
Recent Advances in Mechatronics
Edition number
1
Pages from–to
151–155
Pages count
5
BIBTEX
@inproceedings{BUT30269,
author="Vít {Ondroušek} and Jiří {Krejsa} and Stanislav {Věchet} and Pavel {Houška},
title="Verification of the walking gait generation algorithms using branch and bound methods",
booktitle="Recent Advances in Mechatronics",
year="2007",
month="September",
pages="151--155",
publisher="Springer",
address="Berlin",
isbn="978-3-540-73955-5"
}