Randomized algorithms for robust controller synthesis using statistical learning theory
- 119 Downloads
By now it is known that several problems in the robustness analysis and synthesis of control systems are NP-complete or NP-hard. These negative results force us to modify our notion of “solving” a given problem. If we cannot solve a problem exactly because it is NP-hard, then we must settle for solving it approximately. If we cannot solve all instances of a problem, we must settle for solving “almost all” instances of a problem. An approach that is recently gaining popularity is that of using randomized algorithms. The notion of a randomized algorithm as defined here is somewhat different from that in the computer science literature, and enlarges the class of problems that can be efficiently solved. We begin with the premise that many problems in robustness analysis and synthesis can be formulated as the minimization of an objective function with respect to the controller parameters. It is argued that, in order to assess the performance of a controller as the plant varies over a prespecified family, it is better to use the average performance of the controller as the objective function to be minimized, rather than its worst-case performance, as the worst-case objective function usually leads to rather conservative designs. Then it is shown that a property from statistical learning theory known as uniform convergence of empirical means (UCEM) plays an important role in allowing us to construct efficient randomized algorithms for a wide variety of controller synthesis problems. In particular, whenever the UCEM property holds, there exists an efficient (i.e., polynomial-time) randomized algorithm. Using very recent results in VC-dimension theory, it is shown that the UCEM property holds in several problems such as robust stabilization and weighted H 2/H ∞-norm minimization. Hence it is possible to solve such problems efficiently using randomized algorithms.
KeywordsProbability Measure Robustness Analysis Statistical Learning Theory Boolean Formula Randomize Algorithm
Unable to display preview. Download preview PDF.
- V. Blondel and J. N. Tsitsiklis, “NP-hardness of some linear control design problems,” SIAM J. Control and Opt., (to appear).Google Scholar
- F. R. Gantmacher, Matrix Theory, Volume II, Chelsea, New York, 1959.Google Scholar
- M. Karpinski and A.J. Macintyre, “Polynomial bounds for VC dimension of sigmoidal neural networks,” Proc. 27th ACM Symp. Thy. of Computing, pp. 200–208, 1995.Google Scholar
- M. Karpinski and A.J. Macintyre, “Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks,” J. Comp. Sys. Sci., (to appear).Google Scholar
- P.P. Khargonekar and A. Tikku, “Randomized algorithms for robust control analysis have polynomial complexity,” Proc. Conf. on Decision and Control, 1996 (to appear).Google Scholar
- A. Kowalczyk, H. Ferra and J. Szymanski, “Combining statistical physics with VC-bounds on generalisation in learning systems,” Proceeding of the Sixth Australian Conference on Neural Networks (ACNN'95, pp. 41–44, Sydney, 1995.Google Scholar
- A.J. Macintyre and E.D. Sontag, “Finiteness results for sigmoidal neural networks,” Proc. 25th ACM Symp. Thy. of Computing, pp. 325–334, 1993.Google Scholar
- C. Marrison and R. Stengel, “The use of random search and genetic algorithms to optimize stochastic robustness functions,” Proc. Amer. Control Conf., Baltimore, MD, pp. 1484–1489, 1994.Google Scholar
- R. Tempo, E.W. Bai and F. Dabbene, “Probabilistic robustness analysis: Explicit bounds for the minimum number of sampling points,” Proc. Conf. on Decision and Control, 1996 (to appear).Google Scholar
- V.N. Vapnik, Estimation of Dependences Based on Empirical Data, Springer-Verlag, 1982.Google Scholar