Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multi-Agent Networks

We analyse two different schemes for an adaptive control and prove sufficient conditions ensuring the existence of an homogeneous Markov chain, which is the first step to prove

[13] , An optimal error estimate in stochastic homogenization of discrete elliptic equations, Annals of Applied Probability, 22 (2012),

Simple algebraic con- ditions for the existence and uniqueness of a stable fixed point on the boundary of the feasible region represent the main result of this paper, completed with

The rest of the paper is organized as follows. In Section 2 the constrained predictive control problem is formulated. Section 3 considers the unbounded interdicted region and

To summarize, this study shows that, when dealing with large sensor networks, iterative local average decisions play an important role on the achieved global performances, namely

In this section, we apply the average-based distributed algorithm studied above to derive, from local average-based interactions, two global properties of our system: first

Uniform spectral convergence of the stochastic Galerkin method for the linear transport equations with random inputs in diffusive regime and a micro-macro decomposition based

To evaluate numerically the average properties of the limit cycles of the networks, we randomly generate a statistically significant number of realizations of connectivity matrices