Explicit minimax adaptive policies stabilize finite sets of positive LTI plants under adversarial disturbances with certified ℓ1-gain, via a history-variable Bellman inequality.
Throughput Properties of a Queueing Network with Distributed Dynamic Routing and Flow Control
1 Pith paper cite this work, alongside 27 external citations. Polarity classification is still indexing.
1
Pith paper citing it
27
external citations · OpenAlex
fields
math.OC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Minimax adaptive control for finite sets of positive linear systems
Explicit minimax adaptive policies stabilize finite sets of positive LTI plants under adversarial disturbances with certified ℓ1-gain, via a history-variable Bellman inequality.