Reachability Analysis in Stochastic Directed Graphs by Reinforcement Learning
From MaRDI portal
Publication:6137524
DOI10.1109/TAC.2022.3143080arXiv2202.12546OpenAlexW4205404404MaRDI QIDQ6137524FDOQ6137524
Authors: Corrado Possieri, Mattia Frasca, Alessandro Rizzo 
Publication date: 4 September 2023
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Abstract: We characterize the reachability probabilities in stochastic directed graphs by means of reinforcement learning methods. In particular, we show that the dynamics of the transition probabilities in a stochastic digraph can be modeled via a difference inclusion, which, in turn, can be interpreted as a Markov decision process. Using the latter framework, we offer a methodology to design reward functions to provide upper and lower bounds on the reachability probabilities of a set of nodes for stochastic digraphs. The effectiveness of the proposed technique is demonstrated by application to the diffusion of epidemic diseases over time-varying contact networks generated by the proximity patterns of mobile agents.
Full work available at URL: https://arxiv.org/abs/2202.12546
This page was built for publication: Reachability Analysis in Stochastic Directed Graphs by Reinforcement Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137524)
