Related papers: Resilient Consensus Against Mobile Malicious Agent…
We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a malicious agent that moves…
Adversarial machine learning challenges the assumption that the underlying distribution remains consistent throughout the training and implementation of a prediction model. In particular, adversarial evasion considers scenarios where…
We provide a protocol for real-valued average consensus by networks of agents which exchange only a single message from the ternary alphabet {-1,0,1} between neighbors at each step. Our protocol works on time-varying undirected graphs…
In this paper, we first address adverse effects of cyber-physical attacks on distributed synchronization of multi-agent systems, by providing conditions under which an attacker can destabilize the underlying network, as well as another set…
In multiple domains such as malware detection, automated driving systems, or fraud detection, classification algorithms are susceptible to being attacked by malicious agents willing to perturb the value of instance covariates to pursue…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
This paper studies distributed resilient consensus problem for a class of uncertain nonlinear multiagent systems susceptible to deception attacks. The attacks invade both sensor and actuator channels of each agent. A specific class of…
This paper proposes a distributed algorithm for average consensus in a multi-agent system under a fixed bidirectional communication topology, in the presence of malicious agents (nodes) that may try to influence the average consensus…
This paper proposes a new approach to analyze and synthesize robust consensus control laws for general linear leaderless multi-agent systems (MASs) subjected to input constraints or uncertainties. First, the MAS under input constraints or…
Mobile agent technology offers a dramatically evolving computing paradigm in which a program, in the form of a software agent, can suspend its execution on a host computer, transfers itself to another agent-enabled host on the network, and…
In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in…
We study the problem of resilient strategies in the presence of uncertainty. Resilient strategies enable an agent to make decisions that are robust against disturbances. In particular, we are interested in those disturbances that are able…
The purpose of this short paper is to provide a theoretical analysis for the consensus problem under nonlinear protocols. A main contribution of this work is to generalize the previous consensus problems under nonlinear protocols for…
In this paper, we propose matrix-scaled consensus algorithms for linear dynamical agents interacting over an undirected network. Under the proposed algorithms, the state vectors of all agents to asymptotically agree up to some matrix…
This paper investigates the consensus problem in almost sure sense for uncertain multi-agent systems with noises and fixed topology. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the…
In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement…
It is well established that neural networks are vulnerable to adversarial examples, which are almost imperceptible on human vision and can cause the deep models misbehave. Such phenomenon may lead to severely inestimable consequences in the…
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a…
Consider a consensus-driven multi-agent dynamic system. The interaction range, which defines the set of neighbors for each agent, plays a key role in influencing connectivity of the underlying network. In this paper, we assume the system is…
This paper considers the distributed consensus problem of multi-agent systems with general continuous-time linear dynamics. Two distributed adaptive dynamic consensus protocols are proposed, based on the relative output information of…