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 convergence of a class of distributed stochastic type non-linear protocols. Numerical examples are given to illustrate the results.
Comments: 9 Pages.
[v1] 2012-06-05 10:52:56
Unique-IP document downloads: 60 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.