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.
References
[1]
D. Axehill, L. Vandenberghe, and A. Hansson. Convex relaxations for mixed integer predictive control. Automatica, 46(5):1540--1545, June 2010.
[2]
D. Bauso. Boolean-controlled systems via receding horizon and linear programming. Journal of Mathematics of Control, Signals and Systems, 21(1):69--91, 2009.
[3]
D. Bauso, L. Giarrè, and R. Pesenti. Robust control of uncertain multi-inventory systems via linear matrix inequality. International Journal of Control, 83(8):1723--1740, 2010.
[4]
D. Bauso and D. C. Tarraf. Control of production-distribution systems under discrete disturbances and control actions. In Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, pages 680--6813, Orlando, FL, December 2011.
[5]
A. Ben-Tal, B. Golany, and S. Shtern. Robust multi-echelon multi-period inventory control. European Journal of Operational Research, 199(3):922--935, 2009.
[6]
D. P. Bertsekas. Infinite-time reachability of state-space regions by using feedback control. IEEE Transactions on Automatic Control, 17(5):604--613, 1972.
[7]
D. P. Bertsekas and I. B. Rhodes. On the minmax reachability of target sets and target tubes. Automatica, 7:233--247, 1971.
[8]
D. Bertsimas and A. Thiele. A robust optimization approach to inventory theory. Operations Research, 54(1):150--168, 2006.
[9]
F. Blanchini. Set invariance in control. Automatica, 35(11):1747--1767, 1999.
[10]
F. Blanchini, S. Miani, R. Pesenti, F. Rinaldi, and W. Ukovich. Robust control of production-distribution systems. In S. O. R. Moheimani, editor, Perspectives in Robust Control, volume 268 of Lecture Notes in Control and Information Sciences, pages 13--28. Springer, 2001.
[11]
F. Blanchini, S. Miani, and W. Ukovich. Control of production-distribution systems with unknown inputs and system failures. IEEE Transactions on Automatic Control, 45(6):1072--1081, June 2000.
[12]
F. Blanchini, F. Rinaldi, and W. Ukovich. Least inventory control of multi-storage systems with non-stochastic unknown input. IEEE Transactions on Robotics and Automation, 13(5):633--645, 1997.
[13]
F. Blanchini, F. Rinaldi, and W. Ukovich. A network design problem for a distribution system with uncertain demands. SIAM Journal on Optimization, 7(2):560--578, May 1997.
[14]
G. C. Goodwin and D. E. Quevedo. Finite alphabet control and estimation. International Journal of Control, Automation and Systems, 1(4):412--430, 2003.
[15]
S. V. Rakovic, E. Kerrigan, D. Mayne, and K. I. Kouramas. Optimized robust control invariance for linear discrete-time systems: Theoretical foundations. Automatica, 43(5):831--841, 2007.
[16]
D. C. Tarraf. A control-oriented notion of finite state approximation. IEEE Transactions on Automatic Control, 56(12):3197--3202, December 2012.
[17]
D. C. Tarraf. On the smallest robustly control invariant sets in finite alphabet logistics networks. In Proceedings of the Sixth International Conference on Network Games, Control and Optimization, Avignon, France, November 2012.
[18]
D. C. Tarraf and D. Bauso. Robust finite alphabet control of dynamic networks. Under review. Manuscript available attexttthttp://arxiv.org/abs/1111.0700.
[19]
D. C. Tarraf and D. Bauso. Robust control of networks under discrete disturbances and controls. In Proceedings of the Fifth International Conference on Network Games, Control and Optimization, pages 1--6, Paris, France, November 2011.
[20]
D. C. Tarraf, A. Megretski, and M. A. Dahleh. Finite state controllers for stabilizing switched systems with binary sensors. In A. Bemporad, A. Bicchi, and G. Buttazzo, editors, Hybrid Systems: Computation and Control, volume 4416 of Lecture Notes in Computer Science, pages 543--556. Springer, April 2007.
[21]
D. C. Tarraf, A. Megretski, and M. A. Dahleh. A framework for robust stability of systems over finite alphabets. IEEE Transactions on Automatic Control, 53(5):1133--1146, June 2008.
[22]
D. C. Tarraf, A. Megretski, and M. A. Dahleh. Finite approximations of switched homogeneous systems for controller synthesis. IEEE Transactions on Automatic Control, 56(5):1140--1145, May 2011.
[23]
P. R. D. Waal and J. H. V. Schuppen. A class of team problems with discrete action spaces: Optimality conditions based on multimodularity. SIAM Journal on Control and Optimization, 38(3):875--892, 2000.
Index Terms
- Bounding the smallest robustly control invariant sets in networks with discrete disturbances and controls
Recommendations
Control synthesis for invariant sets of families of linear and nonlinear discrete systems with bounded disturbances
Two sets of controlled linear and nonlinear discrete-time systems under bounded disturbances are analyzed. The control synthesis problem for these two sets of systems, including systems with nonlinear functions of a certain class, is constructively ...
Continuous-time probabilistic ultimate bounds and invariant sets
The concepts of ultimate bounds and invariant sets play a key role in several control theory problems, as they replace the notion of asymptotic stability in the presence of unknown disturbances. However, when the disturbances are unbounded, as in the ...
Computation of invariant sets via immersion for discrete-time nonlinear systems
AbstractIn this paper, we propose an approach for computing invariant sets of discrete-time nonlinear systems by lifting the nonlinear dynamics into a higher dimensional linear model. In particular, we focus on the maximal admissible invariant set ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 2013
152 pages
ISBN:9781450319614
DOI:10.1145/2461446
- General Chairs:
- S. Shankar Sastry,
- Tamer Başar,
- Program Chairs:
- Linda Bushnell,
- Larry Rohrbough
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 April 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
HiCoNS '13
Sponsor:
HiCoNS '13: 2nd ACM International Conference on High Confidence Networked Systems
April 9 - 11, 2013
Pennsylvania, Philadelphia, USA
Acceptance Rates
HiCoNS '13 Paper Acceptance Rate 18 of 37 submissions, 49%;
Overall Acceptance Rate 30 of 55 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 48Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in