{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:30:30Z","timestamp":1763641830608,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112053"},{"type":"electronic","value":"9783319112060"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11206-0_29","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:31:55Z","timestamp":1410744715000},"page":"297-308","source":"Crossref","is-referenced-by-count":5,"title":["An Experimental Comparison of Classical, FOND and Probabilistic Planning"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Hertle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Dornhege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Mattm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuela","family":"Ortlieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Nebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0004-3702(00)00033-3","volume":"121","author":"C. Boutilier","year":"2000","unstructured":"Boutilier, C., Dearden, R., Goldszmidt, M.: Stochastic Dynamic Programming with Factored Representations. Artificial Intelligence (AIJ)\u00a0121(1-2), 49\u2013107 (2000)","journal-title":"Artificial Intelligence (AIJ)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-61291-2_68","volume-title":"Advances in Artificial Intelligence","author":"J.C. Culberson","year":"1996","unstructured":"Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: McCalla, G.I. (ed.) Canadian AI 1996. LNCS, vol.\u00a01081, pp. 402\u2013416. Springer, Heidelberg (1996)"},{"key":"29_CR3","unstructured":"Fu, J., Ng, V., Bastani, F.B., Yen, I.L.: Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 1949\u20131954 (2011)"},{"key":"29_CR4","unstructured":"Gaschler, A., Petrick, R.P.A., Kr\u00f6ger, T., Knoll, A., Khatib, O.: Robot task planning with contingencies for run-time sensing. In: ICRA Workshop on Combining Task and Motion Planning (2013)"},{"issue":"1-2","key":"29_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(01)00106-0","volume":"129","author":"E.A. Hansen","year":"2001","unstructured":"Hansen, E.A., Zilberstein, S.: LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence\u00a0129(1-2), 35\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"29_CR6","unstructured":"Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: AAAI Conference on Artificial Intelligence (AAAI), pp. 1007\u20131012 (2007)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The fast downward planning system. Journal of Artificial Intelligence Research (JAIR)\u00a026, 191\u2013246 (2006)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Kaelbling, L., Lozano-Perez, T.: Hierarchical task and motion planning in the now. In: IEEE Conference on Robotics and Automation, ICRA (2011)","DOI":"10.1109\/ICRA.2011.5980391"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Kaelbling, L., Lozano-Perez, T.: Integrated task and motion planning in belief space. International Journal of Robotics Research (2013)","DOI":"10.21236\/ADA564092"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Keller, T., Eyerich, P.: A Polynomial All Outcomes Determinization for Probabilistic Planning. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 331\u2013334. AAAI Press (2011)","DOI":"10.1609\/icaps.v21i1.13487"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Keller, T., Eyerich, P.: PROST: Probabilistic Planning Based on UCT. In: International Conference on Automated Planning and Scheduling (ICAPS). pp. 119\u2013127 (2012)","DOI":"10.1609\/icaps.v22i1.13518"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-642-16111-7_41","volume-title":"KI 2010: Advances in Artificial Intelligence","author":"T. Keller","year":"2010","unstructured":"Keller, T., Eyerich, P., Nebel, B.: Task planning for an autonomous service robot. In: Dillmann, R., Beyerer, J., Hanebeck, U.D., Schultz, T. (eds.) KI 2010. LNCS, vol.\u00a06359, pp. 358\u2013365. Springer, Heidelberg (2010)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Keller, T., Helmert, M.: Trial-based Heuristic Tree Search for Finite Horizon MDPs. In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 135\u2013143 (2013)","DOI":"10.1609\/icaps.v23i1.13557"},{"key":"29_CR14","unstructured":"Kuter, U., Nau, D.S., Reisner, E., Goldman, R.P.: Using classical planners to solve nondeterministic planning problems. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 190\u2013197 (2008)"},{"key":"29_CR15","unstructured":"Little, I., Thi\u00e9baux, S.: Probabilistic planning vs replanning. In: ICAPS Workshop on IPC: Past, Present and Future (2007)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Mattm\u00fcller, R., Ortlieb, M., Helmert, M., Bercher, P.: Pattern database heuristics for fully observable nondeterministic planning. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 105\u2013112 (2010)","DOI":"10.1609\/icaps.v20i1.13408"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Muise, C.J., McIlraith, S.A., Beck, J.C.: Improved non-deterministic planning by exploiting state relevance. In: Proceedings of the 22nd International Conference on Automated Planning and Scheduling, ICAPS (2012)","DOI":"10.1609\/icaps.v22i1.13520"},{"key":"29_CR18","unstructured":"Nebel, B., Dornhege, C., Hertle, A.: How much does a household robot need to know in order to tidy up your home? In: AAAI Workshop on Intelligent Robotic Systems (2013)"}],"container-title":["Lecture Notes in Computer Science","KI 2014: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11206-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T02:45:02Z","timestamp":1674269102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11206-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112053","9783319112060"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11206-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}