The standard parts problem and the complexity of control communication

The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to achieve a certain number, n, of output objectives and to do this in such a way that a specified figure-of-merit measuring the average cost of control is minimized. The problem is especially interesting when m is significantly less than n. Distributed optimization problems of this type arise naturally in connection with recent work on control communication complexity. In what follows a general formulation of the standard parts optimization problem is given along with some simple illustrative examples. Control communication complexity is defined, and it is shown how one measure of this complexity naturally leads to a standard parts optimization problem. The entire circle of ideas is explored in the context of quadratic optimal control of the Heisenberg system, and recent results on computability using simple closed curve inputs are presented.

[1]  Wing Shing Wong,et al.  Complexity of Distributed Choices , 2010 .

[2]  Stéphane Bressan,et al.  Introduction to Database Systems , 2005 .

[3]  Wing Shing Wong,et al.  Control Communication Complexity of Nonlinear Systems , 2009, Commun. Inf. Syst..

[4]  John Baillieul,et al.  Relative Motion of Robots as a Means for Signaling , 2008 .

[5]  John Baillieul,et al.  Exploiting information content in relative motion , 2009, 2009 American Control Conference.

[6]  Anthony J. G. Hey,et al.  Feynman Lectures on Computation , 1996 .

[7]  Tommaso Toffoli,et al.  Bicontinuous extensions of invertible combinatorial functions , 1981, Mathematical systems theory.

[8]  C. J. Date.  An introduction to database systems (7. ed.) , 1999 .

[9]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[10]  John Baillieul,et al.  Motion based communication channels between mobile robots - A novel paradigm for low bandwidth information exchange , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  R. Brockett.  Minimizing attention in a motion control context , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[12]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[13]  J. Baillieul.  Geometric methods for nonlinear optimal control problems , 1978 .

[14]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

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

[16]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[17]  Charles H. Bennett.  Notes on the history of reversible computation , 2000, IBM J. Res. Dev..

[18]  Yu-Chi Ho,et al.  Team decision theory and information structures , 1980 .

[19]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.