Data-Driven MPC for Uncertain High-Order Fully Actuated Systems

This study combines machine learning with Model Predictive Control (MPC) to regulate the High-Order Fully Actuated (HOFA) nonlinear systems with disturbances. By exploiting the full-actuation characteristic of the HOFA system, we neatly eliminate the nonlinearity of the system, thus circumventing the complex computation of uncertainty propagation in nonlinear stochastic MPC. To address the disturbances, Principal Component Analysis (PCA) precisely identifies principal components, while Kernel Density Estimation (KDE) assesses probability distributions and uncertainty bounds. Furthermore, we apply stricter state constraints and define terminal sets to ensure the recursive feasibility of the method theoretically. Lastly, a numerical example is simulated to confirm the effectiveness and reliability of the proposed method.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865511
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Data-Driven MPC for Uncertain High-Order Fully Actuated Systems

Junhao Zhao, Chao Ning, Han Wang
Advanced Memory and Neural Computing
article

Data-Driven MPC for Uncertain High-Order Fully Actuated Systems

Junhao Zhao, Chao Ning, Han Wang
article en

Abstract

This study combines machine learning with Model Predictive Control (MPC) to regulate the High-Order Fully Actuated (HOFA) nonlinear systems with disturbances. By exploiting the full-actuation characteristic of the HOFA system, we neatly eliminate the nonlinearity of the system, thus circumventing the complex computation of uncertainty propagation in nonlinear stochastic MPC. To address the disturbances, Principal Component Analysis (PCA) precisely identifies principal components, while Kernel Density Estimation (KDE) assesses probability distributions and uncertainty bounds. Furthermore, we apply stricter state constraints and define terminal sets to ensure the recursive feasibility of the method theoretically. Lastly, a numerical example is simulated to confirm the effectiveness and reliability of the proposed method.

Shanghai Jiao Tong University (CN)
National Natural Science Foundation of China
Affordable and clean energy
Openalex Percentile: Top 75%
Advanced Memory and Neural Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.