A performance comparison between closed form and numerical optimization solutions for humanoid robot walking pattern generation
Mohamed, Samer A.; Maged, Shady A.; Mohammed Ibrahim Awad;
Abstract
This article presents the modeling process of the lower part of a humanoid biped robot in terms of kinematic/dynamic states and the creation of a full dynamic simulation environment for a walking robot using MATLAB/Simulink. This article presents two different approaches for offline walking pattern generation: one relying on a closed-form solution of the linear inverted pendulum model (LIPM) mathematical model and another that considers numerical optimization as means of desired output trajectory following for a cart table state-space model. This article then investigates the possibility of introducing solution-dependent modifications to both approaches that could increase the reliability of basic walking pattern generation models in terms of smooth single support–double support phase transitioning and power consumption optimization. The algorithms were coded into offline walking pattern generators for NAO humanoid robot as a valid example and the two approaches were compared against each other in terms of stability, power consumption, and computational effort as well as against their basic unmodified counterparts.
Other data
Title | A performance comparison between closed form and numerical optimization solutions for humanoid robot walking pattern generation | Authors | Mohamed, Samer A.; Maged, Shady A.; Mohammed Ibrahim Awad | Keywords | bio-inspired robotics | Bipedal | cart-table model | center of mass | cost of transport | humanoid | linear inverted pendulum model | model-predictive control | trajectories | zero moment point | Issue Date | 1-Jan-2021 | Journal | International Journal of Advanced Robotic Systems | ISSN | 17298806 | DOI | 10.1177/17298814211029774 | Scopus ID | 2-s2.0-85109836989 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.