Decompositions for mpc of linear dynamic systems with activation constraints

2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

The interconnection of dynamic subsystems that share limited resources are found in many applications, and the control of such systems of subsystems has fueled significant attention from scientists and engineers. For the operation of such systems, model predictive control (MPC) has become a popular technique, arguably for its ability to deal with complex dynamics and system constraints. The MPC algorithms found in the literature are mostly centralized, with a single controller receiving the signals and performing the computations of output signals. However, the distributed structure of such interconnected subsystems is not necessarily explored by standard MPC. To this end, this work proposes hierarchical decomposition to split the computations between a master problem (centralized component) and a set of decoupled subproblems (distributed components) with activation constraints, which brings about organizational flexibility and distributed computation. Two general methods are considered for hierarchical control and optimization, namely Benders decomposition and outer approximation. Results are reported from a numerical analysis of the decompositions and a simulated application to energy management, in which a limited source of energy is distributed among batteries of electric vehicles.

Cite

CITATION STYLE

APA

da Silva, P. H. V. B., Camponogara, E., Seman, L. O., González, G. V., & Leithardt, V. R. Q. (2020). Decompositions for mpc of linear dynamic systems with activation constraints. Energies, 13(21). https://doi.org/10.3390/en13215744

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free