AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Symposium on Combinatorial Search, 8

PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces

Authors

Zongzhang Zhang,David Hsu,Wee Sun Lee,Zhan Wei Lim,Aijun Bai

Soochow University,National University of Singapore,National University of Singapore,National University of Singapore,University of Science and Technology of China


Proceedings:

Proceedings of the International Symposium on Combinatorial Search, 8

Volume

Issue:

Vol. 8 No. 1 (2015): Eighth Annual Symposium on Combinatorial Search

Track:

Abstracts

Downloads:

Download PDF

Abstract:

This paper provides a novel POMDP planning method, called Palm LEAf SEarch (PLEASE), which allows the selection of more than one outcome when their potential impacts are close to the highest one during its forward exploration. Compared with existing trial-based algorithms, PLEASE can save considerable time to propagate the bound improvements of beliefs in deep levels of the search tree to the root belief because of fewer backup operations. Experiments showed that PLEASE scales up SARSOP, one of the fastest algorithms, by orders of magnitude on some POMDP tasks with large observation spaces.

DOI:

10.1609/socs.v6i1.18339


SOCS

Vol. 8 No. 1 (2015): Eighth Annual Symposium on Combinatorial Search