Abstract
This paper introduces a new filtering technique to speed up computation for finding exact policies for Partially Observable Markov Decision Problems (POMDP). We consider a new technique, called Scan Line Filter (SCF) for the Incremental Pruning (IP) POMDP exact solver to introduce an alternative method to Linear Programming (LP) filter. This technique takes its origin from the scan line method in computer graphics. By using a vertical scan line or plane, we show that a high-quality exact POMDP policy can be found easily and quickly. In this paper, we tested this new technique against the popular Incremental Pruning (IP) exact solution method in order to measure the relative speed and quality of our new method. We show that a high-quality POMDP policy can be found in lesser time in some cases. Furthermore, SCF has solutions for several POMDP problems that LP could not converge to in 12 hours.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Monahan, G.E.: A survey of partially observable Markov decision processes. Management Science 28(1), 1–16 (1982)
Smallwood, R.D., Sondik, E.J.: The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21, 1071–1088 (1973)
Caines, P.E.: Linear Stochastic Systems. John Wiley, New York ( April 1988)
Spaan, M.T.J.: Cooperative active perception using POMDPs. In: AAAI 2008 Workshop on Advancements in POMDP Solvers (July 2008)
Goldsmith, J., Mundhenk, M.: Complexity issues in Markov decision processes. In: Proceedings of the IEEE Conference on Computational Complexity. IEEE, Los Alamitos (1998)
Spaan, M.T.J., Vlassis, N.: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research 24, 195–220 (2005)
Cassandra, A., Littman, M.L., Zhang, N.L.: Incremental pruning: A simple, fast, exact algorithm for partially observable Markov decision processes. In: Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (1997)
Thrun, S., Burgard, W., Fox, D.: Probablistic Robotics. The MIT Press, Cambridge (June 2006)
Spaan, M.T.J., Vlassis, N.: Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research 24, 195–220 (2005)
Pineau, J., Gordon, G., Thrun, S.: Point-based value iteration: An anytime algorithm for POMDPs. In: Proceedings of the International Joint Conference on Artificial Intelligence, Acapulco, Mexico (2003)
Cassandra, A.R.: Tony’s POMDP file repository page (July 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naser-Moghadasi, M. (2010). A New Pruning Method for Incremental Pruning Algorithm Using a Sweeping Scan-Line through the Belief Space. In: Sidorov, G., Hernández Aguirre, A., Reyes García, C.A. (eds) Advances in Artificial Intelligence. MICAI 2010. Lecture Notes in Computer Science(), vol 6437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16761-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-16761-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16760-7
Online ISBN: 978-3-642-16761-4
eBook Packages: Computer ScienceComputer Science (R0)