具有离散不确定性的逻辑网络的有限字母控制
Finite Alphabet Control of Logistic Networks with Discrete Uncertainty
AI总结：
针对控制与扰动输入取有限值的逻辑网络，推导了鲁棒控制不变（超盒）集存在的充要条件，并证明了更强条件足以保证鲁棒全局吸引性，同时通过反例表明该条件非必要。
摘要：
我们考虑控制与扰动输入取有限值的逻辑网络。我们推导了鲁棒控制不变（超盒）集存在的充要条件。我们证明了该条件的更强版本足以保证鲁棒全局吸引性，并构造了一个反例表明该条件并非必要。由于我们的充分性证明是构造性的，因此可以提取相应的鲁棒控制律并建立某些集合的不变性。最后，我们强调了我们的结果与文献中现有结果的相似之处，并以两个简单的说明性例子结束我们的研究。
英文摘要：
We consider logistic networks in which the control and disturbance inputs take values in finite sets. We derive a necessary and sufficient condition for the existence of robustly control invariant (hyperbox) sets. We show that a stronger version of this condition is sufficient to guarantee robust global attractivity, and we construct a counterexample demonstrating that it is not necessary. Being constructive, our proofs of sufficiency allow us to extract the corresponding robust control laws and to establish the invariance of certain sets. Finally, we highlight parallels between our results and existing results in the literature, and we conclude our study with two simple illustrative examples.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
