The University of Southampton
University of Southampton Institutional Repository

Consensus Acceleration in Multiagent Systems with the Chebyshev Semi-Iterative Method

Record type: Conference or Workshop Item (Paper)

We consider the fundamental problem of reaching consensus in multiagent systems; an operation required in many applications such as, among others, vehicle formation and coordination, shape formation in modular robotics, distributed target tracking, and environmental modeling. To date, the consensus problem (the problem where agents have to agree on their reported values) has been typically solved with iterative decentralized algorithms based on graph Laplacians. However, the convergence of these existing consensus algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with acceleration methods. Unfortunately, state-of-the-art acceleration techniques require parameters that can be optimally selected only if complete information about the network topology is available, which is rarely the case in practice. We address this limitation by deriving two novel acceleration methods that can deliver good performance even if little information about the network is available. The first proposed algorithm is based on the Chebyshev semi-iterative method and is optimal in a well defined sense; it maximizes the worst-case convergence speed (in the mean sense) given that only rough bounds on the extremal eigenvalues of the network matrix are available. It can be applied to systems where agents use unreliable communication links, and its computational complexity is similar to those of simple Laplacian-based methods. This algorithm requires synchronization among agents, so we also propose an asynchronous version that approximates the output of the synchronous algorithm. Mathematical analysis and numerical simulations show that the convergence speed of the proposed acceleration methods decrease gracefully in scenarios where the sole use of Laplacian-based methods is known to be impractical.

PDF paper.pdf - Version of Record
Download (183kB)

Citation

Cavalcante, R. L. G., Rogers, A. and Jennings, Nick (2011) Consensus Acceleration in Multiagent Systems with the Chebyshev Semi-Iterative Method At The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taiwan, Province of China. 02 - 06 May 2011. , pp. 165-172.

More information

Published date: 2 February 2011
Additional Information: Event Dates: 2-6 May 2011
Venue - Dates: The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taiwan, Province of China, 2011-05-02 - 2011-05-06
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 271984
URI: http://eprints.soton.ac.uk/id/eprint/271984
PURE UUID: d8ccd6cb-74cf-471a-941e-98e673a14478

Catalogue record

Date deposited: 03 Feb 2011 23:13
Last modified: 18 Jul 2017 06:35

Export record

Contributors

Author: R. L. G. Cavalcante
Author: A. Rogers
Author: Nick Jennings

University divisions


Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×