Abstract
This article studies the distributed optimal formation problems for multiagent systems subject to nonlinear inequality constraints. This problem can be formulated into a nonlinear mixed-integer programming (NMIP) problem. We first decompose the NMIP problem into a formation optimal matching problem, which is actually an integer linear programming (ILP) problem, and an optimal formation reference center problem described as a constrained quadratic optimization problem. Subsequently, we develop a discrete-time perturbation-based distributed dual consensus ADMM (PDC-ADMM) algorithm, which achieves an optimal integer solution to the ILP problem and eliminates the unmatched phenomenon. In addition, we propose a distributed optimistic gradient descent ascent (D-OGDA) algorithm with a constant step size, which guarantees exact convergence to the optimal formation reference center. Finally, three simulation examples are carried out to demonstrate the effectiveness of the developed algorithms.
Funding Information
  • National Natural Science Foundation of China (62522306)
  • National Natural Science Foundation of China (62473048)
  • National Natural Science Foundation of China (62495093)
  • National Natural Science Foundation of China (62495090)
  • National Natural Science Foundation of China (62495095)
  • State Key Laboratory of Autonomous Intelligent Unmanned Systems (ZZKF2025ZD-2-2)

This publication has 41 references indexed in Scilit: