{"id":1400,"date":"2023-07-21T09:54:52","date_gmt":"2023-07-21T08:54:52","guid":{"rendered":"https:\/\/babel.isa.uma.es\/kipr\/?p=1400"},"modified":"2023-07-21T09:54:52","modified_gmt":"2023-07-21T08:54:52","slug":"safety-in-mdps-by-measuring-the-probability-of-reaching-dangerous-states","status":"publish","type":"post","link":"https:\/\/babel.isa.uma.es\/kipr\/?p=1400","title":{"rendered":"Safety in MDPs by measuring the probability of reaching dangerous states"},"content":{"rendered":"<h4>Rafal Wisniewski, Luminita-Manuela Bujorianu, <strong>Safety of stochastic systems: An analytic and computational approach,<\/strong> . Automatica, Volume 133, 2021 <a href=\"https:\/\/doi.org\/10.1016\/j.automatica.2021.109839\" target=\"_blank\">DOI: 10.1016\/j.automatica.2021.109839<\/a>.<\/h4>\n<blockquote><p> We refine the concept of stochastic reach avoidance for a general class of Markov processes introducing a threshold of p for the reaching probability. This new problem is called p-safety, and it aims to ensure that the given process reaches a forbidden set before leaving its \u2018working\u2019 state space with a probability of less than p. In the situation when an initial probability measure characterizes the initial states, a variant of p-safety is put forward. We call this form of safety weak p-safety. In this work, we characterize both p-safety and weak p-safety and show how to compute them. We employ semi-definite programming to compute p-safety and linear programming to compute weak p-safety. To get to this point, we use certificates of positivity of polynomials translated into the sum of squares and the Bernstein forms.<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"<p>Rafal Wisniewski, Luminita-Manuela Bujorianu, Safety of stochastic systems: An analytic and computational approach, . Automatica, Volume 133, 2021 DOI: 10.1016\/j.automatica.2021.109839. <span class=\"ellipsis\">&hellip;<\/span> <span class=\"more-link-wrap\"><a href=\"https:\/\/babel.isa.uma.es\/kipr\/?p=1400\" class=\"more-link\"><span>Read More &rarr;<\/span><\/a><\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[37],"tags":[122,473],"class_list":["post-1400","post","type-post","status-publish","format-standard","hentry","category-artificial-intelligence","tag-mdps","tag-safety"],"_links":{"self":[{"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=\/wp\/v2\/posts\/1400"}],"collection":[{"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1400"}],"version-history":[{"count":1,"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=\/wp\/v2\/posts\/1400\/revisions"}],"predecessor-version":[{"id":1401,"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=\/wp\/v2\/posts\/1400\/revisions\/1401"}],"wp:attachment":[{"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1400"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1400"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/babel.isa.uma.es\/kipr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1400"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}