2017
DOI: 10.1007/978-3-319-55011-4_15
|View full text |Cite
|
Sign up to set email alerts
|

Kinematic and Dynamic Approaches in Gait Optimization for Humanoid Robot Locomotion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 31 publications
0
7
0
Order By: Relevance
“…However, owing to the rapid growth of computational complexity with degrees-of-freedom, most of these studies were confined to models with a small number of degrees-of-freedom (often as few as two). Regarding motor learning as equivalent to some form of optimization process, real-time optimization of Lagrangian dynamic systems with as few as tens of degrees-of-freedom is profoundly challenging [Martínez-del Rincón et al, 2007, Khusainov et al, 2018. Due to what Richard Bellman called the "curse of dimensionality", optimization suffers deeply from the exponential growth of computational complexity, and often fails to converge to an optimal solution [Bellman, 2015].…”
Section: Why Study a Whip?-complexity Is Informativementioning
confidence: 99%
“…However, owing to the rapid growth of computational complexity with degrees-of-freedom, most of these studies were confined to models with a small number of degrees-of-freedom (often as few as two). Regarding motor learning as equivalent to some form of optimization process, real-time optimization of Lagrangian dynamic systems with as few as tens of degrees-of-freedom is profoundly challenging [Martínez-del Rincón et al, 2007, Khusainov et al, 2018. Due to what Richard Bellman called the "curse of dimensionality", optimization suffers deeply from the exponential growth of computational complexity, and often fails to converge to an optimal solution [Bellman, 2015].…”
Section: Why Study a Whip?-complexity Is Informativementioning
confidence: 99%
“…Thus, in order for biped robot to obtain a steady gait with the footlift set up in advance, we find the minimum value of the two objective functions f 1 and f 2 , or similarly to find the minimum of the function f as (10) in which, F x1 + F x2 and F y1 + F y2 is the length and width of the biped robot foot, (0 ≤ ≤ 1) can be used to satisfactorily select the priority between the walking stability ( increase) and the variance with the desired foot-lifting magnitude ( decreased).…”
Section: Optimization Of the Biped Robot Trajectorymentioning
confidence: 99%
“…Maximo et al [9] introduced a new stable and quick model-free gait with specific arms movement for biped robots. Khusainov et al [10] successfully combined kinematics and dynamics approaches in gait optimization for humanoid robot locomotion. The fact is that, nowadays, intelligent algorithms are being increasingly applied in this domain to optimize the gait generator parameters for humanoid robots such as GA [8], Particle Swarm Optimization (PSO) algorithm [11], Modified Differential Evolution (MDE) algorithm [12], Central Force Optimization (CFO) algorithm [13].…”
Section: Introductionmentioning
confidence: 99%
“…Maximo et al 9 introduced a new stable and quick model-free gait with specific arm movement for biped robots. Khusainov et al 10 successfully combined kinematics and dynamics approaches in biped gait optimization for humanoid robot locomotion. Moreover, nowadays, intelligent algorithms are being increasingly applied in this domain to optimize the gait generator parameters for humanoid robots such as GA, 8 particle swarm optimization (PSO) algorithm, 11 modified differential evolution (MDE) algorithm, 12 and central force optimization (CFO) algorithm.…”
Section: Introductionmentioning
confidence: 99%