Computer Science – Logic in Computer Science
Scientific paper
2009-09-09
Computer Science
Logic in Computer Science
Scientific paper
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability~1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDP s with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDP s with parity objectives and its subclasses.
Chatterjee Krishnendu
Doyen Laurent
Henzinger Thomas A.
No associations
LandOfFree
Qualitative Analysis of Partially-observable Markov Decision Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Qualitative Analysis of Partially-observable Markov Decision Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Qualitative Analysis of Partially-observable Markov Decision Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-385761