A generalized distributed accelerated gradient method for distributed model predictive control with iteration complexity bounds

Author(s):  
Pontus Giselsson
2020 ◽  
Vol 42 (15) ◽  
pp. 2929-2940 ◽  
Author(s):  
Dine El Houda Hammami ◽  
Saber Maraoui ◽  
Kais Bouzrara

This paper proposes a dual decomposition method for solving distributed model predictive control. This controller is designed for systems subject to communication constraints, in which nonlinear subsystems interconnected via dynamics and by constraints. The interconnections are relaxed by using gradient method, accelerated gradient and alternating direction methods of multipliers. Also, an event-based communication is proposed to handle the issue of communication constraints especially in embedded systems. In the proposed event-based communication strategy, each controller solves the optimization problem and communicate only if the prices are updated significantly, which can reduce the computation load and release the burden of the network while achieving global performance. Finally, the simulations study of the four-tank benchmark is presented to demonstrate the effectiveness of the proposed schemes.


Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4041
Author(s):  
Anca Maxim ◽  
Constantin-Florin Caruntu

Following the current technological development and informational advancement, more and more physical systems have become interconnected and linked via communication networks. The objective of this work is the development of a Coalitional Distributed Model Predictive Control (C- DMPC) strategy suitable for controlling cyber-physical, multi-agent systems. The motivation behind this endeavour is to design a novel algorithm with a flexible control architecture by combining the advantages of classical DMPC with Coalitional MPC. The simulation results were achieved using a test scenario composed of four dynamically coupled sub-systems, connected through an unidirectional communication topology. The obtained results illustrate that, when the feasibility of the local optimization problem is lost, forming a coalition between neighbouring agents solves this shortcoming and maintains the functionality of the entire system. These findings successfully prove the efficiency and performance of the proposed coalitional DMPC method.


Sign in / Sign up

Export Citation Format

Share Document