Computations of probabilistic output admissible set for uncertain constrained systems
Computations of probabilistic output admissible set for uncertain constrained systems
复制标题
DOI：
10.1016/j.automatica.2007.03.031
复制
发表时间：
2008-02
期刊：
影响因子：
--
通讯作者：
T. Hatanaka;K. Takaba
中科院分区：
文献类型：
--
作者：
T. Hatanaka;K. Takaba
本文考虑不确定约束系统，并开发了两种算法来计算概率输出可接受（POA）集，该集是概率上保证满足约束的一组初始状态。第一个算法的灵感来自于现有的随机序列技术。第二种算法减轻了基于启发式的计算工作量。本算法以有限次数的迭代终止并提供 POA 集。此外，我们还可以获得有关后验结果集大小的信息。数值模拟证明了 POA 集对控制系统设计方案的适用性。
This paper considers uncertain constrained systems, and develops two algorithms for computing a probabilistic output admissible (POA) set which is a set of initial states probabilistically assured to satisfy the constraint. The first algorithm is inspired by an existing randomized sequential technique. The second algorithm alleviates the computational effort based on heuristics. The present algorithms terminate in a finite number of iterations and provide a POA set. Additionally, we can obtain information on the size of the resulting set a posteriori. A numerical simulation demonstrates the applicability of the POA set to a control system design scheme.