1 Hit in 5.9 sec

An Anytime Algorithm for Reachability on Uncountable MDP [article]

Kush Grover, Jan Křetínský, Tobias Meggendorfer, Maximilian Weininger
<span title="2020-08-10">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Moreover, it simultaneously is the first algorithm able to utilize learning approaches without sacrificing guarantees and it further allows for combination with existing heuristics.  ...  We provide an algorithm for reachability on Markov decision processes with uncountable state and action spaces, which, under mild assumptions, approximates the optimal value to any desired precision.  ...  In Yu-Fang Chen, Chih-Hong Cheng, and Javier Esparza, editors, Automated Technology for Verification and Analysis -17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:2008.04824v1</a> <a target="_blank" rel="external noopener" href="">fatcat:54e5csqhojhdpc6brhwero4plq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>