Resilient consensus of second-order agent networks: Asynchronous update rules with delays
Reads0
Chats0
TLDR
In this article, the authors studied the problem of resilient consensus of sampled-data multi-agent networks with double-integrator dynamics, where each normal agent ignores large and small state values among its neighbors to avoid being influenced by malicious agents.About:
This article is published in Automatica.The article was published on 2017-07-01 and is currently open access. It has received 180 citations till now.read more
Citations
More filters
Journal ArticleDOI
A Systems and Control Perspective of CPS Security
Seyed Mehran Dibaji,Mohammad Pirani,David Bezalel Flamholz,Anuradha M. Annaswamy,Karl Henrik Johansson,Aranya Chakrabortty +5 more
TL;DR: A survey of systems and control methods proposed for the security of Cyber-Physical Systems, a field that has recently garnered increased attention, classifies these methods into three categories based on the type of defense proposed against the cyberattacks: prevention, resilience, and detection & isolation.
Journal ArticleDOI
Resilient Consensus of Discrete-Time Complex Cyber-Physical Networks Under Deception Attacks
TL;DR: This article considers the resilient consensus problems of discrete-time complex cyber-physical networks under $F$-local deception attacks and generalizes the notion of network robustness and presents the necessary and sufficient condition for the achievement of resilient consensus in the presence of trusted edges.
Journal ArticleDOI
Fault-Tolerant Clock Synchronization Over Unreliable Channels in Wireless Sensor Networks
TL;DR: This paper proposes a resilient consensus-type algorithm based on the so-called mean subsequence reduced (MSR) technique, where each normal node ignores the outliers in the clock data collected from its neighbors and makes updates using data from the past if new data have not arrived yet.
Journal ArticleDOI
Cooperative control of quadrotors and mobile robots: controller design and experiments
TL;DR: This thesis aims to solve problems in the consensus control of multiple quadrotors and/or mobile robots considering irregular sampling controls, heterogeneous agent dynamics and the presence of model uncertainties and disturbances.
Journal ArticleDOI
Resilient distributed state estimation with mobile agents: overcoming Byzantine adversaries, communication losses, and intermittent measurements
TL;DR: The main contribution of this paper is the development of resilient, fully-distributed, and provably correct state estimation algorithms that simultaneously account for each of the above considerations, and offer a general framework for reasoning about state estimation problems in dynamic, failure-prone and adversarial environments.
References
More filters
Book
Parallel and Distributed Computation: Numerical Methods
TL;DR: This work discusses parallel and distributed architectures, complexity measures, and communication and synchronization issues, and it presents both Jacobi and Gauss-Seidel iterations, which serve as algorithms of reference for many of the computational approaches addressed later.
Book
Randomized Algorithms
TL;DR: This book introduces the basic concepts in the design and analysis of randomized algorithms and presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications.
Book
Distributed algorithms
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Journal ArticleDOI
On Consensus Algorithms for Double-Integrator Dynamics
TL;DR: This note shows that consensus is reached asymptotically for the first two cases if the undirected interaction graph is connected and for the third case if the directed interaction graph has a directed spanning tree and the gain for velocity matching with the group reference velocity is above a certain bound.