Information-guided Planning: An Online Approach for Partially Observable Problems
This paper presents IB-POMCP, a novel algorithm for online planning under partial observability. Our approach enhances the decision-making process by using estimations of the world belief's entropy to guide a tree search process and surpass the limitations of planning in scenarios with sparse reward configurations. By performing what we denominate as an *information-guided planning process*, the algorithm, which incorporates a novel I-UCB function, shows significant improvements in reward and reasoning time compared to state-of-the-art baselines in several benchmark scenarios, along with theoretical convergence guarantees.
Code (1)
Similar Papers 제목 키워드 기반
Adaptive Informative Path Planning with Multimodal Sensing
Adaptive Informative Path Planning (AIPP) problems model an agent tasked with obtaining information subject to resource constraints in unknown, partially observable environments. Existing work on AIPP has focused on repr…
Large-Language-Model-Guided State Estimation for Partially Observable Task and Motion Planning
Robot planning in partially observable environments, where not all objects are known or visible, is a challenging problem, as it requires reasoning under uncertainty through partially observable Markov decision processes…
Motion PlanningRollout Heuristics for Online Stochastic Contingent Planning
Partially observable Markov decision processes (POMDP) are a useful model for decision-making under partial observability and stochastic actions. Partially Observable Monte-Carlo Planning is an online algorithm for decid…
Decision MakingBetaZero: Belief-State Planning for Long-Horizon POMDPs using Learned Approximations
Real-world planning problems, including autonomous driving and sustainable energy applications like carbon storage and resource exploration, have recently been modeled as partially observable Markov decision processes (P…
Autonomous DrivingDecision MakingOnline Learning and Planning in Partially Observable Domains without Prior Knowledge
How an agent can act optimally in stochastic, partially observable domains is a challenge problem, the standard approach to address this issue is to learn the domain model firstly and then based on the learned model to f…