Randomized algorithms for robust control analysis and synthesis have polynomial complexity
Randomized algorithms for robust control analysis and synthesis have polynomial complexity
复制标题
用于鲁棒控制分析和综合的随机算法具有多项式复杂性
DOI：
--
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
A. Tikku
中科院分区：
文献类型：
--
作者：
P. Khargonekar;A. Tikku
我们考虑几个鲁棒控制分析和设计问题。在过去的几年里，这些问题中的大多数都是NP难的。我们表明，如果不是最坏情况下保证的结论，一个是愿意得出结论，具有高度的信心，那么计算复杂性显着降低。
We consider several robust control analysis and design problems. As has become well known over the last few years, most of these problems are NP hard. We show that if instead of worst-case guaranteed conclusions, one is willing to draw conclusions with a high degree of confidence, then the computational complexity decreases dramatically.