TY - JOUR
T1 - Iterative distributed model predictive control for nonlinear systems with coupled non-convex constraints and costs
AU - Wu, Jinxian
AU - Dai, Li
AU - Xia, Yuanqing
N1 - Publisher Copyright:
© 2024 John Wiley & Sons Ltd.
PY - 2024
Y1 - 2024
N2 - This paper proposes a distributed model predictive control (DMPC) algorithm for dynamic decoupled discrete-time nonlinear systems subject to nonlinear (maybe non-convex) coupled constraints and costs. Solving the resulting nonlinear optimal control problem (OCP) using a DMPC algorithm that is fully distributed, termination-flexible, and recursively feasible for nonlinear systems with coupled constraints and costs remains an open problem. To address this, we propose a fully distributed and globally convergence-guaranteed framework called inexact distributed sequential quadratic programming (IDSQP) for solving the OCP at each time step. Specifically, the proposed IDSQP framework has the following advantages: (i) it uses a distributed dual fast gradient approach for solving inner quadratic programming problems, enabling fully distributed execution; (ii) it can handle the adverse effects of inexact (insufficient) calculation of each internal quadratic programming problem caused by early termination of iterations, thereby saving computational time; and (iii) it employs distributed globalization techniques to eliminate the need for an initial guess of the solution. Under reasonable assumptions, the proposed DMPC algorithm ensures the recursive feasibility and stability of the entire closed-loop system. We conduct simulation experiments on multi-agent formation control with non-convex collision avoidance constraints and compare the results against several benchmarks to verify the performance of the proposed DMPC method.
AB - This paper proposes a distributed model predictive control (DMPC) algorithm for dynamic decoupled discrete-time nonlinear systems subject to nonlinear (maybe non-convex) coupled constraints and costs. Solving the resulting nonlinear optimal control problem (OCP) using a DMPC algorithm that is fully distributed, termination-flexible, and recursively feasible for nonlinear systems with coupled constraints and costs remains an open problem. To address this, we propose a fully distributed and globally convergence-guaranteed framework called inexact distributed sequential quadratic programming (IDSQP) for solving the OCP at each time step. Specifically, the proposed IDSQP framework has the following advantages: (i) it uses a distributed dual fast gradient approach for solving inner quadratic programming problems, enabling fully distributed execution; (ii) it can handle the adverse effects of inexact (insufficient) calculation of each internal quadratic programming problem caused by early termination of iterations, thereby saving computational time; and (iii) it employs distributed globalization techniques to eliminate the need for an initial guess of the solution. Under reasonable assumptions, the proposed DMPC algorithm ensures the recursive feasibility and stability of the entire closed-loop system. We conduct simulation experiments on multi-agent formation control with non-convex collision avoidance constraints and compare the results against several benchmarks to verify the performance of the proposed DMPC method.
KW - distributed model predictive control
KW - non-convex constraints
KW - sequential quadratic programming
UR - http://www.scopus.com/inward/record.url?scp=85189895850&partnerID=8YFLogxK
U2 - 10.1002/rnc.7341
DO - 10.1002/rnc.7341
M3 - Article
AN - SCOPUS:85189895850
SN - 1049-8923
JO - International Journal of Robust and Nonlinear Control
JF - International Journal of Robust and Nonlinear Control
ER -