{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:11:07Z","timestamp":1751688667527,"version":"3.41.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T00:00:00Z","timestamp":1526601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["933\/13"],"award-info":[{"award-number":["933\/13"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007028","name":"Leona M. and Harry B. Helmsley Charitable Trust","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007028","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10458-018-9389-9","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T05:43:25Z","timestamp":1526622205000},"page":"602-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Landmark-based heuristic online contingent planning"],"prefix":"10.1007","volume":"32","author":[{"given":"Shlomi","family":"Maliah","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3655-7148","authenticated-orcid":false,"given":"Guy","family":"Shani","sequence":"additional","affiliation":[]},{"given":"Ronen I.","family":"Brafman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"9389_CR1","unstructured":"Albore, A., Palacios, H., & Geffner, H. (2009). A translation-based approach to contingent planning. In: IJCAI, pp. 1623\u20131628."},{"key":"9389_CR2","unstructured":"Bonet, B., & Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In: Proceedings of AIPS\u201900, pp. 52\u201361."},{"key":"9389_CR3","unstructured":"Bonet, B., & Geffner, H. (2011). Planning under partial observability by classical replanning: Theory and experiments. In: IJCAI, pp. 1936\u20131941."},{"key":"9389_CR4","unstructured":"Brafman, R. I., & Shani, G. (2012). A multi-path compilation approach to contingent planning. In: AAAI."},{"key":"9389_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.3711","volume":"45","author":"RI Brafman","year":"2012","unstructured":"Brafman, R. I., & Shani, G. (2012). Replanning in domains with partial information and sensing actions. Journal of Artificial Intelligence Research (JAIR), 45, 565\u2013600.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"9389_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.artint.2016.08.005","volume":"241","author":"RI Brafman","year":"2016","unstructured":"Brafman, R. I., & Shani, G. (2016). Online belief tracking using regression for contingent planning. Artificial Intelligence, 241, 131\u2013152.","journal-title":"Artificial Intelligence"},{"key":"9389_CR7","first-page":"35","volume":"26","author":"D Bryce","year":"2006","unstructured":"Bryce, D., Kambhampati, S., & Smith, D. E. (2006). Planning graph heuristics for belief space search. Journal of AI Research, 26, 35\u201399.","journal-title":"Journal of AI Research"},{"issue":"3","key":"9389_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/34.204912","volume":"15","author":"D Heckerman","year":"1993","unstructured":"Heckerman, D., Horvitz, E., & Middleton, B. (1993). An approximate nonmyopic computation for value of information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(3), 292\u2013298.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9389_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence Research, 26, 191\u2013246.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9389_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. JAIR, 14, 253\u2013302.","journal-title":"JAIR"},{"key":"9389_CR11","first-page":"215","volume":"22","author":"J Hoffmann","year":"2004","unstructured":"Hoffmann, J., Porteous, J., & Sebastia, L. (2004). Ordered landmarks in planning. Journal of AI Research, 22, 215\u2013278.","journal-title":"Journal of AI Research"},{"key":"9389_CR12","volume-title":"Dynamic programming and Markov processes","author":"RA Howard","year":"1960","unstructured":"Howard, R. A. (1960). Dynamic programming and Markov processes. Cambridge: MIT Press."},{"key":"9389_CR13","unstructured":"Karpas, E., & Domshlak, C. (2009). Cost-optimal planning with landmarks. In: IJCAI."},{"key":"9389_CR14","doi-asserted-by":"crossref","unstructured":"Keyder, E., Richter, S., & Helmert, M. (2010). Sound and complete landmarks for and\/or graphs. In: Proceedings of the European Conference on Artificial Intelligence (ECAI), pp. 335\u2013340.","DOI":"10.3233\/978-1-60750-606-5-335"},{"key":"9389_CR15","doi-asserted-by":"crossref","unstructured":"Komarnitsky, R., & Shani, G. (2016). Computing contingent plans using online replanning. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12\u201317, 2016, Phoenix, Arizona, USA, pp. 3159\u20133165.","DOI":"10.1609\/aaai.v30i1.10406"},{"key":"9389_CR16","unstructured":"Maliah, S., Brafman, R. I., Karpas, E., & Shani, G. (2014). Partially observable online contingent planning using landmark heuristics. In: Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21\u201326, 2014."},{"key":"9389_CR17","doi-asserted-by":"crossref","unstructured":"Maliah, S., Shani, G., & Brafman, R. I. (2016). Online macro generation for privacy preserving planning. In: Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12\u201317, 2016, pp. 216\u2013220.","DOI":"10.1609\/icaps.v26i1.13741"},{"key":"9389_CR18","unstructured":"Newton, M. A. H. (2009). Wizard: Learning macro-actions comprehensively for planning. Ph.D. thesis, University of Strathclyde."},{"key":"9389_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter, S., & Westphal, M. (2010). The LAMA planner: Guiding cost-based anytime planning with landmarks. JAIR, 39, 127\u2013177.","journal-title":"JAIR"},{"issue":"1","key":"9389_CR20","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter, S., & Westphal, M. (2010). The lama planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39(1), 127\u2013177.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"12\u201313","key":"9389_CR21","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.artint.2006.08.002","volume":"170","author":"J Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., & Niemel\u00e4, I. (2006). Planning as satisfiability: Parallel plans and algorithms for plan search. Artificial Intelligence, 170(12\u201313), 1031\u20131080.","journal-title":"Artificial Intelligence"},{"key":"9389_CR22","unstructured":"Shani, G., Brafman, R. I. (2011). Replanning in domains with partial information and sensing actions. In: IJCAI, pp. 2021\u20132026."},{"key":"9389_CR23","unstructured":"Smith, T., & Simmons, R. (2004). Heuristic search value iteration for POMDPs. In: UAI 2004. Banff, Alberta."},{"key":"9389_CR24","doi-asserted-by":"crossref","unstructured":"Speck, D., Ortlieb, M., & Mattm\u00fcller, R. (2015). Necessary observations in nondeterministic planning. In: KI 2015: Advances in Artificial Intelligence\u201438th Annual German Conference on AI, Dresden, Germany, September 21\u201325, 2015, Proceedings, pp. 181\u2013193.","DOI":"10.1007\/978-3-319-24489-1_14"},{"key":"9389_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2015.06.001","volume":"227","author":"ST To","year":"2015","unstructured":"To, S. T., Son, T. C., & Pontelli, E. (2015). A generic approach to planning in the presence of incomplete information: Theory and implementation. Artificial Intelligence, 227, 1\u201351.","journal-title":"Artificial Intelligence"},{"key":"9389_CR26","unstructured":"To, S. T., Pontelli, E., & Son, T. C. (2009). A conformant planner with explicit disjunctive representation of belief states. In: ICAPS."},{"key":"9389_CR27","unstructured":"Zhu, L., & Givan, R. (2003). Landmark extraction via planning graph propagation. In: ICAPS 2003 Doctoral Consortium, pp. 156\u2013160."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-018-9389-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9389-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9389-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T16:21:45Z","timestamp":1751646105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-018-9389-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,18]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9389"],"URL":"https:\/\/doi.org\/10.1007\/s10458-018-9389-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2018,5,18]]},"assertion":[{"value":"18 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}