Discrete-Time Distributed Optimal Formation Algorithms for Multiagent Systems With Nonlinear Inequality Constraints
- 31 December 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (2) , 1249-1261
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.Keywords
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:
- A projection-based algorithm for optimal formation and optimal matching of multi-robot systemNonlinear Dynamics, 2021
- Modified Hungarian method for unbalanced assignment problem with multiple jobsApplied Mathematics and Computation, 2019
- A decentralized approach to multi-agent MILPs: Finite-time feasibility and performance guaranteesAutomatica, 2019
- Optimal role and position assignment in multi-robot freely reachable formationsAutomatica, 2017
- Time-varying formation control for general linear multi-agent systems with switching directed topologiesAutomatica, 2016
- Consensus and formation control on for switching topologiesAutomatica, 2016
- A survey of multi-agent formation controlAutomatica, 2015
- Formation control of VTOL Unmanned Aerial Vehicles with communication delaysAutomatica, 2011
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955