Jorge Cortés
Professor
Cymer Corporation Endowed Chair
Analysis and design of distributed algorithms for chi-consensus
J. Cortés
Proceedings of the 45th IEEE Int. Conf. Decision and Control, San
Diego, California, USA, 2006, pp. 3363-3368
Abstract
This paper presents analysis and design results for distributed
consensus algorithms in multi-agent networks. We consider arbitrary
consensus functions of the initial state of the network agents.
Under mild smoothness assumptions, we obtain necessary and
sufficient conditions characterizing any algorithm that
asymptotically achieves consensus. This characterization is the
building block to obtain various design results. We first identify
a class of smooth functions for which one can synthesize in a
systematic way distributed algorithms that achieve consensus. We
apply this result to the family of weighted power mean functions,
and characterize the exponential convergence properties of the
resulting algorithms. We conclude with two distributed algorithms
that achieve, respectively, max and min consensus in finite time.
pdf
  |  
ps.gz
Mechanical and Aerospace Engineering,
University of California, San Diego
9500 Gilman Dr,
La Jolla, California, 92093-0411
Ph: 1-858-822-7930
Fax: 1-858-822-3107
cortes at ucsd.edu
Skype id:
jorgilliyo