.png){kind=icon}
.png){kind=icon}
Return
Robust invariant sets for constrained storage systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2009.09.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Several items are produced and stored into n buffers in order to supply an external demand without interruptions. We consider the classical problem of determining control laws and smallest buffer levels guaranteeing that an unknown bounded demand is always satisfied. A simple model with n decoupled integrators and n additive bounded disturbances is employed. The coupling arises from bounds on the total production capacity and on the total demand. Invariant set theory for linear and switched linear systems is exploited to compute robust positive invariant sets and controlled robust invariant sets for two commonly adopted scheduling policies. This paper provides the explicit expression of the invariant sets for any arbitrary n. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Invariant sets
Constrained control
Storage systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
