.png){kind=icon}
.png){kind=icon}
Return
Implementation of Model Predictive Control for Tracking in Embedded Systems Using a Sparse Extended ADMM Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TCST.2021.3128824.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article presents a sparse, low-memory footprint optimization algorithm for the implementation of model predictive control (MPC) for tracking formulation in embedded systems. This MPC formulation has several advantages over standard MPC formulations, such as an increased domain of attraction and guaranteed recursive feasibility even in the event of a sudden reference change. However, this comes at the expense of the addition of a small amount of decision variables to the MPC's optimization problem that complicates the structure of its matrices. We propose a sparse optimization algorithm, based on an extension of the alternating direction method of multipliers, that exploits the structure of this particular MPC formulation. We describe the controller formulation and detail how its structure is exploited by means of the aforementioned optimization algorithm. We show closed-loop simulations comparing the proposed solver against other solvers and approaches from the literature.
Keywords:
Optimization
Embedded systems
Steady-state
Standards
Prediction algorithms
Sparse matrices
Costs
Embedded optimization
embedded systems
extended alternating direction method of multipliers (EADMM)
linear control
model predictive control (MPC)
Journal
IF:
3.9
Papers:
4.9K
Citations:
1.7W