SwePub - sökning: WFRF:(Holaza Juraj)

Numrering	Referens	Omslagsbild	Hitta
1.	Bakarac, Peter, et al. (författare) Explicit MPC Based on Approximate Dynamic Programming 2018 Ingår i: 2018 EUROPEAN CONTROL CONFERENCE (ECC). - 9783952426982 - 9781538653036 Konferensbidrag (refereegranskat)abstract In this paper we show how to synthesize simple explicit MPC controllers based on approximate dynamic programming. Here, a given MPC optimization problem over a finite horizon is solved iteratively as a series of problems of size one. The optimal cost function of each subproblem is approximated by a quadratic function that serves as a cost-to-go function for the subsequent iteration. The approximation is designed in such a way that closed-loop stability and recursive feasibility is maintained. Specifically, we show how to employ sum-of-squares relaxations to enforce that the approximate cost-to-go function is bounded from below and from above for all points of its domain. By resorting to quadratic approximations, the complexity of the resulting explicit MPC controller is considerably reduced both in terms of memory as well as the on-line computations. The procedure is applied to control an inverted pendulum and experimental data are presented to demonstrate viability of such an approach.

Bakarac, Peter, et al. (författare)
Explicit MPC Based on Approximate Dynamic Programming
2018
Ingår i: 2018 EUROPEAN CONTROL CONFERENCE (ECC). - 9783952426982 - 9781538653036
Konferensbidrag (refereegranskat)abstract
- In this paper we show how to synthesize simple explicit MPC controllers based on approximate dynamic programming. Here, a given MPC optimization problem over a finite horizon is solved iteratively as a series of problems of size one. The optimal cost function of each subproblem is approximated by a quadratic function that serves as a cost-to-go function for the subsequent iteration. The approximation is designed in such a way that closed-loop stability and recursive feasibility is maintained. Specifically, we show how to employ sum-of-squares relaxations to enforce that the approximate cost-to-go function is bounded from below and from above for all points of its domain. By resorting to quadratic approximations, the complexity of the resulting explicit MPC controller is considerably reduced both in terms of memory as well as the on-line computations. The procedure is applied to control an inverted pendulum and experimental data are presented to demonstrate viability of such an approach.

Träfflista för sökning "WFRF:(Holaza Juraj) "