Abstract | ||
---|---|---|
In this paper we present a new method to reduce the computational complexity of model predictive control algorithms with online optimization. The formulation of the predictive equations is performed in the continuous-time domain, while the control inputs are parametrized as piecewise constant functions, with less steps than the control horizon. The continuous-time formulation permits the arbitrary choice of the prediction and control time-instants, disregarding the sampling period of the system, and this improves the goodness of the approximation. Moreover, since the inputs are forced to be piecewise constant, the resulting controller can be directly implemented in discretetime. A tuning method for the choice of the prediction and control instants is proposed, minimizing the deviation with respect to the non-approximated controller. Numerical results show the effectiveness of this strategy against other methods with same reduction of computational complexity. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1109/ETFA.2017.8247632 | 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) |
Keywords | Field | DocType |
model predictive control algorithms,online optimization,predictive equations,continuous-time domain,piecewise constant functions,control horizon,continuous-time formulation,control time-instants,tuning method,nonapproximated controller,computational complexity,staircase parametrization,Continuous input blocking | Control theory,Parametrization,Control theory,Horizon,Model predictive control,Sampling (signal processing),Constant function,Control engineering,Engineering,Piecewise,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1946-0740 | 978-1-5090-6506-6 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Marco Faroni | 1 | 3 | 1.78 |
Manuel Beschi | 2 | 25 | 10.40 |
Manuel Berenguel | 3 | 98 | 21.50 |
Antonio Visioli | 4 | 224 | 40.89 |