Constrained quadratic programming and neurodynamics-based solver for energy optimization of biped walking robots (Q1993013)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constrained quadratic programming and neurodynamics-based solver for energy optimization of biped walking robots |
scientific article; zbMATH DE number 6972365
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained quadratic programming and neurodynamics-based solver for energy optimization of biped walking robots |
scientific article; zbMATH DE number 6972365 |
Statements
Constrained quadratic programming and neurodynamics-based solver for energy optimization of biped walking robots (English)
0 references
5 November 2018
0 references
Summary: The application of biped robots is always trapped by their high energy consumption. This paper makes a contribution by optimizing the joint torques to decrease the energy consumption without changing the biped gaits. In this work, a constrained quadratic programming (QP) problem for energy optimization is formulated. A neurodynamics-based solver is presented to solve the QP problem. Differing from the existing literatures, the proposed neurodynamics-based energy optimization (NEO) strategy minimizes the energy consumption and guarantees the following three important constraints simultaneously: (i) the force-moment equilibrium equation of biped robots, (ii) frictions applied by each leg on the ground to hold the biped robot without slippage and tipping over, and (iii) physical limits of the motors. Simulations demonstrate that the proposed strategy is effective for energy-efficient biped walking.
0 references
0.89116096
0 references
0.88744974
0 references
0.8641071
0 references
0.85992754
0 references