English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider logistic networks in which the control and disturbance inputstake values in finite sets. We derive a necessary and sufficient condition forthe existence of robustly control invariant (hyperbox) sets. We show that astronger version of this condition is sufficient to guarantee robust globalattractivity, and we construct a counterexample demonstrating that it is notnecessary. Being constructive, our proofs of sufficiency allow us to extractthe corresponding robust control laws and to establish the invariance ofcertain sets. Finally, we highlight parallels between our results and existingresults in the literature, and we conclude our study with two simpleillustrative examples.

Finite Alphabet Control of Logistic Networks with Discrete Uncertainty