{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:47:03Z","timestamp":1767192423564},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174513"},{"type":"electronic","value":"9783642174520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17452-0_11","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T07:23:04Z","timestamp":1289978584000},"page":"175-191","source":"Crossref","is-referenced-by-count":40,"title":["Monte Carlo Value Iteration for Continuous-State POMDPs"],"prefix":"10.1007","author":[{"given":"Haoyu","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee Sun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vien A.","family":"Ngo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Bagnell, J.A., Kakade, S., Ng, A., Schneider, J.: Policy search by dynamic programming. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a016 (2003)"},{"key":"11_CR2","volume-title":"Dynamic Programming","author":"R.E. Bellman","year":"1957","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"issue":"11","key":"11_CR3","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.robot.2006.05.007","volume":"54","author":"A. Brooks","year":"2006","unstructured":"Brooks, A., Makarendo, A., Williams, S., Durrant-Whyte, H.: Parametric POMDPs for planning in continuous state spaces. Robotics & Autonomous Systems\u00a054(11), 887\u2013897 (2006)","journal-title":"Robotics & Autonomous Systems"},{"key":"11_CR4","unstructured":"Brunskill, E., Kaelbling, L., Lozano-Perez, T., Roy, N.: Continuous-state POMDPs with hybrid dynamics. In: Int. Symp. on Artificial Intelligence & Mathematics (2008)"},{"key":"11_CR5","volume-title":"Principles of Robot Motion : Theory, Algorithms, and Implementations","author":"H. Choset","year":"2005","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations, vol.\u00a0ch. 7. The MIT Press, Cambridge (2005)"},{"key":"11_CR6","unstructured":"Hansen, E.A.: Solving POMDPs by searching in policy space. In: Proc. AAAI Conf. on Artificial Intelligence, pp. 211\u2013219 (1998)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"He, R., Brunskill, E., Roy, N.: PUMA: Planning under uncertainty with macro-actions. In: Proc. AAAI Conf. on Artificial Intelligence (2010)","DOI":"10.1613\/jair.3171"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Hsiao, K., Kaelbling, L.P., Lozano-P\u00e9rez, T.: Grasping POMDPs. In: Proc. IEEE Int. Conf. on Robotics & Automation, pp. 4485\u20134692 (2007)","DOI":"10.1109\/ROBOT.2007.364201"},{"key":"11_CR9","unstructured":"Hsu, D., Lee, W.S., Rong, N.: What makes some POMDP problems easy to approximate? In: Advances in Neural Information Processing Systems (NIPS) (2007)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Hsu, D., Lee, W.S., Rong, N.: A point-based POMDP planner for target tracking. In: Proc. IEEE Int. Conf. on Robotics & Automation, pp. 2644\u20132650 (2008)","DOI":"10.1109\/ROBOT.2008.4543611"},{"issue":"1-2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"L.P. Kaelbling","year":"1998","unstructured":"Kaelbling, L.P., Littman, M.L., Cassandra, A.R.: Planning and acting in partially observable stochastic domains. Artificial Intelligence\u00a0101(1-2), 99\u2013134 (1998)","journal-title":"Artificial Intelligence"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kurniawati, H., Hsu, D., Lee, W.S.: SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In: Proc. Robotics: Science and Systems (2008)","DOI":"10.15607\/RSS.2008.IV.009"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"C. Papadimitriou","year":"1987","unstructured":"Papadimitriou, C., Tsisiklis, J.N.: The complexity of Markov decision processes. Mathematics of Operations Research\u00a012(3), 441\u2013450 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR14","unstructured":"Pineau, J., Gordon, G., Thrun, S.: Point-based value iteration: An anytime algorithm for POMDPs. In: Proc. Int. Jnt. Conf. on Artificial Intelligence, pp. 477\u2013484 (2003)"},{"key":"11_CR15","first-page":"2329","volume":"7","author":"J.M. Porta","year":"2006","unstructured":"Porta, J.M., Vlassis, N., Spaan, M.T.J., Poupart, P.: Point-based value iteration for continuous POMDPs. J. Machine Learning Research\u00a07, 2329\u20132367 (2006)","journal-title":"J. Machine Learning Research"},{"key":"11_CR16","unstructured":"Prentice, S., Roy, N.: The belief roadmap: Efficient planning in linear pomdps by factoring the covariance. In: Proc. Int. Symp. on Robotics Research (2007)"},{"issue":"1","key":"11_CR17","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1613\/jair.2567","volume":"32","author":"S. Ross","year":"2008","unstructured":"Ross, S., Pineau, J., Paquet, S., Chaib-Draa, B.: Online planning algorithms for POMDPs. J. Artificial Intelligence Research\u00a032(1), 663\u2013704 (2008)","journal-title":"J. Artificial Intelligence Research"},{"key":"11_CR18","unstructured":"Roy, N., Thrun, S.: Coastal navigation with mobile robots. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a012, pp. 1043\u20131049 (1999)"},{"key":"11_CR19","unstructured":"Smith, T., Simmons, R.: Point-based POMDP algorithms: Improved analysis and implementation. In: Proc. Uncertainty in Artificial Intelligence (2005)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Spaan, M.T.J., Vlassis, N.: A point-based POMDP algorithm for robot planning. In: Proc. IEEE Int. Conf. on Robotics & Automation (2004)","DOI":"10.1109\/ROBOT.2004.1307420"},{"key":"11_CR21","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"S. Thrun","year":"2000","unstructured":"Thrun, S.: Monte carlo POMDPs. In: Advances in Neural Information Processing Systems (NIPS). The MIT Press, Cambridge (2000)"},{"key":"11_CR22","volume-title":"Probabilistic Robotics","author":"S. Thrun","year":"2005","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics. The MIT Press, Cambridge (2005)"},{"key":"11_CR23","volume-title":"Complexity and Information","author":"J.F. Traub","year":"1998","unstructured":"Traub, J.F., Werschulz, A.G.: Complexity and Information. Cambridge University Press. Cambridge (1998)"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17452-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:53:26Z","timestamp":1606186406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17452-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174513","9783642174520"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17452-0_11","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2010]]}}}