13 citations · 24 across the 7 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2019
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…
cs.AI2019
Reachability and Differential based Heuristics for Solving Markov Decision Processes
Shoubhik Debnath, Lantao Liu, Gaurav Sukhatme
The solution convergence of Markov Decision Processes (MDPs) can be accelerated by prioritized sweeping of states ranked by their potential impacts to other states. In this paper,…