Multi-Objective Reachability for context-free MDPs

We study qualitative multi-objective reachability problems for context-free MDPs, or equivalently Ordered Branching Markov Decision Processes (OBMDPs), building on prior results on single-target reachability for Branching Markov Decision Processes (BMDPs). We provide two separate algorithms for “almost-sure” and “limit-sure” multi-target reachability for OBMDPs.

Authors

• Emanuel Martinov

Keywords

No keywords are indexed for this paper.