Saved in:
Bibliographic Details
Main Author: Pokharel, Gaurab
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.13754
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912039306264576
author Pokharel, Gaurab
author_facet Pokharel, Gaurab
contents Prior studies have demonstrated that for many real-world problems, POMDPs can be solved through online algorithms both quickly and with near optimality. However, on an important set of problems where there is a large time delay between when the agent can gather information and when it needs to use that information, these solutions fail to adequately consider the value of information. As a result, information gathering actions, even when they are critical in the optimal policy, will be ignored by existing solutions, leading to sub-optimal decisions by the agent. In this research, we develop a novel solution that rectifies this problem by introducing a new algorithm that improves upon state-of-the-art online planning by better reflecting on the value of actions that gather information. We do this by adding Entropy to the UCB1 heuristic in the POMCP algorithm. We test this solution on the hallway problem. Results indicate that our new algorithm performs significantly better than POMCP.
format Preprint
id arxiv_https___arxiv_org_abs_2409_13754
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Increasing the Value of Information During Planning in Uncertain Environments
Pokharel, Gaurab
Artificial Intelligence
Multiagent Systems
Robotics
Prior studies have demonstrated that for many real-world problems, POMDPs can be solved through online algorithms both quickly and with near optimality. However, on an important set of problems where there is a large time delay between when the agent can gather information and when it needs to use that information, these solutions fail to adequately consider the value of information. As a result, information gathering actions, even when they are critical in the optimal policy, will be ignored by existing solutions, leading to sub-optimal decisions by the agent. In this research, we develop a novel solution that rectifies this problem by introducing a new algorithm that improves upon state-of-the-art online planning by better reflecting on the value of actions that gather information. We do this by adding Entropy to the UCB1 heuristic in the POMCP algorithm. We test this solution on the hallway problem. Results indicate that our new algorithm performs significantly better than POMCP.
title Increasing the Value of Information During Planning in Uncertain Environments
topic Artificial Intelligence
Multiagent Systems
Robotics
url https://arxiv.org/abs/2409.13754