2013 European Control Conference (ECC) 2013
DOI: 10.23919/ecc.2013.6669549
|View full text |Cite
|
Sign up to set email alerts
|

Stabilising terminal cost and terminal controller for ℓ<inf>asso</inf>-MPC: enhanced optimality and region of attraction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(14 citation statements)
references
References 0 publications
0
14
0
Order By: Relevance
“…However, MPC with a quadratic cost function will tend to lead to long periods of relatively low and continuous thrust, whereas for a system propelled by gas thrusters, a degree of sparsity in the control actions is preferable. Such behaviour can be achieved by combining the quadratic cost with an additional ℓ 1 term on the input, , informally dubbed as ℓ asso ‐MPC in homage to the least absolute shrinkage and selection operator used in regularised least‐squares regression. MPC with this class of cost function has been demonstrated for the terminal phases of spacecraft rendezvous in circular orbits in .…”
Section: Background and Design Motivationsmentioning
confidence: 99%
“…However, MPC with a quadratic cost function will tend to lead to long periods of relatively low and continuous thrust, whereas for a system propelled by gas thrusters, a degree of sparsity in the control actions is preferable. Such behaviour can be achieved by combining the quadratic cost with an additional ℓ 1 term on the input, , informally dubbed as ℓ asso ‐MPC in homage to the least absolute shrinkage and selection operator used in regularised least‐squares regression. MPC with this class of cost function has been demonstrated for the terminal phases of spacecraft rendezvous in circular orbits in .…”
Section: Background and Design Motivationsmentioning
confidence: 99%
“…The proposed selftriggered control law possesses three important features: (i) significant reductions in resource utilization are obtained, (ii) a priori closed-loop performance guarantees are provided (by design) in terms of the original cost function, next to asymptotic stability and constraint satisfaction, (iii) co-design of both the feedback law and triggering condition is achieved. To elaborate on these features, we emphasize that the proposed STC approach reduces resource utilization without modifying the cost function by input regularization or explicitly penalizing resource usage, thereby being essentially different from [3,[7][8][9][10]32]. This feature enables that the proposed STC strategy will not only realize stabilization towards a desired equilibrium, but it also provides a priori guarantees on an infinite horizon cost directly related to the MPC cost (feature (ii)).…”
Section: Introductionmentioning
confidence: 96%
“…The most well known approach is based on modifying the MPC problem by appending the original MPC control cost with an ℓ 1 penalty on the input in order to obtain sparse input signals. Regularizing by the ℓ 1 -norm is known to induce sparsity in the sense that, individual components of the input signal will be equal to zero, see, e.g., [3,[7][8][9], in which the focus is on discrete-time linear systems. Also different types of sum-of-norms regularization can be used to obtain so-called group sparsity, meaning that at many http://dx.doi.org/10.1016/j.sysconle.2015.03.003 0167-6911/© 2015 Elsevier B.V. All rights reserved.…”
Section: Introductionmentioning
confidence: 99%
“…However, explicitly including 0 -norm constraints in the control decision problem leads to an NP-hard combinatorial problem [15]. Mainly, three approaches have been proposed in optimal control problems to avoid the computational burden: i) a greedy algorithm known as Orthogonal Matching Pursuit (OMP) [5], ii) a 1 -norm relaxation [3], [16] and more recently iii) an algorithm based on coordinate descent type methods [17].…”
Section: Introductionmentioning
confidence: 99%
“…Works such as [4], [7], [16] and [5] have introduced sparsity constraints on the control inputs when dealing with model predictive control (MPC). While in [4], [7], [16] the authors also included extra convex constraints in the optimization problem, in [5] this issue is not clearly established. Still, neither of them consider 0 -norm restrictions to limit the number of active control actions at each control horizon instant.…”
Section: Introductionmentioning
confidence: 99%