On the complexity of the robust stability problem for linear parameter varying systems
作者: Onur Toker
作者单位: 1Department of Electrical Engineering, UC Riverside, Riverside, CA 92521, U.S.A
刊名: Automatica, 1997, Vol.33 (11), pp.2015-2017
来源数据库: Elsevier Journal
DOI: 10.1016/S0005-1098(97)00129-5
关键词: Linear parameter varying systemsrobust stabilitycomputational complexity
原始语种摘要: Abstract(#br)In this paper, it is shown that the problem of checking robust stability of linear parameter varying (LPV) systems is NP -hard, and therefore, it is rather unlikely to find polynomial-time solution procedures for this problem. In the frequency-domain structured uncertainty case, it is known that the robust stability problem is NP -hard (Toker and Özbay, 1995; Toker, 1995; Poljak and Rohn, 1993; Nemirovski, 1993; Braatz et al ., 1994), but allowing the uncertain blocks to be time varying gives a computationally tractable problem (Shamma, 1994; Poolla and Tikku, 1995), which can be solved by convex optimization techniques. In the parameteric uncertainty case, NP -hardness of the robust stability problem has been shown in (Poljak and Rohn, 1993; Nemirovski, 1993). The results of...
全文获取路径: Elsevier  (合作)
影响因子:2.919 (2012)

  • problem 题目
  • varying 变化的
  • uncertainty 不定
  • polynomial 多项式
  • systems 系统科学与软件
  • stability 稳定性
  • robust 牢固的
  • parameter 参数
  • tractable 易处理的
  • algorithm 算法