Sciweavers

Share
FOIKS
2016
Springer

Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs

4 years 3 months ago
Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs
The ability of an agent to make quick, rational decisions in an uncertain environment is paramount for its applicability in realistic settings. Markov Decision Processes (MDP) provide such a framework, but can only model uncertainty that can be expressed as probabilities. Possibilistic counterparts of MDPs allow to model imprecise beliefs, yet they cannot accurately represent probabilistic sources of uncertainty and they lack the efficient online solvers found in the probabilistic MDP community. In this paper we advance the state of the art in three important ways. Firstly, we propose the first online planner for possibilistic MDP by adapting the Monte-Carlo Tree Search (MCTS) algorithm. A key component is the development of efficient search structures to sample possibility distributions based on the DPY transformation as introduced by Dubois, Prade, and Yager. Secondly, we introduce a hybrid MDP model that allows us to express both possibilistic and probabilistic uncertainty, where t...
Kim Bauters, Weiru Liu, Lluis Godo
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where FOIKS
Authors Kim Bauters, Weiru Liu, Lluis Godo
Comments (0)
books