Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms
From MaRDI portal
Abstract: It is becoming increasingly apparent that probabilistic approaches can overcome conservatism and computational complexity of the classical worst-case deterministic framework and may lead to designs that are actually safer. In this paper we argue that a comprehensive probabilistic robustness analysis requires a detailed evaluation of the robustness function and we show that such evaluation can be performed with essentially any desired accuracy and confidence using algorithms with complexity linear in the dimension of the uncertainty space. Moreover, we show that the average memory requirements of such algorithms are absolutely bounded and well within the capabilities of today's computers. In addition to efficiency, our approach permits control over statistical sampling error and the error due to discretization of the uncertainty radius. For a specific level of tolerance of the discretization error, our techniques provide an efficiency improvement upon conventional methods which is inversely proportional to the accuracy level; i.e., our algorithms get better as the demands for accuracy increase.
Recommendations
- A new statistical approach for the analysis of uncertain systems
- scientific article; zbMATH DE number 1284122
- Probabilistic search algorithms for robust stability analysis and their complexity properties
- scientific article; zbMATH DE number 1679747
- Probabilistic Control of Nonlinear Uncertain Systems
Cited in
(16)- A new statistical approach for the analysis of uncertain systems
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
- Probabilistic enhancement of classical robustness margins: The unirectangularity concept
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Issues in robustness analysis
- Advanced probabilistic \(\mu\)-analysis techniques for AOCS validation
- How to Increase Robustness of Capable-to-Promise
- Robustness of feedback stabilization of quasi non-integrable Hamiltonian systems with parametric uncertainty
- Sample Reuse Techniques of Randomized Algorithms for Control under Uncertainty
- Probabilistic search algorithms for robust stability analysis and their complexity properties
- scientific article; zbMATH DE number 1284122 (Why is no real title available?)
- Constrained robustness analysis by randomized algorithms
- Fast Construction of Robustness Degradation Function
- Probabilistic evaluation of control system robustness†
- Probabilistic Control of Nonlinear Uncertain Systems
- Probabilistic Risk Analysis of Process Systems Considering Epistemic and Aleatory Uncertainties: A Comparison Study
This page was built for publication: Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399262)
