Multi-agent Robust Consensus: Convergence Analysis and Application

Details Multi-agent Robust Consensus: Convergence Analysis and Application Multi-agent Robust Consensus: Convergence Analysis and Application

2011-08-16

arxiv.org/abs/1108.3226v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

The paper investigates consensus problem for continuous-time multi-agent systems with time-varying communication graphs subject to process noises. Borrowing the ideas from input-to-state stability (ISS) and integral input-to-state stability (iISS), robust consensus and integral robust consensus are defined with respect to $L_\infty$ and $L_1$ norms of the disturbance functions, respectively. Sufficient and/or necessary connectivity conditions are obtained for the system to reach robust consensus or integral robust consensus, which answer the question: how much communication capacity is required for a multi-agent network to converge despite certain amount of disturbance. The $\epsilon$-convergence time is then obtained for the network as a special case of the robustness analysis. The results are based on quite general assumptions on switching graph, weights rule and noise regularity. In addition, as an illustration of the applicability of the results, distributed event-triggered coordination is studied.

Affiliated with

Also associated with

No associations

Rating

Multi-agent Robust Consensus: Convergence Analysis and Application does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multi-agent Robust Consensus: Convergence Analysis and Application, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-agent Robust Consensus: Convergence Analysis and Application will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195919