Maximizing the probability of visiting a set infinitely often for a Markov decision process - Inria - Institut national de recherche en sciences et technologies du numérique
Preprints, Working Papers, ... (Working Paper) Year : 2022
No file

Dates and versions

hal-03853326 , version 1 (15-11-2022)

Identifiers

  • HAL Id : hal-03853326 , version 1

Cite

François Dufour, Tomás Prieto-Rumeau. Maximizing the probability of visiting a set infinitely often for a Markov decision process. 2022. ⟨hal-03853326⟩
42 View
0 Download

Share

More