LAUSR

This paper addresses the distributed optimization problem of discrete-time multiagent systems with nonconvex control input constraints and switching topologies. We introduce a novel distributed optimization algorithm with a switching mechanism to guarantee that all agents eventually converge to an optimal solution point, while their control inputs are constrained in their own nonconvex region. It is worth noting that the mechanism is performed to tackle the coexistence of the nonconvex constraint operator and the optimization gradient term. Based on the dynamic transformation technique, the original nonlinear dynamic system is transformed into an equivalent one with a nonlinear error term. By utilizing the nonnegative matrix theory, it is shown that the optimization problem can be solved when the union of switching communication graphs is jointly strongly connected. Finally, a numerical simulation example is used to demonstrate the acquired theoretical results.