Verification of the walking gait generation algorithms using branch and bound methods
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F07%3APU68854" target="_blank" >RIV/00216305:26210/07:PU68854 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Verification of the walking gait generation algorithms using branch and bound methods
Original language description
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 name
Verification of the walking gait generation algorithms using branch and bound methods
Czech description
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.
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Recent Advances in Mechatronics
ISBN
978-3-540-73955-5
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Warsaw
Event date
Sep 19, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000251017700031