Asymptotic reachable sets for discrete-time positive linear systems
被引:0
作者:
Rumchev, Ventsi G.
论文数: 0引用数: 0
h-index: 0
机构:
School of Mathematics and Statistics, Curtin University of Technology, Perth, WA 6001, AustraliaSchool of Mathematics and Statistics, Curtin University of Technology, Perth, WA 6001, Australia
Rumchev, Ventsi G.
[1
]
Anstee, Richard P.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics, University of British Columbia, Vancouver, BC V6T 1Z2, CanadaSchool of Mathematics and Statistics, Curtin University of Technology, Perth, WA 6001, Australia
Anstee, Richard P.
[2
]
机构:
[1] School of Mathematics and Statistics, Curtin University of Technology, Perth, WA 6001, Australia
[2] Department of Mathematics, University of British Columbia, Vancouver, BC V6T 1Z2, Canada
来源:
Systems Science
|
1999年
/
25卷
/
01期
关键词:
Computational geometry - Constraint theory - Control system analysis - Discrete time control systems - Matrix algebra - Set theory - Theorem proving - Vectors;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
Reachable sets of discrete-time positive linear systems with no additional constraints imposed on controls are polyhedral cones for any finite t but the asymptotic reachable set may not be polyhedral. The asymptotic reachable properties of such sets are investigated and polyhedrality/non-polyhedrality of the asymptotic reachable set are characterized.