Randomized Algorithms for Analysis and Control of Uncertain Systems
By Roberto Tempo, Giuseppe Carlo Calafiore, Fabrizio Dabbene. 2004
679 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/9f898b3c7a2dab9d5a5d1b836c1d39c0e1fe2aec
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Matthias Althoff
- Martin Takác
- Peter Richtárik
- Marco Claudio Campi
- Giuseppe Carlo Calafiore
- Simone Garatti
- Nicolas Loizou
- Jakub Konecný
In Control and Systems Engineering
- Simone Garatti
- Marco Claudio Campi
- Matthias Althoff
- Giuseppe Carlo Calafiore
- Fabrizio Dabbene
- Martin Takác
- Peter Richtárik
- Ali Mesbah
Citations in the corpus
- Optimization under uncertainty with applications to design of truss structures (2008, background): “We refer the reader to Tempo et al. (2004) and Calafiore and Dabbene (2006) for an overview of randomized algorithms and their application to robustness problems and for pointers to the related literature.”
- Novel Multidimensional Models of Opinion Dynamics in Social Networks (2015, neutral): “6b) we have [25 , 25 , 25 , 25 , 25 , 25 , 25 , 25] ⊤ .”
- The scenario approach to robust control design (2006, methodology): “More recently, a slight modification has been introduced in these algorithms in order to force an exit from the inner loop, see [26, 62, 50].”
- Reachability Analysis and its Application to the Safety Assessment of Autonomous Cars (2010, methodology): “The same idea has been used to generate random matrices in [160].”
- A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality (2011, background): “…to spread in the context of stochastic optimization due to the increase of computing capabilities, see e.g. [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35], and sample-based optimization has also been used in connection of various application domains, see e.g. [36] [37] [38] [39] [40].”
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (2017, background): “However, probabilistic ideas are also increasingly and successfully penetrating “continuous” fields, such as numerical linear algebra [70, 11, 12, 73, 38, 63, 2], optimization [31, 45, 47, 58, 72, 52], control theory [5, 6, 75], machine learning [65, 59, 27, 15, 56], and signal processing [8, 28].”