Distributed Fault Detection and Accommodation in Dynamic Average Consensus
classification
🧮 math.OC
math.DS
keywords
consensusfaultaveragedetectionaccommodationagentsalgorithmscommunication
read the original abstract
This paper presents the formulation of fault detection and accommodation schemes for a network of autonomous agents running internal model-based dynamic average consensus algorithms. We focus on two types of consensus algorithms, one that is internally stable but non-robust to initial conditions and one that is robust to initial conditions but not internally stable. For each consensus algorithm, a fault detection filter based on the unknown input observer scheme is developed for precisely estimating the communication faults that occur on the network edges. We then propose a fault remediation scheme so that the agents could reach average consensus even in the presence of communication faults.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.