{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:51:11Z","timestamp":1743025871966,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044274"},{"type":"electronic","value":"9783642044281"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04428-1_13","type":"book-chapter","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T12:05:58Z","timestamp":1255089958000},"page":"144-155","source":"Crossref","is-referenced-by-count":2,"title":["Finding Best k Policies"],"prefix":"10.1007","author":[{"given":"Peng","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judy","family":"Goldsmith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.575","volume":"11","author":"C. Boutilier","year":"1999","unstructured":"Boutilier, C., Dean, T., Hanks, S.: Decision-theoretic planning: Structural assumptions and computational leverage. J. of Artificial Intelligence Research\u00a011, 1\u201394 (1999)","journal-title":"J. of Artificial Intelligence Research"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bonet, B., Geffner, H.: Planning with incomplete information as heuristic search in belief space. In: ICAPS, pp. 52\u201361 (2000)","DOI":"10.1007\/10720246_28"},{"key":"13_CR4","unstructured":"Bresina, J.L., Dearden, R., Meuleau, N., Ramkrishnan, S., Smith, D.E., Washington, R.: Planning under continuous time and resource uncertainty: A challenge for AI. In: UAI, pp. 77\u201384 (2002)"},{"key":"13_CR5","unstructured":"Bresina, J.L., J\u00f3nsson, A.K., Morris, P.H., Rajan, K.: Activity planning for the mars exploration rovers. In: ICAPS, pp. 40\u201349 (2005)"},{"key":"13_CR6","unstructured":"Aberdeen, D., Thi\u00e9baux, S., Zhang, L.: Decision-theoretic military operations planning. In: ICAPS, pp. 402\u2013412 (2004)"},{"key":"13_CR7","unstructured":"Musliner, D.J., Carciofini, J., Goldman, R.P., Durfee, E.H., Wu, J., Boddy, M.S.: Flexibly integrating deliberation and execution in decision-theoretic agents. In: ICAPS Workshop on Planning and Plan-Execution for Real-World Systems (2007)"},{"key":"13_CR8","unstructured":"Galand, L., Perny, P.: Search for compromise solutions in multiobjective state space graphs. In: ECAI, pp. 93\u201397 (2006)"},{"key":"13_CR9","unstructured":"Bryce, D., Cushing, W., Kambhampati, S.: Probabilistic planning is multiobjective! Technical Report ASU CSE TR-07-006 (June 2007)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1016\/j.ejor.2005.06.011","volume":"175","author":"L.R. Nielsen","year":"2006","unstructured":"Nielsen, L.R., Kristensen, A.R.: Finding the k best policies in finite-horizon mdps. European Journal of Operational Research\u00a0175(2), 1164\u20131179 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.orl.2005.04.008","volume":"34","author":"L.R. Nielsen","year":"2006","unstructured":"Nielsen, L.R., Pretolani, D., Andersen, K.A.: Finding the k shortest hyperpaths using reoptimization. Oper. Res. Lett.\u00a034(2), 155\u2013164 (2006)","journal-title":"Oper. Res. Lett."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.cor.2003.11.014","volume":"32","author":"L.R. Nielsen","year":"2005","unstructured":"Nielsen, L.R., Andersen, K.A., Pretolani, D.: Finding the k shortest hyperpaths. Computers & OR\u00a032, 1477\u20131497 (2005)","journal-title":"Computers & OR"},{"key":"13_CR13","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific (1996)"},{"key":"13_CR14","volume-title":"Dynamic Programming and Markov Processes","author":"R. Howard","year":"1960","unstructured":"Howard, R.: Dynamic Programming and Markov Processes. MIT Press, Cambridge (1960)"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M. Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley, New York (1994)"},{"key":"13_CR16","unstructured":"Littman, M.L., Dean, T., Kaelbling, L.P.: On the complexity of solving Markov decision problems. In: UAI, pp. 394\u2013402 (1995)"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/moor.1060.0238","volume":"32","author":"B. Bonet","year":"2007","unstructured":"Bonet, B.: On the speed of convergence of value iteration on stochastic shortest-path problems. Mathematics of Operations Research\u00a032(2), 365\u2013373 (2007)","journal-title":"Mathematics of Operations Research"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","volume":"72","author":"A. Barto","year":"1995","unstructured":"Barto, A., Bradtke, S., Singh, S.: Learning to act using real-time dynamic programming. Artificial Intelligence J.\u00a072, 81\u2013138 (1995)","journal-title":"Artificial Intelligence J."},{"key":"13_CR19","first-page":"851","volume":"6","author":"D. Wingate","year":"2005","unstructured":"Wingate, D., Seppi, K.D.: Prioritization methods for accelerating MDP solvers. JMLR\u00a06, 851\u2013881 (2005)","journal-title":"JMLR"},{"key":"13_CR20","unstructured":"Munos, R., Moore, A.: Influence and variance of a Markov chain: Application to adaptive discretization in optimal control. In: CDC (1999)"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Mathematics of Operations Research\u00a016(3), 580\u2013595 (1991)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04428-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T10:03:24Z","timestamp":1602324204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04428-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044274","9783642044281"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04428-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}