Reduction of decentralized control problems to tractable representations

For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are systems which are not quadratically invariant but reduce to systems that are. We call the requisite property internal quadratic invariance. We present an associated reduction procedure, and illustrate our method with examples.

[1]  R. Radner,et al.  Team Decision Problems , 1962 .

[2]  Sanjay Lall,et al.  A Characterization of Convex Problems in Decentralized Control$^ast$ , 2005, IEEE Transactions on Automatic Control.

[3]  Michael Rotkowitz.  On information structures, convexity, and linear optimality , 2008, 2008 47th IEEE Conference on Decision and Control.

[4]  Harry J. Huang.  Essay Topic Writability Examined through a Statistical Approach from the College Writer's Perspective. , 2008 .

[5]  Y. Ho,et al.  Team decision theory and information structures in optimal control problems--Part II , 1972 .

[6]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[7]  T. Başar,et al.  Stochastic Teams with Nonclassical Information Revisited: When is an Affine Law Optimal? , 1986, 1986 American Control Conference.

[8]  S. Lall,et al.  Decentralized control information structures preserved under feedback , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[9]  Stephen P. Boyd,et al.  Linear controller design: limits of performance , 1991 .

[10]  Thomas Kailath,et al.  Linear Systems , 1980 .

[11]  Yu-Chi Ho,et al.  Correction to "Team decision theory and information structures in optimal control problems," Parts I and II , 1972 .

[12]  Joan Feigenbaum,et al.  Information Structures , 1999, Handbook of Discrete and Combinatorial Mathematics.

[13]  H. Witsenhausen.  A Counterexample in Stochastic Optimum Control , 1968 .