Probabilistic reachable sets of stochastic nonlinear systems with contextual uncertainties

被引:0
作者
Shen, Xun [1 ]
Wang, Ye [2 ]
Hashimoto, Kazumune [1 ]
Wu, Yuhu [3 ]
Gros, Sebastien [4 ,5 ]
机构
[1] Osaka Univ, Grad Sch Engn, Osaka 5650871, Japan
[2] Univ Melbourne, Sch Math & Stat, Melbourne, Vic 3010, Australia
[3] Dalian Univ Technol, Key Lab Intelligent Control & Optimizat Ind Equipm, Minist Educ, Sch Control Sci & Engn, Dalian 116024, Peoples R China
[4] Norwegian Univ Sci & Technol NTNU, Ctr Autonomous Marine Operat & Syst, NO-7491 Trondheim, Norway
[5] Norwegian Univ Sci & Technol NTNU, Dept Engn Cybernet, NO-7491 Trondheim, Norway
基金
澳大利亚研究理事会; 日本学术振兴会;
关键词
Uncertainty quantification; Probabilistic reachable sets; Conditional probability; Stochastic nonlinear systems; Stochastic optimization; CHANCE-CONSTRAINED OPTIMIZATION; DATA-DRIVEN; SCENARIO APPROACH; APPROXIMATION APPROACH; STATE TRAJECTORIES; EXACT FEASIBILITY; ROBUST-CONTROL; IDENTIFICATION; INEQUALITIES; BOUNDS;
D O I
10.1016/j.automatica.2025.112237
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Validating and controlling safety-critical systems in uncertain environments necessitates probabilistic reachable sets of future state evolutions. The existing methods of computing probabilistic reachable sets normally assume that stochastic uncertainties are independent of system states, inputs, and other environment variables. However, this assumption falls short in many real-world applications, where the probability distribution governing uncertainties depends on these variables, referred to as contextual uncertainties. This paper addresses the challenge of computing probabilistic reachable sets of stochastic nonlinear states with contextual uncertainties by seeking minimum-volume polynomial sublevel sets with contextual chance constraints. The formulated problem cannot be solved by the existing sample-based approximation method since the existing methods do not consider conditional probability densities. To address this, we propose a consistent sample approximation of the original problem by leveraging conditional density estimation and resampling. The obtained approximate problem is a tractable optimization problem. Additionally, we prove the proposed sample-based approximation's almost uniform convergence, showing that it gives the optimal solution almost consistently with the original ones. Through a numerical example, we evaluate the effectiveness of the proposed method against existing approaches, highlighting its capability to significantly reduce the bias inherent in sample-based approximation without considering a conditional probability density. (c) 2025 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页数:14
相关论文
共 53 条
[1]   A Barrier-Based Scenario Approach to Verifying Safety-Critical Systems [J].
Akella, Prithvi ;
Ames, Aaron D. .
IEEE ROBOTICS AND AUTOMATION LETTERS, 2022, 7 (04) :11062-11069
[2]   A set-membership state estimation algorithm based on DC programming [J].
Alamo, T. ;
Bravo, J. M. ;
Redondo, M. J. ;
Camacho, E. F. .
AUTOMATICA, 2008, 44 (01) :216-224
[3]  
[Anonymous], 1991, Probability with Martingales
[4]   Wasserstein distributionally robust chance-constrained optimization for energy and reserve dispatch: An exact and physically-bounded formulation [J].
Arrigo, Adriano ;
Ordoudis, Christos ;
Kazempour, Jalal ;
De Greve, Zacharie ;
Toubeau, Jean-Francois ;
Vallee, Francois .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 296 (01) :304-322
[5]  
Bertsekas D. P., 2008, Introduction to Probability, V2nd
[6]  
Biau G, 2012, J MACH LEARN RES, V13, P1063
[7]  
Billingsley P, 1999, Wiley Series in Probability and Statistics, Vsecond, DOI DOI 10.1002/9780470316962
[8]   Frequency Response Data-Driven LPV Controller Synthesis for MIMO Systems [J].
Bloemers, Tom ;
Oomen, Tom ;
Toth, Roland .
IEEE CONTROL SYSTEMS LETTERS, 2022, 6 :2264-2269
[9]   The scenario approach to robust control design [J].
Calafiore, Giuseppe C. ;
Campi, Marco C. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (05) :742-753
[10]   A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality [J].
Campi, M. C. ;
Garatti, S. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2011, 148 (02) :257-280