Solving Markov Decision Processes with Reachability Characterization from Mean First Passage Times

Shoubhik Debnath, Lantao Liu, Gaurav Sukhatme

A new mechanism for efficiently solving the Markov decision processes (MDPs) is proposed in this paper. We introduce the notion of reachability landscape where we use the Mean Firs…