Paper Info
Title
Bounding the smallest robustly control invariant sets in networks with discrete disturbances and controls
Abstract
This paper is concerned with the reliability of logistics networks, specifically the problem of guaranteeing their robustness to uncertainties in operating conditions while maintaining economical storage costs. Indeed, we investigate logistics networks in a setup where both the disturbances and control actions take their values in prescribed finite alphabet sets, we revisit recently derived bounds on the 'l1' norm of the smallest invariant hyperbox sets, we show that the existing bounds are conservative, and we propose a tighter new lower bound.
Year
DOI
Venue
2013
10.1145/2461446.2461462
HiCoNS
Keywords
Field
DocType
economical storage cost,invariant set,smallest invariant hyperbox set,prescribed finite alphabet set,logistics network,discrete disturbance,existing bound,l1 norm,control action,robustness,lower bound,operant conditioning
Mathematical optimization,Upper and lower bounds,Computer science,Robustness (computer science),Invariant (mathematics),Bounding overwatch,Alphabet
Conference
Citations 
PageRank 
References 
0
0.34
18
Authors
1
Name
Order
Citations
PageRank
Danielle C. Tarraf117719.65