Distributed Finite-time Differentiator for Multi-agent Systems Under Directed Graph
Weile Chen, Haibo Du, Shihua Li
TL;DR
This work addresses distributed finite-time differentiation in multi-agent systems over directed graphs by introducing two variants of a distributed finite-time differentiator (DFD): one that uses relative position information and another that uses absolute position information. The authors prove finite-time stability via Lyapunov analysis and extend the differentiator to a continuous finite-time consensus controller for leader-follower MAS, achieving robust, chattering-free output consensus under disturbances. Through simulations, they demonstrate finite-time convergence of both the estimated leader signals and the follower outputs, validating the effectiveness of the DFD framework and the continuous controller. The contributions enable accurate distributed state estimation and finite-time synchronization in networks where global measurements or velocity sensing are unavailable, with potential applications in formation control and cooperative robotics.
Abstract
This paper proposes a new distributed finite-time differentiator (DFD) for multi-agent systems (MAS) under directed graph, which extends the differentiator algorithm from the centralized case to the distributed case by only using relative/absolute position information. By skillfully constructing a Lyapunov function, the finite-time stability of the closed-loop system under DFD is proved. Inspired by the duality principle of control theory, a distributed continuous finite-time output consensus algorithm extended from DFD for a class of leader-follower MAS is provided, which not only completely suppresses disturbance, but also avoids chattering. Finally, several simulation examples are given to verify the effectiveness of the DFD.
