A distributed protocol for finite-time supremum or infimum dynamic consensus: the directed graph case
From MaRDI portal
Publication:6569381
Recommendations
- Discrete-Time Dynamic Consensus on the Max Value
- Finite-time consensus in directed switching network topologies and time-delayed communications
- Discrete-time consensus filters for average tracking of time-varying inputs on directed switching graphs
- Dynamic average consensus via nonlinear protocols
- Finite-time distributed consensus via binary control protocols
Cites work
- A calculus for computing Filippov's differential inclusion with application to the variable structure control of robot manipulators
- 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
- Distributed algorithms for reaching consensus on general functions
- Finite-Time Consensus Problems for Networks of Dynamic Agents
- Lyapunov stability theory of nonsmooth systems
- Measure theory
- Measure theory. Vol. I and II
- On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
- Second-order min-consensus on switching topology
- Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
- Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
This page was built for publication: A distributed protocol for finite-time supremum or infimum dynamic consensus: the directed graph case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569381)
