Verification of the walking gait generation algorithms using branch and bound methods
2007
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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI