The input aggregation strategy can reduce the online computational burden of the model predictive controller. But generally aggregation based MPC controller may lead to poor control quality. Therefore, a new concept, equivalent aggregation, is proposed to guarantee the control quality of aggregation based MPC. From the general framework of input linear aggregation, the design methods of equivalent aggre- gation are developed for unconstrained and terminal zero constrained MPC, which guarantee the actual control inputs exactly to be equal to that of the original MPC. For constrained MPC, quasi-equivalent aggregation strategies are also discussed, aiming to make the difference between the control inputs of aggregation based MPC and original MPC as small as possible. The stability conditions are given for the quasi-equivalent aggregation based MPC as well.
This paper presents a Lyapunov-based approach to design the boundary feedback control for an open-channel network composed of a cascade of multi-reach canals, each described by a pair of Saint-Venant equations. The weighted sum of entropies of the multi-reaches is adopted to construct the Lyapunov function. The time derivative of the Lyapunov function is expressed by the water depth variations at the gate boundaries, based on which a class of boundary feedback controllers is presented to guarantee the local asymptotic closed-loop stability. The advantage of this approach is that only the water level depths at the gate boundaries are measured as the feedback.
By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.
