Abstract

This paper presents a novel distributed zero-gradient-sum algorithm for addressing the formation control problem by minimizing the sum of strongly convex functions under switching topologies in first-order multi-agent systems. The main contribution of this work is the development of a two-step controller that allows agents to achieve leaderless formation and reach the global function's minimizer within a predefined time while maintaining the privacy of local objective functions, gradients and Hessians. The proposed algorithm exhibits a unique combination of features, including predefined-time stability, applicability to multi-valued strongly-convex functions, independence from initial conditions and adaptability to switching topologies without the need to know the number of agents. Furthermore, the algorithm avoids the use of auxiliary variables and time-variable gains. This work also provides numerical simulations to demonstrate the effectiveness and validity of the proposed algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call