Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Probabilistic reachable sets of stochastic nonlinear systems with contextual uncertainties (2403.12379v1)

Published 19 Mar 2024 in eess.SY, cs.SY, math.DS, and math.OC

Abstract: 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 the uncertainties are independent of the state. However, this assumption falls short in many real-world applications, where uncertainties are state-dependent, referred to as contextual uncertainties. This paper formulates the problem 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 the conditional probability densities. To address this, we propose a consistent sample approximation of the original problem by leveraging the conditional density estimation and resampling. The obtained approximate problem is a tractable optimization problem. Additionally, we prove the almost uniform convergence of the proposed sample-based approximation, 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. S. Haesaert, P.M. Van denHof, and A. Abate, “Data-driven and model-based verification via Bayesian identification and reachability analysis.” Automatica, vol. 79, pp. 115–126, 2017.
  2. X. Shen, T. Ouyang, Y. Zhang, X. Zhang, “Computing probabilistic bounds on state trajectories for uncertain systems.” IEEE Transactions on Emerging Topics in Computational Intelligence , vol. 7, no. 1, pp. 285 - 290, 2023.
  3. X. Shen, “Sample-based continuous approximation for computing probabilistic boundary of future state trajectory in uncertain dynamical systems.” IEEE Transactions on Emerging Topics in Computational Intelligence , early access, DOI: 10.1109/TETCI.2023.3332558.
  4. T. Bloemers, T. Oomen, and R. Toth, “Frequency response data-driven LPV controller synthesis for mimo systems.” IEEE Control Systems Letters, vol. 6, pp. 2264–2269, 2022.
  5. A. Karimi and C. Kammer, “A data-driven approach to robust control of multivariable systems by convex optimization.” Automatica, vol. 85, pp. 227–233, 2017.
  6. M. Zanon and S. Gros, “Safe reinforcement learning using robust MPC.” IEEE Transactions on Automatic Control, vol. 66, no. 8, pp. 3638–3652, 2021.
  7. P. Akella and A. Ames, “A barrier-based scenario approach to verifying safety-critical systems.” IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 11062 – 11069, 2022.
  8. Y. Wan, T. Keviczky, M. Verhaegen, and F. Gustafsson, “Data-driven robust receding horizon fault estimation.” Automatica, vol. 71, pp. 210–221, 2016.
  9. F. Dabbene, D. Henrion, C. Lagoa, and P. Shcherbakov, “Randomized approximations of the image set of nonlinear mappings with applications to filtering.” IFAC-PapersOnLine, vol. 48, no. 14, pp. 37–42, 2015.
  10. G. Calafiore and M. C. Campi, “The scenario approach to robust control design.” IEEE Transactions on Automatic Control, vol. 51, no. 5, pp. 742–753, 2006.
  11. X. Shen, T. Ouyang, N. Yang, J. Zhuang, “Sample-based neural approximation approach for probabilistic constrained programs,” IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 2, pp. 1058-1065, 2023.
  12. M. Campi, G. Calafiore, and S. Garatti, “Interval predictor models: identification and reliability.” Automatica, vol. 45, no. 2, pp. 382–392, 2009.
  13. K. Margellos, P. Goulart, and J. Lygeros, “On the road between robust optimization and the scenario approach for chance constrained optimization problems.” IEEE Transactions on Automatic Control, vol. 59, no. 8, pp. 2258–2263, 2014.
  14. T. Alamo, J. M. Bravo, M. J. Redondo, and E. F. Camacho, “A set-membership state estimation algorithm based on DC programming.” Automatica, vol. 44, pp. 216–224, 2008.
  15. M. Kishida and R. B. Braatz, “Ellipsoidal bounds on state trajectories for discrete-time systems with linear fractional uncertainties.” Optim. Eng., vol. 16, pp. 695–711, 2015.
  16. M. Campi and S. Garatti, “A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality.” Journal of Optimization Theory and Applications, vol. 148, no. 2, pp. 257–280, 2011.
  17. S. Garatti and M. Campi, “Risk and complexity in scenario optimization.” Mathematical Programming, vol. 191, pp. 243–279, 2022.
  18. L. Romao, A. Papachristodoulou, and K. Margellos, “On the exact feasibility of convex scenario programs with discarded constraints.” IEEE Transactions on Automatic Control, vol. 68, no. 4, pp. 1986–2001, 2022.
  19. J. Luedtke and S. Ahmed, “A sample approximation approach for optimization with probabilistic constraints.” SIAM Journal on Optimization, vol. 19, no. 2, pp. 674-699, 2008.
  20. X. Shen and S. Ito, “Approximate methods for solving chance-constrained linear programs in probability measure space.” Journal of Optimization Theory and Applications, early access, DOI: 10.1007/s10957.023.02342.w.
  21. A. Magnani, S. Lall, and S. Boyd, “Tractable fitting with convex polynomials via sum-of-squares,” in 44th IEEE Conference on Decision and Control, and the European Control Conference, 2005.
  22. C. Chen and O. Mangasarian, “Smoothing methods for convex inequalities and linear complementarity problems.” Mathematical Programming, vol. 71, no. 1, pp. 51–69, 1995.
  23. A. Geletu, A. Hoffmann, M. Kloppel, and P. Li, “An inner-outer approximation approach to chance constrained optimization.” SIAM Journal on Optimization, vol. 27, no. 3, pp. 1834–1857, 2017.
  24. G. Biau, “Analysis of a random forests model,” Journal of Machine Learning Research, vol. 13, pp. 1063–1095, 2012.
  25. M. Doring, L. Gyorfi, and H. Walk, “Rate of convergence of k-nearest-neighbor classification rule,” Journal of Machine Learning Research, vo. 18, pp. 8485–8500, 2017.
  26. K. Kozhasov and J.B. Lasserre, “Nonnegative forms with sublevel sets of minimal volume.” Mathematical Programming, vol. 193, pp. 485-498, 2022.
  27. H. Rahimian and B. Pagnoncelli, “Data-driven approximation of contextual chance-constrained stochastic programs.” SIAM Journal on Optimization, vol. 33, no. 3, pp. 2248–2274, 2023.
  28. A. Pena-Ordieres, J.R. Luedteke, and A. Wachter, “Solving chance-constrained problems via a smooth sample-based nonlinear approximation.” SIAM Journal on Optimization, vol. 30, no. 3, pp. 2221-2250, 2020.
  29. A. Kibzun and Y. Kan, “Stochastic Programming Problems with Probability and Quantile Functions.” Journal of the Operational Research Society, vol. 48, pp. 846-856, 1997.
  30. R.C.L. Wolff, Q. Yao, and P. Hall, “Methods for estimating a conditional distribution function.” Journal of the American Statistical Association , vol. 94, no. 445, pp. 154 - 163, 1999.
  31. M. Sugiyama, T. Suzuki, S. Nakajima, H. Kashima, P. vonBunau, and M. Kawanabe, “Direct importance estimation for covariate shift adaptation.” Annals of the Institute of Statistical Mathematics , vol. 60, pp. 699 - 746, 2008.
  32. T. Kanamori, S. Hido, and M. Sugiyama, “A least-squares approach to direct importance estimation.” Journal of Machine Learning Research, vol. 10, pp. 1391-1445, 2009.
  33. M. Sugiyama, I. Takeuchi, t. Suzuki, T. Kanamori, H. Hachiya, and D. Okanohara, “Least-squares conditional density estimation.” IEICE Transactions on Information and Systems , vol. E93-D, no. 3, pp. 583 - 594, 2010.
  34. M. Kang and T. Shen, “Receding horizon online optimization for torque control of gasoline engines.” ISA Trans. J. Autom., vol. 65, pp. 371-383, 2016.
  35. M. Campi and S. Garatti, “The exact feasibility of randomized solutions of uncertain convex programs.” SIAM Journal on Optimization, vol. 19, no. 3, pp. 1211–1230, 2008.
  36. B.P. Carlin, N.G. Polson, and D.S. Stoffer, “A Monte Carlo approach to nonnormal and nonlinear state-space modeling.” Journal of the American Statistical Association , vol. 87, no. 418, pp. 493-500, 1992.
  37. W. Hoeffding, “Probability inequalities for sums of bounded random variables.” Journal of the American Statistical Association, vol. 58, pp. 13–30, 1963.

Summary

We haven't generated a summary for this paper yet.