QUANTITATIVE CONVERGENCE ANALYSIS OF MULTI-AGENT SYSTEMS

摘要

We introduce a characterization of contraction for bounded convex sets. For discrete-time multi-agent systems we provide an explicit upperbound on the rate of convergence to a consensus under the assumptions of contractiveness and (weak) connectedness (across an interval.) Convergence is shown to be exponential when either the system or the function characterizing the contraction is linear.