Close category search window
 

On consensus with a general discrete time convex combination based algorithm for multi-agent systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Bolouki, S. ; GERAD, Ecole Polytech. de Montreal, Montreal, QC, Canada ; Malhame, R.P.

A general convex combination based model in discrete time for the evolution of multi-agent systems is considered. Sufficient conditions under which an individual limit for each agent's state exists are subsequently derived. Moreover, it is shown that under stronger conditions, those individual limits are equal, i.e., consensus occurs. The relationship of these results to those of other well known consensus models is explained.

Published in:
Control & Automation (MED), 2011 19th Mediterranean Conference on

Date of Conference: 20-23 June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.