By Topic

Identification of sparse communication graphs in consensus networks

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
$33 $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

3 Author(s)
Fu Lin ; Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 ; Makan Fardad ; Mihailo R. Jovanović

We consider the design of distributed controller architectures for undirected networks of single-integrators. In the presence of stochastic disturbances, we identify communication topologies that balance the variance amplification of the network with the number of communication links. This is achieved by solving a parameterized family of sparsity-promoting optimal control problems whose solution traces the optimal tradeoff curve that starts at the centralized controller and ends at the controller with sparse communication links. We show that the optimal control problem can be formulated as a semidefinite program whose global solution can be computed efficiently. An example is provided to illustrate the utility of the developed approach.

Published in:

Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on

Date of Conference:

1-5 Oct. 2012