29 research outputs found
Distributed Consensus of Linear Multi-Agent Systems with Adaptive Dynamic Protocols
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
neighboring agents. One protocol assigns an adaptive coupling weight to each
edge in the communication graph while the other uses an adaptive coupling
weight for each node. These two adaptive protocols are designed to ensure that
consensus is reached in a fully distributed fashion for any undirected
connected communication graphs without using any global information. A
sufficient condition for the existence of these adaptive protocols is that each
agent is stabilizable and detectable. The cases with leader-follower and
switching communication graphs are also studied.Comment: 17 pages, 5 figue
A new kernel-based approach to system identification with quantized output data
In this paper we introduce a novel method for linear system identification
with quantized output data. We model the impulse response as a zero-mean
Gaussian process whose covariance (kernel) is given by the recently proposed
stable spline kernel, which encodes information on regularity and exponential
stability. This serves as a starting point to cast our system identification
problem into a Bayesian framework. We employ Markov Chain Monte Carlo methods
to provide an estimate of the system. In particular, we design two methods
based on the so-called Gibbs sampler that allow also to estimate the kernel
hyperparameters by marginal likelihood maximization via the
expectation-maximization method. Numerical simulations show the effectiveness
of the proposed scheme, as compared to the state-of-the-art kernel-based
methods when these are employed in system identification with quantized data.Comment: 10 pages, 4 figure
Average consensus and gossip algorithms in networks with stochastic asymmetric communications
We consider that a set of distributed agents desire to reach consensus on the average of their initial state values, while communicating with neighboring agents through a shared medium. This communication medium allows only one agent to transmit unidirectionally at a given time, which is true, e.g., in wireless networks. We address scenarios where the choice of agents that transmit and receive messages at each transmission time follows a stochastic characterization, and we model the topology of allowable transmissions with asymmetric graphs. In particular, we consider: (i) randomized gossip algorithms in wireless networks, where each agent becomes active at randomly chosen times, transmitting its data to a single neighbor; (ii) broadcast wireless networks, where each agent transmits to all the other agents, and access to the network occurs with the same probability for every node. We propose a solution in terms of a linear distributed algorithm based on a state augmentation technique, and prove that this solution achieves average consensus in a stochastic sense, for the special cases (i) and (ii). Expressions for absolute time convergence rates at which average consensus is achieved are also given
Consensus of Multi-Agent Systems with General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols
This paper considers the distributed consensus problems for multi-agent
systems with general linear and Lipschitz nonlinear dynamics. Distributed
relative-state consensus protocols with an adaptive law for adjusting the
coupling weights between neighboring agents are designed for both the linear
and nonlinear cases, under which consensus is reached for all undirected
connected communication graphs. Extensions to the case with a leader-follower
communication graph are further studied. In contrast to the existing results in
the literature, the adaptive consensus protocols here can be implemented by
each agent in a fully distributed fashion without using any global information.Comment: 15 pages, 6 figures, submitted to IEEE TA
Gossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital
links, and proposes a set of algorithms based on pairwise ''gossip''
communications and updates. We study the convergence properties of such
algorithms with the goal of answering two design questions, arising from the
literature: whether the agents should encode their communication by a
deterministic or a randomized quantizer, and whether they should use, and how,
exact information regarding their own states in the update.Comment: Accepted for publicatio