期刊
AUTOMATICA
卷 74, 期 -, 页码 230-237出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2016.07.048
关键词
Hyper-pyramid; Linear programming; Linear system; Positive linear system; Reachable set
资金
- Research Grants Council of Hong Kong [GRF HKU 7137/13E]
- National Natural Science Foundation of China [61573188]
- Fundamental Research Funds for the Central Universities [30915011327]
- Natural Science Foundation of Jiangsu Province, China [BK20151492]
This paper focuses on positive linear time-invariant systems with constant coefficients and specific exogenous disturbance. The problem of finding a hyper-pyramid to bound the set of the states that are reachable from the origin in the Euclidean space is addressed, subject to inputs whose (1, 1)-norm or (infinity, 1)-norm is bounded by a prescribed constant. The Lyapunov approach is applied and a bounding hyper-pyramid is obtained by solving a set of inequalities. Iterative procedures (with an adjustable parameter) for reducing the hyper-volume of the bounding hyper-pyramid for the reachable set are proposed. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据