6533b82dfe1ef96bd12915ca
RESEARCH PRODUCT
Finite Alphabet Control of Logistic Networks with Discrete Uncertainty
Dario BausoDanielle C. Tarrafsubject
General Computer ScienceComputer scienceMechanical EngineeringSystems and Control (eess.SY)Invariant (physics)Mathematical proofConstructiveControl and Systems EngineeringOptimization and Control (math.OC)FOS: MathematicsFOS: Electrical engineering electronic engineering information engineeringComputer Science - Systems and ControlApplied mathematicsElectrical and Electronic EngineeringAlphabetRobust controlMathematics - Optimization and ControlFinite setCounterexampledescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-02-01 |