“Witsenhausen's counterexample”的意思、由来-开放百科全书

The statement of the counterexample is simple: two controllers attempt to control the system by attempting to bring the state close to zero in exactly two time steps. The first controller observes the initial state

There is a cost on the input

of the first controller, and a cost on the state

after the input of the second controller. The input

of the second controller is free, but it is based on noisy observations

of the state

after the first controller's input. The second controller cannot communicate with the first controller and thus cannot observe either the original state

or the input

of the first controller. Thus the system dynamics are

where the expectation is taken over the randomness in the initial state

and the observation noise

, which are distributed independently. The observation noise

is assumed to be distributed in a Gaussian manner, while the distribution of the initial state value

differs depending on the particular version of the problem.

that give at least as good a value of the objective function as do any other pair of control functions. Witsenhausen showed that the optimal functions

and

cannot be linear.

Specific results of Witsenhausen

The significance of the problem

The counterexample lies at the intersection of control theory and information theory. Due to its hardness, the problem of finding the optimal control law has also received attention from the theoretical computer science community. The importance of the problem was reflected upon in the 47th IEEE Conference on Decision and Control (CDC) 2008, Cancun, Mexico,^[2] where an entire session was dedicated to understanding the counterexample 40 years after it was first formulated.

The problem is of conceptual significance in decentralized control because it shows that it is important for the controllers to communicate^[3] with each other implicitly in order to minimize the cost. This suggests that control actions in decentralized control may have a dual role: those of control and communication.

The hardness of the problem

The hardness of the problem is attributed to the fact that information of the second controller depends on the decisions of the first controller.^[4] Variations considered by Tamer Basar ^[5] show that the hardness is also because of the structure of the performance index and the coupling of different decision variables. It has also been shown that problems of the spirit of Witsenhausen's counterexample become simpler if the transmission delay along an external channel that connects the controllers is smaller than the propagation delay in the problem. However, this result requires the channels to be perfect and instantaneous,^[6] and hence is of limited applicability. In practical situations, the channel is always imperfect, and thus one can not assume that decentralized control problems are simple in presence of external channels.

A justification of the failure of attempts that discretize the problem came from the computer science literature: Christos Papadimitriou and John Tsitsiklis showed that the discrete version of the counterexample is NP-complete.^[7]

Attempts at obtaining a solution

A number of numerical attempts have been made to solve the counterexample. Focusing on a particular choice of problem parameters

, researchers have obtained strategies by discretization and using neural networks.^[8] Further research (notably, the work of Yu-Chi Ho,^[9] and the work of Li, Marden and Shamma ^[10]) has obtained slightly improved costs for the same parameter choice. The best known numerical results for a variety of parameters, including the one mentioned previously, are obtained by a local search algorithm proposed by S.-H. Tseng and A. Tang in 2017.^[11] The first provably approximately optimal strategies appeared in 2010 (Grover, Park, Sahai) ^[12] where information theory is used to understand the communication in the counterexample. The optimal solution of the counterexample is still an open problem.

References

1. ^Witsenhausen, Hans. "A counterexample in stochastic optimum control." SIAM J. Control, Volume 6, Issue 1, pp. 131–147 (February 1968)
2. ^¹Ho, Yu-Chi, "Review of the Witsenhausen problem". Proceedings of the 47th IEEE Conference on Decision and Control (CDC), pp. 1611–1613, 2008.
3. ^Mitterrand and Sahai. "Information and Control: Witsenhausen revisited". Learning, control and hybrid systems, 1999, Springer.
4. ^Ho, Yu-Chi. "Team decision theory and information structures". Proceedings of the IEEE, Vol. 68, No.6, June 1980.
5. ^Basar, Tamer. "Variations on the theme of the Witsenhausen counterexample". 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9–11, 2008.
6. ^Rotkowitz, M.; Cogill, R.; Lall, S.; , "A Simple Condition for the Convexity of Optimal Control over Networks with Delays," Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on , pp. 6686–6691, 12–15 December 2005.
7. ^Christos Papadimitriou and John Tsitsiklis. "Intractable problems in control theory." 24th IEEE Conference on Decision and Control, 1985
8. ^Baglietto, Parisini, and Zoppoli. "Numerical solutions to the Witsenhausen counterexample by approximating networks." IEEE Transactions on Automatic Control. 2001.
9. ^Lee, Lau, and Ho. "The Witsenhausen counterexample: A hierarchical search approach for nonconvex optimization problems." IEEE Transactions on Automatic Control, 2001
10. ^Li, Marden, and Shamma. "Learning approaches to the Witsenhausen counterexample from a view of potential games." IEEE Conference on Decision and Control, 2009.
11. ^Tseng and Tang. "A Local Search Algorithm for the Witsenhausen's Counterexample." IEEE Conference on Decision and Control, 2017.
12. ^Grover, Sahai, and Park. "The finite-dimensional Witsenhausen counterexample." IEEE WiOpt 2010, ConCom workshop, Seoul, Korea.

Statement of the counterexample

Specific results of Witsenhausen

The significance of the problem

The hardness of the problem

Attempts at obtaining a solution

References