By Topic

Optimal linear iterations for distributed agreement

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qing Hui ; Dept. of Mech. Eng., Texas Tech Univ., Lubbock, TX, USA ; Haopeng Zhang

A new optimal distributed linear averaging (ODLA) problem is presented in this paper. This problem is motivated from the distributed averaging problem which arises in the context of distributed algorithms in computer science and coordination of groups of autonomous agents in engineering. The aim of the ODLA problem is to compute the average of the initial values at nodes of a graph through an optimal distributed algorithm in which the nodes in the graph can only communicate with their neighbors. Optimality is given by a minimization problem of a quadratic cost functional under infinite horizon. We show that this problem has a very close relationship with the notion of semistability. By developing new necessary and sufficient conditions for semistability of linear discrete-time systems, we convert the original ODLA problem into two equivalent optimization problems. These two problems are convex optimization problems and can be solved by using some numerical techniques.

Published in:

American Control Conference (ACC), 2010

Date of Conference:

June 30 2010-July 2 2010