DeepAI AI Chat
Log In Sign Up

Reachability analysis in stochastic directed graphs by reinforcement learning

by   Corrado Possieri, et al.
Politecnico di Torino
University of Catania
Consiglio Nazionale delle Ricerche

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.


page 1

page 2

page 3

page 4


On the Complexity of Reachability in Parametric Markov Decision Processes

This paper studies parametric Markov decision processes (pMDPs), an exte...

KL-learning: Online solution of Kullback-Leibler control problems

We introduce a stochastic approximation method for the solution of an er...

Armoured Fighting Vehicle Team Performance Prediction against Missile Attacks with Directed Energy Weapons

A recent study has introduced a procedure to quantify the survivability ...

Learning the Arrow of Time

We humans seem to have an innate understanding of the asymmetric progres...

Sampling-Based Verification of CTMCs with Uncertain Rates

We employ uncertain parametric CTMCs with parametric transition rates an...

Reachability-Aware Laplacian Representation in Reinforcement Learning

In Reinforcement Learning (RL), Laplacian Representation (LapRep) is a t...