Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey

DOI10.1016/j.automatica.2023.111264zbMath1522.93017arXiv2205.12498OpenAlexW4386435322MaRDI QIDQ6073106

Mohammad Pirani, Shreyas Sundaram, Aritra Mitra

Publication date: 15 September 2023

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.12498

zbMATH Keywords

graph theorydistributed control systemsresilient distributed algorithms

Mathematics Subject Classification ID

Applications of graph theory (05C90) Sensitivity (robustness) (93B35) Decentralized systems (93A14) Networked control (93B70)

Cites Work

• Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
• Kalman Filtering With Intermittent Observations
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• A Generalization of Radon's Theorem
• Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
• Consensus Computation in Unreliable Networks: A System Theoretic Approach
• Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
• Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems
• Attack Detection and Identification in Cyber-Physical Systems
• Controllability Metrics, Limitations and Algorithms for Complex Networks
• Minimal Controllability Problems
• The Price of Synchrony: Evaluating the Resistive Losses in Synchronizing Power Networks
• A Notion of Robustness in Complex Networks
• On Submodularity and Controllability in Complex Dynamical Networks
• Joint Centrality Distinguishes Optimal Leaders in Noisy Networks
• Minimizing Effective Resistance of a Graph
• A Counterexample in Stochastic Optimum Control
• The 1972 Wald Lecture Robust Statistics: A Review
• Completely Decentralized Design of Distributed Observer for Linear Systems
• A Unifying Framework for Strong Structural Controllability
• Fault-Tolerance in Distributed Optimization: The Case of Redundancy
• Approximating Tverberg points in linear time for any fixed dimension
• Algebraic Codes for Data Transmission
• Stabilization and \(H^{\infty}\) control of symmetric systems: An explicit solution
• Distributed State Estimation Over Time-Varying Graphs: Exploiting the Age-of-Information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Bayesian social learning
• Synchronization in complex networks of phase oscillators: a survey
• Social learning with time-varying weights
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
• Distributed robust filtering with \(H_\infty\) consensus of estimates
• Consensus in distributed estimation with inconsistent beliefs
• On the complexity of the constrained input selection problem for structural linear systems
• Submodularity in dynamics and control of networked systems. With a foreword by John Baillieul
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks
• Fast projection methods for minimal design problems in linear system theory
• Generic properties and control of linear structured systems: A survey
• Spectral and structural properties of random interdependent networks
• Distributed estimation based on multi-hop subspace decomposition
• Detection and mitigation of biasing attacks on distributed estimation networks
• Selective strong structural minimum-cost resilient co-design for regular descriptor linear systems
• Networked control systems.
• An overview of structural systems theory
• Defending non-Bayesian learning against adversarial attacks
• Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
• The robust minimal controllability problem
• Resilient consensus of second-order agent networks: asynchronous update rules with delays
• Load balancing of dynamical distribution networks with flow constraints and unknown in/outflows
• An extension of Radon's theorem
• Byzantine-resilient distributed state estimation: a min-switching approach
• Stability and robustness of large platoons of vehicles with double-integrator models and nearest neighbor interaction
• Game theory meets network security and privacy
• Iterative approximate byzantine consensus in arbitrary directed graphs
• Graph Distances and Controllability of Networks
• Distributed Detection: Finite-Time Analysis and Impact of Network Topology
• A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
• A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
• On the Smallest Eigenvalue of Grounded Laplacian Matrices
• Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
• Differentially Private Filtering
• Consensus in networked multi-agent systems with adversaries
• Design of Distributed LTI Observers for State Omniscience
• Emergence of Scaling in Random Networks
• Resilient Distributed Field Estimation
• Analytical redundancy and the design of robust failure detection systems
• Secure Control Systems: A Quantitative Risk Management Approach
• Game-Theoretic Methods for Robustness, Security, and Resilience of Cyberphysical Control Systems: Games-in-Games Principle for Optimal Cross-Layer Resilient Control Systems
• Differential Privacy: A Survey of Results
• A proof of alon's second eigenvalue conjecture
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Asymptotic agreement in distributed estimation
• Perfectly secure message transmission
• Survey of decentralized control methods for large scale systems
• Full-order observers for linear systems with unknown inputs
• Conflict resolution for air traffic management: a study in multiagent hybrid systems
• A geometric approach to nonlinear fault detection and isolation
• Distributed Observers for LTI Systems
• Fast Convergence Rates for Distributed Non-Bayesian Learning
• Optimal Placement of Virtual Inertia in Power Grids
• Control Barrier Function Based Quadratic Programs for Safety Critical Systems
• Consensus and Cooperation in Networked Multi-Agent Systems
• A Simple Approach to Distributed Observer Design for Linear Systems
• Resilient Distributed Estimation Through Adversary Detection
• A Theory of Non-Bayesian Social Learning
• Distributed Optimization Under Adversarial Nodes
• On (Non)Supermodularity of Average Control Energy
• Robustness of Leader–Follower Networked Dynamical Systems
• Improving Network Connectivity and Robustness Using Trusted Nodes With Application to Resilient Consensus
• Game Theory in Wireless and Communication Networks
• A Distributed Observer for a Time-Invariant Linear System
• On the Structural and Strong Structural Controllability of Undirected Networks
• Resilient Randomized Quantized Consensus
• Social Learning and Distributed Hypothesis Testing
• Failure detection and identification
• Paths in graphs
• On the Laplacian Eigenvalues of Signed Graphs
• A Game-Theoretic Framework for Network Security Vulnerability Assessment and Mitigation
• The Generic Number of Invariant Zeros of a Structured Linear System
• A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine Resilience
• Distributed $H_\infty$ Estimation Resilient to Biasing Attacks
• Distributed Subgradient Methods for Multi-Agent Optimization
• On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
• Byzantine-Resilient Multiagent Optimization
• Network Inspection for Detecting Strategic Attacks
• How to Secure Distributed Filters Under Sensor Attacks
• Byzantine-Resilient Distributed Hypothesis Testing With Time-Varying Network Topology
• A Game-Theoretic Framework for Security-Aware Sensor Placement Problem in Networked Control Systems
• Byzantine-Resilient Decentralized Policy Evaluation With Linear Function Approximation
• Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms
• Finite-Time Guarantees for Byzantine-Resilient Distributed State Estimation With Noisy Measurements
• Byzantine vector consensus in complete graphs
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Resilient Distributed Estimation: Sensor Attacks
• On Fundamental Limitations of Dynamic Feedback Control in Regular Large-Scale Networks
• Resilient Distributed Parameter Estimation With Heterogeneous Data
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Stability analysis of swarms

This page was built for publication: Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey