期刊
AUTOMATICA
卷 137, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2021.110108
关键词
-
This paper proposes a sample-based procedure to obtain simple and computable approximations of chance-constrained sets. The procedure allows for controlling the complexity of the approximating set and obtaining the desired probabilistic guarantees through a probabilistic scaling procedure. The proposed approach has applications in various problems related to systems and control.
In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of simple-approximating sets of given complexity. A probabilistic scaling procedure then scales these sets to obtain the desired probabilistic guarantees. The proposed approach is shown to be applicable in several problems in systems and control, such as the design of Stochastic Model Predictive Control schemes or the solution of probabilistic set membership estimation problems. (C) 2021 Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据