{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:18:57Z","timestamp":1725484737071},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424642"},{"type":"electronic","value":"9783540446521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44652-4_8","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:39:07Z","timestamp":1180658347000},"page":"72-83","source":"Crossref","is-referenced-by-count":1,"title":["Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs"],"prefix":"10.1007","author":[{"given":"Nevin L.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0022-247X(65)90154-X","volume":"10","author":"K. J. Astrom","year":"1965","unstructured":"K. J. Astrom. Optimal control of Markov decision processes with incomplete state estimation. Journal of Mathematical Analysis and Applications, 10, 174\u2013205, 1965.","journal-title":"Journal of Mathematical Analysis and Applications"},{"unstructured":"A. R. Cassandra, M. L. Littman, and N. L. Zhang. Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes. Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, 54\u201361, 1997.","key":"8_CR2"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0004-3702(94)00086-G","volume":"76","author":"T. Dean","year":"1995","unstructured":"T. Dean, L. P. Kaelbling, J. Kirman and A. Nicholson. Planning under time constraints in stochastic domains. Artificial Intelligence, Vol 76, Num 1\u20132, 35\u201374, 1995.","journal-title":"Artificial Intelligence"},{"unstructured":"E. A. Hansen. Finite-memory controls of partially observable systems. PhD thesis, Depart of Computer Science, University of Massachusetts at Amherst, 1998.","key":"8_CR4"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1613\/jair.678","volume":"13","author":"M. Hauskrecht","year":"2000","unstructured":"M. Hauskrecht. Value-function approximations for partially observable Markov decision processes. Journal of Artificial Intelligence Research, 13, 33\u201394, 2000.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"L. P. Kaelbling","year":"1998","unstructured":"L. P. Kaelbling, M. L. Littman and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101, 99\u2013134, 1998.","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"M. L. Littman, A. R. Cassandra and L. P. Kaelbling. Learning policies for partially observable environments: scaling up. Proceedings of the Twelfth International Conference on Machine Learning, 263\u2013370, 1995.","key":"8_CR7","DOI":"10.1016\/B978-1-55860-377-6.50052-9"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"C. H. Papadimitriou","year":"1987","unstructured":"C. H. Papadimitriou and J. N. Tsitsiklis(1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12(3), 441\u2013450, 1987.","journal-title":"Mathematics of Operations Research"},{"unstructured":"E. J. Sondik. The optimal control of partially observable Markov processes. PhD thesis, Stanford University, 1971.","key":"8_CR9"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1613\/jair.419","volume":"7","author":"N. L. Zhang","year":"1997","unstructured":"N. L. Zhang and W. Liu. A model approximation scheme for planning in stochastic domains. Journal of Artificial Intelligence Research, 7, 199\u2013230, 1997.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1613\/jair.761","volume":"14","author":"N. L. Zhang","year":"2001","unstructured":"N. L. Zhang and W. Zhang. Speeding up the convergence of value iteration in partially observable Markov decision processes. Journal of Artificial Intelligence Research, 14, 29\u201351, 2001.","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44652-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:14:40Z","timestamp":1550351680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44652-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424642","9783540446521"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44652-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}