Computation of Safe Disturbance Sets Using Implicit RPI Sets

• 成果类型: Article
• 署名作者: Mulagaleti, Sampath Kumar; Bemporad, Alberto; Zanon, Mario
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2023.3322190
• 发表日期: 2024
• 页码: 4443-4458
• 关键词: Economic indicators; optimization; Linear systems; Additives; uncertainty; shape; Linear matrix inequalities; Automatic control; decentralized control; Robust control

摘要

Given a stable linear time-invariant system subject to output constraints, in this article, we present a method to compute a set of disturbances such that the reachable set of outputs matches as closely as possible the output constraint set, while being included in it. This problem finds application in several control design problems, such as the development of hierarchical control loops, decentralized control, supervisory control, robustness verification, etc. We first characterize the set of disturbance sets satisfying the output constraint inclusion using corresponding minimal robust positive invariant (mRPI) sets, following which we formulate an optimization problem that minimizes the distance between the reachable output set and the output constraint set. We tackle the optimization problem using an implicit RPI set approach that provides a priori approximation error guarantees, and adopt a novel disturbance set parameterization that permits the encoding of the set of feasible disturbance sets as a polyhedron. Through extensive numerical examples, we demonstrate that the proposed approach computes disturbance sets with reduced conservativeness improved computational efficiency than state-of-the-art methods.