eduzhai > Applied Sciences > Engineering >

An Anytime Algorithm for Reachability on Uncountable MDP

  • king
  • (0) Download
  • 20210506
  • Save

... pages left unread,continue reading

Document pages: 29 pages

Abstract: We provide an algorithm for reachability on Markov decision processes withuncountable state and action spaces, which, under mild assumptions,approximates the optimal value to any desired precision. It is the first suchanytime algorithm, meaning that at any point in time it can return the currentapproximation with its precision. Moreover, it simultaneously is the firstalgorithm able to utilize emph{learning} approaches without sacrificingguarantees and it further allows for combination with existing heuristics.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×