210 ms·
POMDPs? Are those considered to be much simpler problems? Well, solving a Partially Observed Markov Decision Processes in general isn't just NP-complete but ac
by joe_the_user 4y ago
POMDPs? Are those considered to be much simpler problems?
Well, solving a Partially Observed Markov Decision Processes in general isn't just NP-complete but actually undecidable. So I'm not sure how one measures SOTA (state of the art).
- thomasahle 4y ago> I'm not sure how one measures SOTA (state of the art). You measure it by practical performance on a test suite of important POMDPs and games.