{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:14:08Z","timestamp":1712301248199},"reference-count":49,"publisher":"Elsevier BV","issue":"6-7","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,19]],"date-time":"2014-11-19T00:00:00Z","timestamp":1416355200000},"content-version":"vor","delay-in-days":2423,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1016\/j.artint.2007.10.018","type":"journal-article","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T05:14:59Z","timestamp":1196486099000},"page":"685-715","source":"Crossref","is-referenced-by-count":5,"title":["Sequential Monte Carlo in reachability heuristics for probabilistic planning"],"prefix":"10.1016","volume":"172","author":[{"given":"Daniel","family":"Bryce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subbarao","family":"Kambhampati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David E.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2007.10.018_bib001","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","article-title":"Learning to act using real-time dynamic programming","volume":"72","author":"Barto","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2007.10.018_bib002","series-title":"Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005)","year":"2005"},{"key":"10.1016\/j.artint.2007.10.018_bib003","series-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95","first-page":"1636","article-title":"Fast planning through planning graph analysis","author":"Blum","year":"1995"},{"key":"10.1016\/j.artint.2007.10.018_bib004","series-title":"Recent Advances in AI Planning, 5th European Conference on Planning, ECP'99, Proceedings","first-page":"319","article-title":"Probabilistic planning in the Graphplan framework","volume":"vol. 1809","author":"Blum","year":"1999"},{"key":"10.1016\/j.artint.2007.10.018_bib005","unstructured":"B. Bonet, H. Geffner, Labeled RTDP: Improving the convergence of real-time dynamic programming, in: Giunchiglia et al. [21], pp. 12\u201331"},{"key":"10.1016\/j.artint.2007.10.018_bib006","series-title":"UAI'98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence","first-page":"24","article-title":"Structured reachability analysis for Markov Decision Processes","author":"Boutilier","year":"1998"},{"key":"10.1016\/j.artint.2007.10.018_bib007","series-title":"Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004)","first-page":"355","article-title":"Conformant planning via heuristic forward search: A new approach","author":"Brafman","year":"2004"},{"key":"10.1016\/j.artint.2007.10.018_bib008","series-title":"UAI '02, Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence","first-page":"77","article-title":"Planning under continuous time and resource uncertainty: A challenge for AI","author":"Bresina","year":"2002"},{"key":"10.1016\/j.artint.2007.10.018_bib009","unstructured":"D. Bryce, W. Cushing, S. Kambhampati, Model-lite planning: Diverse multi-option plans and dynamic objective functions, in: Proceedings of the 3rd Workshop on Planning and Plan Execution for Real-World Systems, Providence, RI, 2007"},{"key":"10.1016\/j.artint.2007.10.018_bib010","unstructured":"D. Bryce, W. Cushing, S. Kambhampati, Probabilistic planning is multi-objective!, Tech. rep., Arizona State University, ASU CSE TR-07-006 (2007)"},{"issue":"1","key":"10.1016\/j.artint.2007.10.018_bib011","first-page":"47","article-title":"A tutorial on planning graph based reachability heuristics","volume":"28","author":"Bryce","year":"2007","journal-title":"AI Magazine"},{"key":"10.1016\/j.artint.2007.10.018_bib012","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1613\/jair.1869","article-title":"Planning graph heuristics for belief space search","volume":"26","author":"Bryce","year":"2006","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib013","doi-asserted-by":"crossref","unstructured":"D. Bryce, S. Kambhampati, D. Smith, Sequential Monte Carlo in probabilistic planning reachability heuristics, in: Long and Smith [33], pp. 233\u2013242","DOI":"10.1016\/j.artint.2007.10.018"},{"key":"10.1016\/j.artint.2007.10.018_bib014","series-title":"Proceedings of the 13th Annual Conference on Uncertainty in Artificial Intelligence (UAI-97)","first-page":"54","article-title":"Incremental pruning: A simple, fast, exact method for Partially Observable Markov Decision Processes","author":"Cassandra","year":"1997"},{"key":"10.1016\/j.artint.2007.10.018_bib015","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/j.artint.2007.10.018_bib016","unstructured":"C. Domshlak, J. Hoffmann, Fast probabilistic planning through weighted model counting, in: Long and Smith [33], pp. 243\u2013251"},{"key":"10.1016\/j.artint.2007.10.018_bib017","series-title":"Sequential Monte Carlo Methods in Practice","author":"Doucet","year":"2001"},{"key":"10.1016\/j.artint.2007.10.018_bib018","series-title":"Proceedings of the 2nd International Joint Conference on Artificial Intelligence","first-page":"608","article-title":"STRIPS: A new approach to the application of theorem proving to problem solving","author":"Fikes","year":"1971"},{"issue":"12","key":"10.1016\/j.artint.2007.10.018_bib019","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1177\/0278364903022012001","article-title":"Adapting the sample size in particle filters through KLD-sampling","volume":"22","author":"Fox","year":"2003","journal-title":"International Journal of Robotics Research"},{"key":"10.1016\/j.artint.2007.10.018_bib020","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1613\/jair.1183","article-title":"Planning through stochastic local search and temporal action graphs in LPG","volume":"20","author":"Gerevini","year":"2003","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib021","series-title":"Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003)","year":"2003"},{"key":"10.1016\/j.artint.2007.10.018_bib022","unstructured":"J. Hoffmann, R.I. Brafman, Contingent planning via heuristic forward search with implicit belief states, in: Biundo et al. [2], pp. 71\u201380"},{"key":"10.1016\/j.artint.2007.10.018_bib023","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","article-title":"The FF planning system: Fast plan generation through heuristic search","volume":"14","author":"Hoffmann","year":"2001","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib024","unstructured":"J. Huang, Combining knowledge compilation and search for efficient conformant probabilistic planning, in: Long and Smith [33], pp. 253\u2013262"},{"key":"10.1016\/j.artint.2007.10.018_bib025","unstructured":"N. Hyafil, F. Bacchus, Conformant probabilistic planning via CSPs, in: Giunchiglia et al. [21], pp. 205\u2013214"},{"key":"10.1016\/j.artint.2007.10.018_bib026","series-title":"Proceedings of the 16th European Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004","first-page":"1033","article-title":"Utilizing structured representations and CSP's in conformant probabilistic planning","author":"Hyafil","year":"2004"},{"key":"10.1016\/j.artint.2007.10.018_bib027","series-title":"Continuous Univariate Distributions","author":"Johnson","year":"1994"},{"key":"10.1016\/j.artint.2007.10.018_bib028","series-title":"Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96)","first-page":"374","article-title":"Encoding plans in propositional logic","author":"Kautz","year":"1996"},{"key":"10.1016\/j.artint.2007.10.018_bib029","series-title":"Recent Advances in AI Planning, 4th European Conference on Planning, ECP'97","first-page":"273","article-title":"Extending planning graphs to an ADL subset","volume":"vol. 1348","author":"Koehler","year":"1997"},{"key":"10.1016\/j.artint.2007.10.018_bib030","series-title":"Proceedings of the 12th National Conference on Artificial Intelligence, vol. 2","first-page":"1073","article-title":"An algorithm for probabilistic least-commitment planning","author":"Kushmerick","year":"1994"},{"key":"10.1016\/j.artint.2007.10.018_bib031","series-title":"Proceedings of The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference","first-page":"1181","article-title":"Prottle: A probabilistic temporal planner","author":"Little","year":"2005"},{"key":"10.1016\/j.artint.2007.10.018_bib032","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.505","article-title":"The computational complexity of probabilistic planning","volume":"9","author":"Littman","year":"1998","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib033","series-title":"Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006)","year":"2006"},{"key":"10.1016\/j.artint.2007.10.018_bib034","series-title":"Proceedings of the Sixteenth National Conference on Artificial Intelligence","first-page":"541","article-title":"On the undecidability of probabilistic planning and infinite-horizon Partially Observable Markov Decision Problems","author":"Madani","year":"1999"},{"key":"10.1016\/j.artint.2007.10.018_bib035","series-title":"Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems","first-page":"86","article-title":"Maxplan: A new approach to probabilistic planning","author":"Majercik","year":"1998"},{"key":"10.1016\/j.artint.2007.10.018_bib036","unstructured":"Mausam, D.S. Weld, Concurrent probabilistic temporal planning, in: Biundo et al. [2], pp. 120\u2013129"},{"key":"10.1016\/j.artint.2007.10.018_bib037","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1613\/jair.735","article-title":"On the compilability and expressive power of propositional planning formalisms","volume":"12","author":"Nebel","year":"2000","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib038","series-title":"Proceedings of the 16th Annual Conference on Uncertainty in Artificial Intelligence (UAI-00)","first-page":"406","article-title":"Pegasus: A policy search method for large MDPs and POMDPs","author":"Ng","year":"2000"},{"key":"10.1016\/j.artint.2007.10.018_bib039","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1701","article-title":"Engineering a conformant probabilistic planner","volume":"25","author":"Onder","year":"2006","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib040","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1093\/logcom\/4.5.467","article-title":"ADL and the state-transition model of action","volume":"4","author":"Pednault","year":"1994","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/j.artint.2007.10.018_bib041","unstructured":"P. Poupart, C. Boutilier, VDCBPI: An approximate scalable algorithm for large scale pomdps, in: Proceedings of NIPS'04, 2004"},{"key":"10.1016\/j.artint.2007.10.018_bib042","series-title":"Markov Decision Processes\u2014Discrete Stochastic Dynamic Programming","author":"Puterman","year":"1994"},{"key":"10.1016\/j.artint.2007.10.018_bib043","unstructured":"J. Rintanen, Expressive equivalence of formalisms for planning with sensing, in: Giunchiglia et al. [21], pp. 185\u2013194"},{"key":"10.1016\/j.artint.2007.10.018_bib044","series-title":"Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI 98, IAAI 98","first-page":"889","article-title":"Conformant Graphplan","author":"Smith","year":"1998"},{"key":"10.1016\/j.artint.2007.10.018_bib045","unstructured":"F. Somenzi, CUDD: CU Decision Diagram Package Release 2.3.0, University of Colorado at Boulder, 1998"},{"key":"10.1016\/j.artint.2007.10.018_bib046","unstructured":"S. Thrun, Monte Carlo POMDPs, in: Advances in Neural Information Processing 12, 2000, pp. 1064\u20131070"},{"key":"10.1016\/j.artint.2007.10.018_bib047","unstructured":"H. Younes, M. Littman, PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects, Tech. rep., CMU-CS-04-167, Carnegie Mellon University, 2004"},{"key":"10.1016\/j.artint.2007.10.018_bib048","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1613\/jair.1136","article-title":"VHPOP: Versatile heuristic partial order planner","volume":"20","author":"Younes","year":"2003","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2007.10.018_bib049","unstructured":"Y. Zemali, P. Fabiani, Search space splitting in order to compute admissible heuristics in planning, in: Workshop on Planen, Scheduling und Konfigurieren, Entwerfen, 2003"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370207001853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370207001853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T11:14:48Z","timestamp":1557054888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370207001853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":49,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["S0004370207001853"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2007.10.018","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}