We address the problem of reaching resilient consensus among a set of agents in the
presence of faulty nodes (attacked or noisy). We propose general algorithms, ie, receiving …

This paper addresses the problem of detecting faults in linear randomized gossip
algorithms, where the selection of the dynamics matrix is stochastic. A fault is a disturbance …

There has been a vast body of research on set-membership techniques in recent years.
These algorithms compute convex sets that contain the state of a dynamical system given …

This paper considers the multi-dimensional consensus in networked systems, where some
of the agents might be misbehaving (or faulty). Despite the influence of these misbehaviors …

In this paper, we approach the problem of a set of network agents reaching resilient
consensus in the presence of a subset of attacked nodes. We devise a generalized method …

In this article, a recursive set-membership filtering algorithm for discrete-time nonlinear
dynamical systems subject to unknown but bounded process and measurement noises is …

This paper addresses the problem of reducing the required network load and computational
power for the implementation of Set-Valued Observers (SVOs) in Networked Control System …

This paper addresses the problem of fault detection for linear parameter-varying systems in
the presence of measurement noise and exogenous disturbances using Set-Valued …

We tackle the problem of a set of agents achieving resilient consensus in the presence of
attacked agents. We present a discrete-time reputation-based consensus algorithm for …

This paper addresses the problem of consensus in the presence of Byzantine faults,
modeled by an attacker injecting a perturbation in the state of the nodes of a network. It is …