2021
DOI: 10.1080/01691864.2021.1928543
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear model predictive control for robust bipedal locomotion: exploring angular momentum and CoM height changes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 35 publications
0
10
0
Order By: Relevance
“…To realise balance control under dynamic disturbances, Ding et al. [52] expanded to a non‐linear MPC method for considering the CoM height fluctuation, footstep adjustment and angular momentum regulation, which demonstrates the improvement of balance ability for push recovery. Daneshmand et al.…”
Section: Model‐based Gait Control Methodsmentioning
confidence: 99%
“…To realise balance control under dynamic disturbances, Ding et al. [52] expanded to a non‐linear MPC method for considering the CoM height fluctuation, footstep adjustment and angular momentum regulation, which demonstrates the improvement of balance ability for push recovery. Daneshmand et al.…”
Section: Model‐based Gait Control Methodsmentioning
confidence: 99%
“…Remark 2: Due to the utilization of CoP constraints (4), the above QCQP is a nonconvex problem. Although it can be solved efficiently by SQP, as done in [14], [18], and [19], the global convergence is not guaranteed. Here, we resort to the SDR technique to attain the global optimum, see Appendix A.…”
Section: C) Constraints On Com Motionmentioning
confidence: 99%
“…Although the authors in [16] combined ankle, stepping, and hip strategies, they ignored height variation To integrate ankle, stepping, hip, and height variation strategies in a unified way, the authors in [17] proposed an LMPC approach where the height trajectory was defined in advance. To alleviate this limitation, [18] proposed an NMPC scheme, which was formulated as a nonconvex quadratically constrained quadratic programming (QCQP) problem. And an enhanced version could be found in [19].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations