Adaptive consensus for heterogeneous multi-agent systems under sensor and actuator attacks

M Meng, G **ao, B Li - Automatica, 2020 - Elsevier
This study investigates the leader-following consensus problem for heterogeneous multi-
agent systems subject to both sensor and actuator attacks. The attacks considered in this …

Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems

M Doostmohammadian, H Zarrabi… - International Journal of …, 2023 - Taylor & Francis
This paper considers model-based fault detection of large-scale (possibly rank-deficient)
dynamic systems. Assuming only global (and not local) observability over a sensor network …

The online submodular cover problem

A Gupta, R Levin - Proceedings of the Fourteenth Annual ACM-SIAM …, 2020 - SIAM
In the submodular cover problem, we are given a monotone submodular function f: 2 N→
ℝ+, and we want to pick the min-cost set S such that f (S)= f (N). This captures the set cover …

Feedback through graph motifs relates structure and function in complex networks

Y Hu, SL Brunton, N Cain, S Mihalas, JN Kutz… - Physical Review E, 2018 - APS
In physics, biology, and engineering, network systems abound. How does the connectivity of
a network system combine with the behavior of its individual components to determine its …

Directed-graph-learning-based diagnosis of multiple faults for high speed train with switched dynamics

K Zhang, B Jiang, F Chen… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
This article addresses the distributed multiple fault isolation, modeling, and the closed-loop
fault estimation under asynchronous switching for high speed train (HST) with switched …

Fully-dynamic submodular cover with bounded recourse

A Gupta, R Levin - 2020 IEEE 61st Annual Symposium on …, 2020 - ieeexplore.ieee.org
In submodular covering problems, we are given a monotone, nonnegative submodular
function f: 2 N→ R+ and wish to find the min-cost set S⊆ N such that f (S)= f (N). When f is a …

Indiscernible topological variations in DAE networks

D Patil, P Tesi, S Trenn - Automatica, 2019 - Elsevier
A problem of characterizing conditions under which a topological change in a network of
differential–algebraic equations (DAEs) can go undetected is considered. It is shown that …

Discernibility of topological variations for networked LTI systems

Y Hao, Q Wang, Z Duan, G Chen - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
In this article, the discernibility of topological variations for networked linear time-invariant
(LTI) systems is investigated, where the network topology is general, and the nodes have …

On the effects of communication failures in a multi-agent consensus network

ME Valcher, G Parlangeli - 2019 23rd International Conference …, 2019 - ieeexplore.ieee.org
This paper investigates the effects of either an edge or a node disconnection on a multi-
agent consensus network, consisting of N agents that are modeled as simple scalar and …

Generic detectability and isolability of topology failures in networked linear systems

Y Zhang, Y **a, J Zhang, J Shang - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
This article studies the possibility of detecting and isolating topology failures (including link
and node failures) of a networked system from subsystem measurements, in which …