AI Chat AI Image Generator AI Video Text to Speech

Approximate Planning for Factored POMDPs using Belief State Simplification

01/23/2013

∙

by David A. McAllester, et al.

∙

∙

We are interested in the problem of planning for factored POMDPs. Building on the recent results of Kearns, Mansour and Ng, we provide a planning algorithm for factored POMDPs that exploits the accuracy-efficiency tradeoff in the belief state simplification introduced by Boyen and Koller.

David A. McAllester
2 publications
Satinder Singh
56 publications

research

∙ 08/21/2020

Compact Belief State Representation for Task Planning

Task planning in a probabilistic belief state domains allows generating ...

0 Evgenii Safronov, et al. ∙

research

∙ 01/21/2021

A practice-oriented overview of call center workforce planning

We give an overview of the practice and science of call center workforce...

0 Ger Koole, et al. ∙

research

∙ 09/28/2019

Dual Sequential Monte Carlo: Tunneling Filtering and Planning in Continuous POMDPs

We present the DualSMC network that solves continuous POMDPs by learning...

15 Yunbo Wang, et al. ∙

research

∙ 05/24/2021

Belief Space Planning: A Covariance Steering Approach

A new belief space planning algorithm, called covariance steering Belief...

0 Dongliang Zheng, et al. ∙

research

∙ 07/17/2022

Nonmyopic Distilled Data Association Belief Space Planning Under Budget Constraints

Autonomous agents operating in perceptually aliased environments should ...

0 Moshe Shienman, et al. ∙

research

∙ 03/09/2011

Planning Graph Heuristics for Belief Space Search

Some recent works in conditional planning have proposed reachability heu...

0 D. Bryce, et al. ∙

research

∙ 02/28/2018

Integrating Human-Provided Information Into Belief State Representation Using Dynamic Factorization

In partially observed environments, it can be useful for a human to prov...

0 Rohan Chitnis, et al. ∙