Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Stefano Miani

dblp:76/3677 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
inventory management
0.012003
Stabilization of multi-inventory systems with uncertain demand and setups · IEEE Trans. Robotics Autom. 2003

Methods — techniques the papers use, named apart from their topics

worst-case analysis · 0.0stabilizability analysis · 0.0quantized control · 0.0
YearPublicationVenuePosition
2003 Stabilization of multi-inventory systems with uncertain demand and setups
abstract
In this paper, we consider different aspects of the problem of controlling a multi-inventory system in the presence of uncertain demand and setups. The demand is unknown but bounded in an assigned compact set. The control input is assumed to be constant in its operating regime and to incur setup whenever a variation of this regime is required. Both setup times and setup configurations are unknown. We provide necessary and sufficient stabilizability conditions which turn out to be the same in the case in which there are no setups. Stabilization can be achieved, provided that the planning horizon is large enough and a computable lower bound is given. We also face the problem of ultimately confining the state in an assigned constraint set and provide conditions on this set for the problem to be feasible. Furthermore, we consider the case in which the controls are quantized, as in the case of systems which work in a switching mode. Finally, we deal with the case in which multiple setups may happen during the planning horizon.
Franco Blanchini, Stefano Miani, Raffaele Pesenti, Franca Rinaldi
IEEE Trans. Robotics Autom.2