A distributed protocol for finite-time supremum or infimum dynamic consensus: the directed graph case

DOI10.1016/j.sysconle.2024.105754zbMATH Open1545.93573MaRDI QIDQ6569381

Martina Lippi, Antonio Furchì, Andrea Gasparri, Alessandro Marino

Publication date: 9 July 2024

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

distributed controlfinite-time convergencedynamic consensusdirected communicationsupremum and infimum tracking

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Multi-agent systems (93A16) Consensus (93D50)

Cites Work

• Unnamed Item
• Second-order min-consensus on switching topology
• Distributed algorithms for reaching consensus on general functions
• Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
• A calculus for computing Filippov's differential inclusion with application to the variable structure control of robot manipulators
• Lyapunov stability theory of nonsmooth systems
• Finite-Time Consensus Problems for Networks of Dynamic Agents
• Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
• On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus in Multi-Agent Systems With Coupling Delays and Switching Topology
• Discontinuous dynamical systems
• Measure Theory

This page was built for publication: A distributed protocol for finite-time supremum or infimum dynamic consensus: the directed graph case