Anytime point-based approximations for large POMDPS
From MaRDI portal
Recommendations
Cited in
(31)- Cost-sensitive feature acquisition and classification
- Near optimal approximations and finite memory policies for POMPDs with continuous spaces
- Point-based value iteration for continuous POMDPs
- A fast approximation method for partially observable Markov decision processes
- Learning and planning in partially observable environments without prior domain knowledge
- Recursively modeling other agents for decision making: a research perspective
- Probabilistic planning with clear preferences on missing information
- An Uncertainty-Based Belief Selection Method for POMDP Value Iteration
- scientific article; zbMATH DE number 1844464 (Why is no real title available?)
- Heuristic anytime approaches to stochastic decision processes
- POMDP planning for robust robot control
- Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs
- Active visual perception for mobile robot localization
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains
- The Bayesian search game
- Policy iteration for bounded-parameter POMDPs
- Knowledge-based programs as succinct policies for partially observable domains
- A Fenchel-Moreau-Rockafellar type theorem on the Kantorovich-Wasserstein space with applications in partially observable Markov decision processes
- Partially observable Markov decision processes with imprecise parameters
- Motion planning under uncertainty for robotic tasks with long time horizons
- Point-Based Online Value Iteration Algorithm for POMDPs
- scientific article; zbMATH DE number 2243378 (Why is no real title available?)
- scientific article; zbMATH DE number 2243398 (Why is no real title available?)
- Planning for multiple measurement channels in a continuous-state POMDP
- Planning and learning in partially observable systems via filter stability
- Monte Carlo information-oriented planning
- scientific article; zbMATH DE number 7625164 (Why is no real title available?)
- Point-based value iteration for finite-horizon POMDPs
- Reasoning and predicting POMDP planning complexity via covering numbers
- Simplified risk-aware decision making with belief-dependent rewards in partially observable domains
This page was built for publication: Anytime point-based approximations for large POMDPS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624036)
