Distributed Finite-time Differentiator for Multi-agent Systems Under Directed Graph

Weile Chen, Haibo Du, Shihua Li
2/26/2024
cs.MA

No confident code implementation found for this paper. 1 possible match can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chen2024distributed,
  title  = {Distributed Finite-time Differentiator for Multi-agent Systems Under Directed Graph},
  author = {Weile Chen and Haibo Du and Shihua Li},
  year   = {2024},
  eprint = {2402.16260},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.16260v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.16260.svg)](https://codeofpaper.com/paper/2402.16260)

Discussion