361 research outputs found
Consensus with Linear Objective Maps
A consensus system is a linear multi-agent system in which agents communicate
to reach a so-called consensus state, defined as the average of the initial
states of the agents. Consider a more generalized situation in which each agent
is given a positive weight and the consensus state is defined as the weighted
average of the initial conditions. We characterize in this paper the weighted
averages that can be evaluated in a decentralized way by agents communicating
over a directed graph. Specifically, we introduce a linear function, called the
objective map, that defines the desired final state as a function of the
initial states of the agents. We then provide a complete answer to the question
of whether there is a decentralized consensus dynamics over a given digraph
which converges to the final state specified by an objective map. In
particular, we characterize not only the set of objective maps that are
feasible for a given digraph, but also the consensus dynamics that implements
the objective map. In addition, we present a decentralized algorithm to design
the consensus dynamics
Distributed Average Consensus under Quantized Communication via Event-Triggered Mass Summation
We study distributed average consensus problems in multi-agent systems with
directed communication links that are subject to quantized information flow.
The goal of distributed average consensus is for the nodes, each associated
with some initial value, to obtain the average (or some value close to the
average) of these initial values. In this paper, we present and analyze a
distributed averaging algorithm which operates exclusively with quantized
values (specifically, the information stored, processed and exchanged between
neighboring agents is subject to deterministic uniform quantization) and relies
on event-driven updates (e.g., to reduce energy consumption, communication
bandwidth, network congestion, and/or processor usage). We characterize the
properties of the proposed distributed averaging protocol on quantized values
and show that its execution, on any time-invariant and strongly connected
digraph, will allow all agents to reach, in finite time, a common consensus
value represented as the ratio of two integer that is equal to the exact
average. We conclude with examples that illustrate the operation, performance,
and potential advantages of the proposed algorithm
Asymptotic Consensus Without Self-Confidence
This paper studies asymptotic consensus in systems in which agents do not
necessarily have self-confidence, i.e., may disregard their own value during
execution of the update rule. We show that the prevalent hypothesis of
self-confidence in many convergence results can be replaced by the existence of
aperiodic cores. These are stable aperiodic subgraphs, which allow to virtually
store information about an agent's value distributedly in the network. Our
results are applicable to systems with message delays and memory loss.Comment: 13 page
Consensus on Nonlinear Spaces
peer reviewedConsensus problems have attracted significant attention in the control community
over the last decade. They act as a rich source of new mathematical problems pertaining to
the growing field of cooperative and distributed control. This paper is an introduction to
consensus problems whose underlying state-space is not a linear space, but instead a highly
symmetric nonlinear space such as the circle and other relevant generalizations. A geometric
approach is shown to highlight the connection between several fundamental models of consensus,
synchronization, and coordination, to raise significant global convergence issues not present in
linear models, and to be relevant for a number of engineering applications, including the design
of planar or spatial coordinated motions
- …