MDPs with Energy-Parity Objectives [article]

Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017 arXiv   pre-print
Energy-parity objectives combine ω-regular with quantitative objectives of reward MDPs. The controller needs to avoid to run out of energy while satisfying a parity objective. We refute the common belief that, if an energy-parity objective holds almost-surely, then this can be realised by some finite memory strategy. We provide a surprisingly simple counterexample that only uses coBüchi conditions. We introduce the new class of bounded (energy) storage objectives that, when combined with parity
more » ... objectives, preserve the finite memory property. Based on these, we show that almost-sure and limit-sure energy-parity objectives, as well as almost-sure and limit-sure storage parity objectives, are in NP∩coNP and can be solved in pseudo-polynomial time for energy-parity MDPs.
arXiv:1701.02546v3 fatcat:ddj2qmikvbawdizanefbpjgof4