.png){kind=icon}
.png){kind=icon}
Return
Asynchronous Push-Sum Dual Gradient Algorithm in Distributed Model Predictive Control
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2026.3652897.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article studies the distributed model predictive control (DMPC) problem for distributed discrete-time linear systems with both local and global constraints over directed communication networks. We establish an optimization problem to formulate the DMPC policy, including the design of terminal ingredients. To cope with the global constraint, we transform the primal optimization problem into its dual problem. Then, we propose a novel asynchronous push-sum dual gradient (APDG) algorithm with an adaptive step-size scheme to solve this dual problem in a fully asynchronous distributed manner. The proposed algorithm does not require synchronous waiting and any form of coordination, which greatly improves solving efficiency. We prove that the APDG algorithm converges at an $\mathit {R}$-linear rate as long as the step-size does not exceed the designed upper bound. Furthermore, we develop a distributed termination criterion to terminate the APDG algorithm when its output solution satisfies the specified suboptimality and the global constraint, thereby avoiding an infinite number of iterations. The recursive feasibility and the stability of the closed-loop system are also established. Finally, a numerical example is provided to clarify and validate our theoretical findings.
Keywords:
$\mathit {R}$ -linear convergence rate
adaptive step-size scheme
asynchronous push-sum dual gradient (APDG) algorithm
distributed model predictive control (DMPC)
distributed termination criterion
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W