{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T12:51:23Z","timestamp":1689252683251},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10472-013-9361-y","type":"journal-article","created":{"date-parts":[[2013,5,30]],"date-time":"2013-05-30T07:06:39Z","timestamp":1369897599000},"page":"283-317","source":"Crossref","is-referenced-by-count":1,"title":["Planning for multiple measurement channels in a continuous-state POMDP"],"prefix":"10.1007","volume":"67","author":[{"given":"Mikko","family":"Lauri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Risto","family":"Ritala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,31]]},"reference":[{"key":"9361_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874651","volume-title":"Applied Dynamic Programming","author":"R Bellman","year":"1962","unstructured":"Bellman, R., Dreyfus, S.: Applied Dynamic Programming. Princeton University Press, Princeton (1962)"},{"key":"9361_CR2","volume-title":"Neuro-Dynamic Programming","author":"D Bertsekas","year":"1996","unstructured":"Bertsekas, D., Tsitsiklis, J.: Neuro-Dynamic Programming. Athena Scientific, Belmont (1996)"},{"key":"9361_CR3","volume-title":"Pattern Recognition and Machine Learning","author":"C Bishop","year":"2006","unstructured":"Bishop, C.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"issue":"11","key":"9361_CR4","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.robot.2006.05.007","volume":"54","author":"A Brooks","year":"2006","unstructured":"Brooks, A., Makarenko, A., Williams, S., Durrant-Whyte, H.: Parametric POMDPs for planning in continuous state spaces. Robot. Auton. Syst. 54(11), 887\u2013897 (2006)","journal-title":"Robot. Auton. Syst."},{"issue":"3\u20134","key":"9361_CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10472-010-9202-1","volume":"58","author":"E Brunskill","year":"2010","unstructured":"Brunskill, E., Kaelbling, L.P., Lozano-P\u00e9rez, T., Roy, N.: Planning in partially-observable switching-mode continuous domains. Ann. Math. Artif. Intel. 58(3\u20134), 185\u2013216 (2010)","journal-title":"Ann. Math. Artif. Intel."},{"key":"9361_CR6","unstructured":"Cassandra, A.: Exact and approximate algorithms for partially observable Markov decision processes. Ph.D. thesis, Brown University, Providence, RI (1998)"},{"issue":"3","key":"9361_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10626-009-0071-x","volume":"19","author":"EKP Chong","year":"2009","unstructured":"Chong, E.K.P., Kreucher, C.M., Hero, A.O.: Partially observable markov decision process approximations for adaptive sensing. Discrete Event Dyn. S. 19(3), 377\u2013422 (2009)","journal-title":"Discrete Event Dyn. S."},{"key":"9361_CR8","doi-asserted-by":"crossref","unstructured":"Dallaire, P., Besse, C., Ross, S., Chaib-Draa, B.: Bayesian reinforcement learning in continuous POMDPs with gaussian processes. In: Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 2604\u20132609 (2009)","DOI":"10.1109\/IROS.2009.5354013"},{"key":"9361_CR9","unstructured":"Drake, A.: Observation of a Markov process through a noisy channel. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA (1962)"},{"key":"9361_CR10","unstructured":"Goldberger, J., Roweis, S.: Hierarchical clustering of a mixture model. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a017, pp. 505\u2013512 (2005)"},{"key":"9361_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1613\/jair.678","volume":"13","author":"M Hauskrecht","year":"2000","unstructured":"Hauskrecht, M.: Value-function approximations for partially observable Markov decision processes. J. Artif. Intell. Res. 13, 33\u201394 (2000)","journal-title":"J. Artif. Intell. Res."},{"issue":"1\u20132","key":"9361_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"L Kaelbling","year":"1998","unstructured":"Kaelbling, L., Littman, M., Cassandra, A.: Planning and acting in partially observable stochastic domains. Artif. Intell. 101(1\u20132), 99\u2013134 (1998)","journal-title":"Artif. Intell."},{"issue":"10","key":"9361_CR13","doi-asserted-by":"crossref","first-page":"4938","DOI":"10.1109\/TSP.2007.897908","volume":"55","author":"V Krishnamurthy","year":"2007","unstructured":"Krishnamurthy, V., Djonin, D.V.: Structured threshold policies for dynamic sensor scheduling\u2014a partially observed Markov decision process approach. IEEE Trans. Signal Proces. 55(10), 4938\u20134957 (2007)","journal-title":"IEEE Trans. Signal Proces."},{"key":"9361_CR14","doi-asserted-by":"crossref","unstructured":"Kurniawati, H., Hsu, D., Lee, W.: SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In: Proceedings of Robotics: Science and Systems conference (RSS) (2008)","DOI":"10.15607\/RSS.2008.IV.009"},{"issue":"6","key":"9361_CR15","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.dsp.2007.05.004","volume":"19","author":"Y Li","year":"2009","unstructured":"Li, Y., Krakow, L., Chong, E., Groom, K.: Approximate stochastic dynamic programming for sensor scheduling to track multiple targets. Digit. Signal Process. 19(6), 978\u2013989 (2009)","journal-title":"Digit. Signal Process."},{"issue":"1","key":"9361_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02055574","volume":"28","author":"W Lovejoy","year":"1991","unstructured":"Lovejoy, W.: A survey of algorithmic methods for partially observed Markov decision processes. Ann. Oper. Res. 28(1), 47\u201365 (1991)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9361_CR17","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"C-32","author":"T Lozano-Perez","year":"1983","unstructured":"Lozano-Perez, T.: Spatial planning: a configuration space approach. IEEE Trans. Comput. C-32(2), 108\u2013120 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"9361_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10514-009-9130-2","volume":"27","author":"R Martinez-Cantin","year":"2009","unstructured":"Martinez-Cantin, R., de\u00a0Freitas, N., Brochu, E., Castellanos, J., Doucet, A.: A Bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot. Auton. Robot 27(2), 93\u2013103 (2009)","journal-title":"Auton. Robot"},{"key":"9361_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/0471721182","volume-title":"Finite Mixture Models.","author":"G McLachlan","year":"2000","unstructured":"McLachlan, G., Peel, D.: Finite Mixture Models. Wiley, New York (2000)"},{"issue":"5","key":"9361_CR20","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TAC.1967.1098668","volume":"12","author":"L Meier","year":"1967","unstructured":"Meier, L., Peschon, J., Dressler, R.: Optimal control of measurement subsystems. IEEE Trans. Automat. Control 12(5), 528\u2013536 (1967)","journal-title":"IEEE Trans. Automat. Control"},{"issue":"1","key":"9361_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.28.1.1","volume":"28","author":"G Monahan","year":"1982","unstructured":"Monahan, G.: A survey of partially observable Markov decision processes: Theory, models, and algorithms. Manag. Sci. 28(1), 1\u201316 (1982)","journal-title":"Manag. Sci."},{"issue":"1","key":"9361_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1613\/jair.2078","volume":"27","author":"J Pineau","year":"2006","unstructured":"Pineau, J., Gordon, G., Thrun, S.: Anytime point-based approximations for large POMDPs. J. Artif. Intell. Res. 27(1), 335\u2013380 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"9361_CR23","first-page":"2329","volume":"7","author":"J Porta","year":"2006","unstructured":"Porta, J., Vlassis, N., Spaan, M., Poupart, P.: Point-based value iteration for continuous POMDPs. J. Mach. Learn. Res. 7, 2329\u20132367 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9361_CR24","unstructured":"Poupart, P.: Exploiting structure to efficiently solve large scale partially observable Markov decision processes. Ph.D. thesis, University of Toronto, Toronto, Canada (2005)"},{"key":"9361_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"Approximate Dynamic Programming: Solving the Curses of Dimensionality.","author":"W Powell","year":"2007","unstructured":"Powell, W.: Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley, New York (2007)"},{"issue":"2","key":"9361_CR26","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0022-247X(69)90163-2","volume":"26","author":"K \u00c5str\u00f6m","year":"1969","unstructured":"\u00c5str\u00f6m, K.: Optimal control of Markov processes with incomplete state information. J. Math. Anal. Appl. 26(2), 403\u2013406 (1969)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"9361_CR27","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. Artif. Intell. Res. 32(1), 663\u2013704 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"9361_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2005.06.002","volume":"23","author":"N Roy","year":"2005","unstructured":"Roy, N., Gordon, G., Thrun, S.: Finding approximate POMDP solutions through belief compression. J. Artif. Intell. Res. 23(1), 1\u201340 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"9361_CR29","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2010","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Upper Saddle River (2010)","edition":"3"},{"issue":"5","key":"9361_CR30","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1287\/opre.21.5.1071","volume":"21","author":"R Smallwood","year":"1973","unstructured":"Smallwood, R., Sondik, E.: The optimal control of partially observable Markov processes over a finite horizon. Oper. Res. 21(5), 1071\u20131088 (1973)","journal-title":"Oper. Res."},{"key":"9361_CR31","unstructured":"Smith, T., Simmons, R.: Heuristic search value iteration for POMDPs. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI), pp.\u00a0520\u2013527 (2004)"},{"issue":"1","key":"9361_CR32","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1613\/jair.1659","volume":"24","author":"M Spaan","year":"2005","unstructured":"Spaan, M., Vlassis, N.: Perseus: Randomized point-based value iteration for POMDPs. J. Artif. Intell. Res. 24(1), 195\u2013220 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"9361_CR33","unstructured":"Thrun, S.: Monte carlo POMDPs. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a012, pp. 1064\u20131070 (2000)"},{"key":"9361_CR34","volume-title":"Probabilistic Robotics","author":"S Thrun","year":"2006","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics. MIT Press, Cambridge (2006)"},{"issue":"4","key":"9361_CR35","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TNN.2010.2040835","volume":"21","author":"K Zhang","year":"2010","unstructured":"Zhang, K., Kwok, J.T.: Simplifying mixture models through function approximation. IEEE Trans. Neural Netw. 21(4), 644\u2013658 (2010)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"9361_CR36","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1613\/jair.761","volume":"14","author":"N Zhang","year":"2001","unstructured":"Zhang, N., Zhang, W.: Speeding up the convergence of value iteration in partially observable Markov decision processes. J. Artif. Intell. Res. 14(1), 29\u201351 (2001)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"9361_CR37","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/TAC.2010.2042005","volume":"55","author":"E Zhou","year":"2010","unstructured":"Zhou, E., Fu, M.C., Marcus, S.I.: Solving continuous-state POMDPs via density projection. IEEE Trans. Automat. Control 55(5), 1101\u20131116 (2010)","journal-title":"IEEE Trans. Automat. Control"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9361-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9361-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9361-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T07:26:02Z","timestamp":1563089162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9361-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":37,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9361"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9361-y","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}