(644e) Efficient Coordination of Plantwide Distributed MPC: The Lyapunov Envelope Algorithm
AIChE Annual Meeting
2021
2021 Annual Meeting
Computing and Systems Technology Division
Predictive Control and Optimization
Thursday, November 11, 2021 - 4:46pm to 5:05pm
To overcome this limitation, in this work, we propose a Lyapunov envelope algorithm that is real-time implementable under tight computational time restrictions without sacrificing the closed-loop stability under distributed MPC. Specifically, in the proposed algorithm:
- The interconnecting relations among the subsystems in the predicted horizon are not required to be satisfied exactly but only considered as soft constraints, i.e., the violations to these equalities are penalized in the objective function. Under this penalization, a primal iterative algorithm analogous to forward-backward splitting [4] is adopted and allowed to be early-terminated before full convergence. The violations to the interconnecting relations are regarded as perturbations.
- The effect of perturbations originating from the early-terminated algorithm on the closed-loop stability of the entire system, as characterized by the Lyapunov function value difference between the realized and the predicted trajectories, is analyzed based on incremental dissipativity of the interconnected subsystems. Such a dissipativity analysis establishes that the objective function with penalty, under proper assumptions, acts as a plantwide Lyapunov function, called the Lyapunov envelope.
- An arbitrary number of iterations result in a monotonically decreasing Lyapunov envelope, hence maintaining the closed-loop stability of the plantwide process. Naturally, larger numbers of iterations allow larger decrease and thus improve the resulting control performance.
We apply the Lyapunov envelope to the distributed MPC of a plantwide benchmark process, namely the vinyl acetate monomer plant [5], whose optimal control problems at each sampling time have numbers of variables and constraints on the order of 104. Our simulation studies demonstrate a significant improvement of computational performance and real-time implementability compared to centralized MPC. To our best knowledge, there has not been any other work to apply distributed MPC on a comparable scale.
References
[1] Christofides, P. D., et al. (2013). Distributed model predictive control: A tutorial review and future research directions. Comput. Chem. Eng., 51, 21-41.
[2] Daoutidis, P., et al. (2019). Optimal decomposition of control and optimization problems by network structure: Concepts, methods and inspirations from biology. AIChE J., 65(10), e16708.
[3] Tang, W., & Daoutidis, P. (2021). Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm. Optim. Eng., doi:10.1007/s11081-020-09585-w
[4] Chen, G. H., & Rockafellar, R. T. (1997). Convergence rates in forward-backward splitting. SIAM J. Optim., 7(2), 421-444.
[5] Chen, R., Dave, K., McAvoy, T. J., & Luyben, M. (2003). A nonlinear dynamic model of a vinyl acetate process. Ind. Eng. Chem. Res., 42(20), 4478-4487.