2017 IEEE 56th Annual Conference on Decision and Control (CDC) 2017
DOI: 10.1109/cdc.2017.8264394
|View full text |Cite
|
Sign up to set email alerts
|

Control of nonlinear systems with explicit-MPC-like controllers

Abstract: Abstract-This paper describes synthesis of controllers involving Quadratic Programming (QP) optimization problems for control of nonlinear systems. The QP structure allows an implementation of the controller as a piecewise affine function, pre-computed offline, which is a technique extensively studied in the field of explicit model predictive control (EMPC). The method is based on a sum-of-squares (SOS) stability verification for polynomial discrete-time systems, described in continuous-time in this paper. The… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…where J * N →N (x) = x x, and J * k→N (•) is the optimal cost-togo of the step k, and (19a) denotes the Euler discretization of ( 18), and T s is the sampling time, and X k+1→N is the (N −k−1)-step stabilizable set. The quadratic cost function in (19) selects controllers that result in fast convergence by not penalizing u(x), making it competitive to CPA designs of this paper. To compute approximations of {X k→N } N −1 k=0 and {J * k→N (•)} N −1 k=0 , a uniform grid for the state-space with step size δx (1) = δx (2) is assumed.…”
Section: A Controllersmentioning
confidence: 99%
See 2 more Smart Citations
“…where J * N →N (x) = x x, and J * k→N (•) is the optimal cost-togo of the step k, and (19a) denotes the Euler discretization of ( 18), and T s is the sampling time, and X k+1→N is the (N −k−1)-step stabilizable set. The quadratic cost function in (19) selects controllers that result in fast convergence by not penalizing u(x), making it competitive to CPA designs of this paper. To compute approximations of {X k→N } N −1 k=0 and {J * k→N (•)} N −1 k=0 , a uniform grid for the state-space with step size δx (1) = δx (2) is assumed.…”
Section: A Controllersmentioning
confidence: 99%
“…Thus at each grid point, a feasibility problem with linear constraints is formulated for each k ∈ Z N −1 k=0 . Then, (19) is solved backwards at the grid points inside the stabilizable sets given J * N →N (x) and using interpolation to evaluate optimal cost-to-goes.…”
Section: A Controllersmentioning
confidence: 99%
See 1 more Smart Citation
“…In this case, the corresponding Lipschitz CLF is used to formulate a minimumnorm controller by QP. In seeking both the controller and the Lyapunov function offline, this method is similar to [16], but it is not limited to polynomial systems. Like [10], the method depends on refining elements in a subset of the state space, but it avoids solving the highly nonlinear optimization.…”
Section: Introductionmentioning
confidence: 99%
“…For linear cases, since there is a structure to be exploited that results in less computational load, MPC is especially preferred. However, depending on the availability of computation power and the importance of the application, MPC is also deployed in many nonlinear systems [15,16]. Using MPC-based methods, it is also possible to address some specific controllability and observability problems for LTI or nonlinear systems.…”
Section: Introductionmentioning
confidence: 99%