메뉴 건너뛰기




Volumn , Issue , 2007, Pages 6178-6183

Improved sample size bounds for probabilistic robust control design: A pack-based strategy

Author keywords

Probabilistic robustness; Randomized algorithms; Robust control; Robust convex optimization

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 36749083615     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434615     Document Type: Conference Paper
Times cited : (16)

References (18)
  • 2
    • 39549085527 scopus 로고    scopus 로고
    • Statistical learning theory: A pack-based strategy for uncertain feasibility and optimization problems
    • Technical Report
    • T. Alamo, R. Tempo, and E.F. Camacho. Statistical learning theory: A pack-based strategy for uncertain feasibility and optimization problems. Technical Report, 2007.
    • (2007)
    • Alamo, T.1    Tempo, R.2    Camacho, E.F.3
  • 4
    • 0034264701 scopus 로고    scopus 로고
    • A survey of computational complexity results in system and control
    • V. D. Blondel and J.N. Tsitsiklis. A survey of computational complexity results in system and control. Automatica, 36:1249-1274, 2000.
    • (2000) Automatica , vol.36 , pp. 1249-1274
    • Blondel, V.D.1    Tsitsiklis, J.N.2
  • 5
    • 12344268988 scopus 로고    scopus 로고
    • Uncertain convex programs: Randomized solutions and confidence levels
    • G. Calafiore and M.C. Campi. Uncertain convex programs: randomized solutions and confidence levels. Math. Program, 102:25-46, 2005.
    • (2005) Math. Program , vol.102 , pp. 25-46
    • Calafiore, G.1    Campi, M.C.2
  • 8
    • 0035508269 scopus 로고    scopus 로고
    • Stochastic algorithms for exact and approximate feasibility of robust LMIs
    • G. Calafiore and B.T. Polyak. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Transactions on Automatic Control, 46(11): 1755-1759, 2001.
    • (2001) IEEE Transactions on Automatic Control , vol.46 , Issue.11 , pp. 1755-1759
    • Calafiore, G.1    Polyak, B.T.2
  • 9
    • 0042202191 scopus 로고    scopus 로고
    • Probabilistic design of LPV control systems
    • Y. Fujisaki, F. Dabbene, and R. Tempo. Probabilistic design of LPV control systems. Automatica, 39:1323-1337, 2003.
    • (2003) Automatica , vol.39 , pp. 1323-1337
    • Fujisaki, Y.1    Dabbene, F.2    Tempo, R.3
  • 10
    • 0038729656 scopus 로고    scopus 로고
    • An ellipsoid algorithm for probabilistic robust controller design
    • S. Kanev, B. De Schutter, and M. Verhaegen. An ellipsoid algorithm for probabilistic robust controller design. Systems and Control Letters, 49:365-375, 2003.
    • (2003) Systems and Control Letters , vol.49 , pp. 365-375
    • Kanev, S.1    De Schutter, B.2    Verhaegen, M.3
  • 12
    • 0034916989 scopus 로고    scopus 로고
    • Probabilistic robust design with linear quadratic regulators
    • B.T. Polyak and R. Tempo. Probabilistic robust design with linear quadratic regulators. Systems & Control Letters, 43:343-353, 2001.
    • (2001) Systems & Control Letters , vol.43 , pp. 343-353
    • Polyak, B.T.1    Tempo, R.2
  • 13
    • 0000872569 scopus 로고    scopus 로고
    • Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
    • R. Tempo, E.-W. Bai, and F. Dabbene. Probabilistic robustness analysis: Explicit bounds for the minimum number of samples. Systems & Control Letters, 30:237-242, 1997.
    • (1997) Systems & Control Letters , vol.30 , pp. 237-242
    • Tempo, R.1    Bai, E.-W.2    Dabbene, F.3
  • 17
    • 0032290586 scopus 로고    scopus 로고
    • Statistical learning theory and randomized algorithms for control
    • M. Vidyasagar. Statistical learning theory and randomized algorithms for control. Control Systems Magazine, 18(6):69-85, 1998.
    • (1998) Control Systems Magazine , vol.18 , Issue.6 , pp. 69-85
    • Vidyasagar, M.1
  • 18
    • 0035452336 scopus 로고    scopus 로고
    • Probabilistic solutions to some NP-hard matrix problems
    • M. Vidyasagar and V. D. Blondel. Probabilistic solutions to some NP-hard matrix problems. Automatica, 37(9): 1397-1405, 2001.
    • (2001) Automatica , vol.37 , Issue.9 , pp. 1397-1405
    • Vidyasagar, M.1    Blondel, V.D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.