Stochastic and deterministic fault detection for randomized gossip algorithms

DOI10.1016/j.automatica.2016.12.011zbMath1357.93108OpenAlexW2580804901MaRDI QIDQ518288

João P. Hespanha, Paulo Rosa, Carlos Silvestre, Daniel A. M. M. Silvestre

Publication date: 28 March 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11144/3425

zbMATH Keywords

fault detectiondecentralizationrandomized methodsestimation theorylinear parametrically varying (LPV) methodologiescomputer networks

Mathematics Subject Classification ID

Decentralized systems (93A14) Observability (93B07)

Related Items

Node and network resistance to bribery in multi-agent systems ⋮ A microscopic-view infection model based on linear systems ⋮ Set-valued estimators for uncertain linear parameter-varying systems ⋮ Fault detection for LPV systems using set-valued observers: a coprime factorization approach ⋮ Secure gossip against intermittently malicious agents ⋮ The robust minimal controllability and observability problem ⋮ Distinguishability of discrete‐time linear systems ⋮ Set-based guaranteed active fault diagnosis for LPV systems with unknown bounded uncertainties ⋮ Fault Detection for Discrete‐Time Uncertain Systems with Polytopic Uncertainties: A Markov Approach ⋮ Gossip algorithm for multi-agent systems via random walk ⋮ Self-triggered and event-triggered set-valued observers ⋮ Resilient multi-dimensional consensus in adversarial environment ⋮ General resilient consensus algorithms

Uses Software

• FITBOX

Cites Work

• Unnamed Item
• Fault tolerant control allocation using unknown input observers
• Guaranteed state estimation by zonotopes
• Minimal representation of convex polyhedral sets
• Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
• Fault detection for LPV systems using set-valued observers: a coprime factorization approach
• On-line fault detection and isolation for linear discrete-time uncertain systems
• Robust Fault Estimation Using Relative Information in Linear Multi-Agent Networks
• Computation of minimum-time feedback control laws for discrete-time systems with state-control constraints
• Identifiability of linear and nonlinear dynamical systems
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• Set-valued observers and optimal disturbance rejection
• Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
• Consensus Computation in Unreliable Networks: A System Theoretic Approach