메뉴 건너뛰기




Volumn 54, Issue 2, 2009, Pages 382-385

Notes on the scenario design approach

Author keywords

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

Indexed keywords

DESIGN; OPTIMIZATION; ROBUST CONTROL; ROBUSTNESS (CONTROL SYSTEMS);

EID: 61349202997     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2008.2008335     Document Type: Article
Times cited : (29)

References (19)
  • 1
    • 36749083615 scopus 로고    scopus 로고
    • Improved sample size bounds for probabilistic robust control design: A pack-based strategy
    • Dec
    • T. Alamo, R. Tempo, and E. Camacho, "Improved sample size bounds for probabilistic robust control design: A pack-based strategy," in Proc. IEEE Conf. Decision Control, Dec. 2007, pp. 6178-6183.
    • (2007) Proc. IEEE Conf. Decision Control , pp. 6178-6183
    • Alamo, T.1    Tempo, R.2    Camacho, E.3
  • 2
    • 36749052442 scopus 로고    scopus 로고
    • Revisiting statistical learning theory for uncertain feasibility and optimization problems
    • T. Alamo, R. Tempo, and E. Camacho, "Revisiting statistical learning theory for uncertain feasibility and optimization problems," in Proc. IEEE Conf. Decision Control, 2007, pp. 2135-2140.
    • (2007) Proc. IEEE Conf. Decision Control , pp. 2135-2140
    • Alamo, T.1    Tempo, R.2    Camacho, E.3
  • 3
    • 61349157365 scopus 로고    scopus 로고
    • G. Calafiore, A note on the expected probability of constraint violation in sampled convex programs, Optimization Online 2008 [Online]. Available: http://www.optimization-online. org/DB_HTML/2008/07/2046.html
    • G. Calafiore, "A note on the expected probability of constraint violation in sampled convex programs," Optimization Online 2008 [Online]. Available: http://www.optimization-online. org/DB_HTML/2008/07/2046.html
  • 4
    • 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," Mathematical Programming, vol. 102, no. 1, pp. 25-46, 2005.
    • (2005) Mathematical Programming , vol.102 , Issue.1 , pp. 25-46
    • Calafiore, G.1    Campi, M.C.2
  • 5
    • 33646902948 scopus 로고    scopus 로고
    • The scenario approach to robust control design
    • May
    • G. Calafiore and M. C. Campi, "The scenario approach to robust control design," IEEE Trans. Automat. Control, vol. 51, no. 5, pp. 742-753, May 2006.
    • (2006) IEEE Trans. Automat. Control , vol.51 , Issue.5 , pp. 742-753
    • Calafiore, G.1    Campi, M.C.2
  • 6
    • 36248929488 scopus 로고    scopus 로고
    • A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
    • G. Calafiore and F. Dabbene, "A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs," Automatica, vol. 43, no. 12, pp. 2022-2033, 2007.
    • (2007) Automatica , vol.43 , Issue.12 , pp. 2022-2033
    • Calafiore, G.1    Dabbene, F.2
  • 8
    • 0035508269 scopus 로고    scopus 로고
    • Stochastic algorithms for exact and approximate feasibility of robust LMIs
    • Nov
    • G. Calafiore and B. T. Polyak, "Stochastic algorithms for exact and approximate feasibility of robust LMIs," IEEE Trans. Automat. Control, vol. 46, no. 11, pp. 1755-1759, Nov. 2001.
    • (2001) IEEE Trans. Automat. Control , vol.46 , Issue.11 , pp. 1755-1759
    • Calafiore, G.1    Polyak, B.T.2
  • 10
    • 62749143079 scopus 로고    scopus 로고
    • Modulating robustness in robust control: Making it easy through randomization
    • M. C. Campi and S. Garatti, "Modulating robustness in robust control: Making it easy through randomization," in Proc. IEEE Conf. Decision Control, 2007, pp. 2164-2168.
    • (2007) Proc. IEEE Conf. Decision Control , pp. 2164-2168
    • Campi, M.C.1    Garatti, S.2
  • 11
    • 61349159944 scopus 로고    scopus 로고
    • The exact feasibility of randomized solutions of robust convex programs
    • M. C. Campi and S. Garatti, "The exact feasibility of randomized solutions of robust convex programs," SIAM J. Optim., vol. 19, no. 3, pp. 1211-1230, 2008.
    • (2008) SIAM J. Optim , vol.19 , Issue.3 , pp. 1211-1230
    • Campi, M.C.1    Garatti, S.2
  • 12
    • 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," Syst. Control Lett., vol. 49, pp. 365-375, 2003.
    • (2003) Syst. Control Lett , vol.49 , pp. 365-375
    • Kanev, S.1    De Schutter, B.2    Verhaegen, M.3
  • 13
    • 0030410748 scopus 로고    scopus 로고
    • Randomized algorithms for robust control analysis and synthesis have polynomial complexity
    • P. Khargonekar and A. Tikku, "Randomized algorithms for robust control analysis and synthesis have polynomial complexity," in Proc. IEEE Conf. Decision Control, 1996, pp. 3470-3475.
    • (1996) Proc. IEEE Conf. Decision Control , pp. 3470-3475
    • Khargonekar, P.1    Tikku, A.2
  • 14
    • 36248992411 scopus 로고    scopus 로고
    • Convex approximations of chance constrained programs
    • A. Nemirovski and A. Shapiro, "Convex approximations of chance constrained programs," SIAM J. Optim., vol. 17, no. 4, pp. 969-996, 2006.
    • (2006) SIAM J. Optim , vol.17 , Issue.4 , pp. 969-996
    • Nemirovski, A.1    Shapiro, A.2
  • 15
    • 34547436607 scopus 로고    scopus 로고
    • Scenario approximations of chance constraints
    • G. Calafiore and F. Dabbene, Eds. London, U.K, Springer-Verlag
    • A. Nemirovski and A. Shapiro, "Scenario approximations of chance constraints," in Probabilistic and Randomized Methods for Design Under Uncertainty, G. Calafiore and F. Dabbene, Eds. London, U.K.: Springer-Verlag, 2006, pp. 3-47.
    • (2006) Probabilistic and Randomized Methods for Design Under Uncertainty , pp. 3-47
    • Nemirovski, A.1    Shapiro, A.2
  • 16
    • 33846781128 scopus 로고    scopus 로고
    • Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
    • Y. Oishi, "Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities," Automatica, vol. 43, pp. 538-545, 2007.
    • (2007) Automatica , vol.43 , pp. 538-545
    • Oishi, Y.1
  • 17
    • 0034916989 scopus 로고    scopus 로고
    • Probabilistic robust design with linear quadratic regulators
    • B. T. Polyak and R. Tempo, "Probabilistic robust design with linear quadratic regulators," Syst. Control Lett., vol. 43, pp. 343-353, 2001.
    • (2001) Syst. Control Lett , vol.43 , pp. 343-353
    • Polyak, B.T.1    Tempo, R.2
  • 18
    • 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," Syst. Control Lett., vol. 30, pp. 237-242, 1997.
    • (1997) Syst. Control Lett , vol.30 , pp. 237-242
    • Tempo, R.1    Bai, E.-W.2    Dabbene, F.3
  • 19
    • 1542266240 scopus 로고    scopus 로고
    • Randomized Algorithms for Analysis and Control of Uncertain Systems
    • London, U.K, Springer-Verlag
    • R. Tempo, G. Calafiore, and F. Dabbene, Randomized Algorithms for Analysis and Control of Uncertain Systems, ser. Communications and Control Engineering. London, U.K.: Springer-Verlag, 2004.
    • (2004) ser. Communications and Control Engineering
    • Tempo, R.1    Calafiore, G.2    Dabbene, F.3


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