By Topic

A graph-theoretic approach to distributed control over 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

2 Author(s)
John Swigart ; Department of Aeronautics and Astronautics, Stanford University, CA 94305, USA ; Sanjay Lall

We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems are simply constrained by a certain sparsity pattern. We provide conditions for which such systems are well-posed, and, under the appropriate assumptions, we show that such systems are quadratically invariant. This allows for efficient solution via convex programming, and we provide a construction for the optimal controllers.

Published in:

Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on

Date of Conference:

15-18 Dec. 2009