期刊
AUTOMATICA
卷 49, 期 1, 页码 93-100出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2012.09.020
关键词
Reachability; Invariants; Control systems; Bounding method; Intervals
资金
- National Science Foundation [CTS-0521962, CBET-0933095]
- Directorate For Engineering
- Div Of Chem, Bioeng, Env, & Transp Sys [0933095] Funding Source: National Science Foundation
The computation of rigorous enclosures of the reachable sets of nonlinear control systems is considered, with a focus on applications for which speed is crucial. Low computational costs make interval methods based on differential inequalities an attractive option. Unfortunately, such methods are prone to large overestimation and often produce useless results in practice. From physical considerations, however, it is common that some crude set is known to contain the reachable set. We establish a general bounding result, based on differential inequalities, which enables the effective use of such sets during the bounding procedure. In the case where this set is a convex polyhedron, an efficient implementation using interval computations is developed. Using readily available physical information from practical examples, this method is shown to provide significant advantages over alternative methods in terms of both efficiency and accuracy. (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据