Task-Based Decomposition of Factored POMDPs

  title={Task-Based Decomposition of Factored POMDPs},
  author={Guy Shani},
  journal={IEEE Transactions on Cybernetics},
Recently, partially observable Markov decision processes (POMDP) solvers have shown the ability to scale up significantly using domain structure, such as factored representations. In many domains, the agent is required to complete a set of independent tasks. We propose to decompose a factored POMDP into a set of restricted POMDPs over subsets of task relevant state variables. We solve each such model independently, acquiring a value function. The combination of the value functions of the… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…