{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:03:41Z","timestamp":1743221021231,"version":"3.40.3"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1016\/j.artint.2012.05.002","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T03:58:28Z","timestamp":1337140708000},"page":"19-47","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Discovering hidden structure in factored MDPs"],"prefix":"10.1016","volume":"189","author":[{"given":"Andrey","family":"Kolobov","sequence":"first","affiliation":[]},{"family":"Mausam","sequence":"additional","affiliation":[]},{"given":"Daniel S.","family":"Weld","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2012.05.002_br0010","unstructured":"D. Aberdeen, S. Thi\u00e9baux, L. Zhang, Decision-theoretic military operations planning, in: ICAPS\u02bc04, 2004."},{"key":"10.1016\/j.artint.2012.05.002_br0020","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"},{"year":"1957","series-title":"Dynamic Programming","author":"Bellman","key":"10.1016\/j.artint.2012.05.002_br0030"},{"year":"1996","series-title":"Neuro-Dynamic Programming","author":"Bertsekas","key":"10.1016\/j.artint.2012.05.002_br0040"},{"year":"1995","series-title":"Dynamic Programming and Optimal Control","author":"Bertsekas","key":"10.1016\/j.artint.2012.05.002_br0050"},{"key":"10.1016\/j.artint.2012.05.002_br0060","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","article-title":"Fast planning through planning graph analysis","volume":"90","author":"Blum","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2012.05.002_br0070","unstructured":"B. Bonet, H. Geffner, Labeled RTDP: Improving the convergence of real-time dynamic programming, in: ICAPS\u02bc03, 2003, pp. 12\u201321."},{"key":"10.1016\/j.artint.2012.05.002_br0080","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1613\/jair.1688","article-title":"mGPT: A probabilistic planner based on heuristic search","volume":"24","author":"Bonet","year":"2005","journal-title":"Journal of Artificial Intelligence Research"},{"author":"Bryce","key":"10.1016\/j.artint.2012.05.002_br0090"},{"key":"10.1016\/j.artint.2012.05.002_br0100","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.artint.2008.11.008","article-title":"The factored policy-gradient planner","volume":"173","author":"Buffet","year":"2009","journal-title":"Artificial Intelligence Journal"},{"key":"10.1016\/j.artint.2012.05.002_br0110","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","article-title":"The computational complexity of propositional STRIPS planning","volume":"69","author":"Bylander","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2012.05.002_br0120","doi-asserted-by":"crossref","unstructured":"Peter Clark, Tim Niblett, The CN2 induction algorithm, in: Machine Learning, 1989, pp. 261\u2013283.","DOI":"10.1007\/BF00116835"},{"key":"10.1016\/j.artint.2012.05.002_br0130","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An assumption-based tms","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artificial Intelligence"},{"year":"2003","series-title":"Constraint Processing","author":"Dechter","key":"10.1016\/j.artint.2012.05.002_br0140"},{"key":"10.1016\/j.artint.2012.05.002_br0150","unstructured":"Z. Feng, E. Hansen, Symbolic heuristic search for factored Markov decision processes, in: AAAI\u02bc02, 2002."},{"key":"10.1016\/j.artint.2012.05.002_br0160","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","article-title":"Rete: A fast algorithm for the many pattern\/many object pattern match problem","volume":"19","author":"Forgy","year":"1982","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2012.05.002_br0170","unstructured":"J. Foss, N. Onder, D. Smith, Preventing unrecoverable failures through precautionary planning, in: ICAPS\u02bc07 Workshop on Moving Planning and Scheduling Systems into the Real World, 2007."},{"key":"10.1016\/j.artint.2012.05.002_br0180","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1613\/jair.1183","article-title":"Planning through stochastic local search and temporal action graphs","volume":"20","author":"Gerevini","year":"2003","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2012.05.002_br0190","unstructured":"J. Goldsmith, M. Littman, M. Mundhenk, The complexity of plan existence and evaluation in probabilistic domains, in: UAI\u02bc97, 1997."},{"key":"10.1016\/j.artint.2012.05.002_br0200","doi-asserted-by":"crossref","unstructured":"Geoff Gordon, Stable function approximation in dynamic programming, in: ICML, 1995, pp. 261\u2013268.","DOI":"10.1016\/B978-1-55860-377-6.50040-2"},{"key":"10.1016\/j.artint.2012.05.002_br0210","unstructured":"C. Gretton, S. Thi\u00e9baux, Exploiting first-order regression in inductive policy selection, in: UAI\u02bc04, 2004."},{"key":"10.1016\/j.artint.2012.05.002_br0220","unstructured":"C. Guestrin, D. Koller, C. Gearhart, N. Kanodia, Generalizing plans to new environments in relational MDPs, in: IJCAI\u02bc03, Acapulco, Mexico, 2003."},{"key":"10.1016\/j.artint.2012.05.002_br0230","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1613\/jair.1000","article-title":"Efficient solution algorithms for factored MDPs","volume":"19","author":"Guestrin","year":"2003","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1\u20132","key":"10.1016\/j.artint.2012.05.002_br0240","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0004-3702(01)00106-0","article-title":"LAO\u204e: A heuristic search algorithm that finds solutions with loops","volume":"129","author":"Hansen","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2012.05.002_br0250","unstructured":"J. Hoey, R. St-Aubin, A. Hu, C. Boutilier, SPUDD: Stochastic planning using decision diagrams, in: UAI\u02bc99, 1999, pp. 279\u2013288."},{"key":"10.1016\/j.artint.2012.05.002_br0260","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":"Hoffman","year":"2001","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.artint.2012.05.002_br0270","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0004-3702(96)00005-7","article-title":"Failure driven dynamic search control for partial order planners: An explanation based approach","volume":"88","author":"Kambhampati","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2012.05.002_br0280","doi-asserted-by":"crossref","unstructured":"Philipp Keller, Shie Mannor, Doine Precup, Automatic basis function construction for approximate dynamic programming and reinforcement learning, in: ICML\u02bc06, 2006, pp. 449\u2013456.","DOI":"10.1145\/1143844.1143901"},{"key":"10.1016\/j.artint.2012.05.002_br0290","unstructured":"E. Keyder, H. Geffner, The HMDPP planner for planning with probabilities, in: Sixth International Planning Competition at ICAPS\u02bc08, 2008."},{"key":"10.1016\/j.artint.2012.05.002_br0300","unstructured":"C. Knoblock, S. Minton, O. Etzioni, Integrating abstraction and explanation-based learning in PRODIGY, in: Ninth National Conference on Artificial Intelligence, 1991."},{"key":"10.1016\/j.artint.2012.05.002_br0310","unstructured":"A. Kolobov, Mausam, D. Weld, ReTrASE: Integrating paradigms for approximate probabilistic planning, in: IJCAI\u02bc09, 2009."},{"key":"10.1016\/j.artint.2012.05.002_br0320","doi-asserted-by":"crossref","unstructured":"A. Kolobov, Mausam, D. Weld, Classical planning in MDP heuristics: With a little help from generalization, in: ICAPS\u02bc10, 2010.","DOI":"10.1609\/icaps.v20i1.13424"},{"key":"10.1016\/j.artint.2012.05.002_br0330","doi-asserted-by":"crossref","unstructured":"A. Kolobov, Mausam, D. Weld, SixthSense: Fast and reliable recognition of dead ends in MDPs, in: AAAI\u02bc10, 2010.","DOI":"10.1609\/aaai.v24i1.7752"},{"key":"10.1016\/j.artint.2012.05.002_br0340","doi-asserted-by":"crossref","unstructured":"A. Kolobov, Mausam, D. Weld, Heuristic search for generalized stochastic shortest path mdps, in: ICAPS\u02bc11, 2011.","DOI":"10.1609\/icaps.v21i1.13452"},{"key":"10.1016\/j.artint.2012.05.002_br0350","unstructured":"Iain Little, Sylvie Thi\u00e9baux, Probabilistic planning vs. replanning, in: ICAPS Workshop on IPC: Past, Present and Future, 2007."},{"key":"10.1016\/j.artint.2012.05.002_br0360","unstructured":"Mausam, E. Benazara, R. Brafman, N. Meuleau, E. Hansen, Planning with continuous resources in stochastic domains, in: IJCAI\u02bc05, 2005, p. 1244."},{"key":"10.1016\/j.artint.2012.05.002_br0370","unstructured":"Mausam, P. Bertoli, D. Weld, A hybridized planner for stochastic domains, in: IJCAI\u02bc07, 2007."},{"key":"10.1016\/j.artint.2012.05.002_br0380","series-title":"NIPS\u02bc02","first-page":"1043","article-title":"Exponential family PCA for belief compression in POMDPs","author":"Roy","year":"2003"},{"key":"10.1016\/j.artint.2012.05.002_br0390","unstructured":"S. Sanner, C. Boutilier, Practical linear value-approximation techniques for first-order MDPs, in: UAI\u02bc06, 2006."},{"key":"10.1016\/j.artint.2012.05.002_br0400","unstructured":"R. St-Aubin, J. Hoey, C. Boutilier, APRICODD: Approximate policy construction using decision diagrams, in: NIPS\u02bc00, 2000."},{"key":"10.1016\/j.artint.2012.05.002_br0410","unstructured":"F. Teichteil-K\u00f6nigsbuch, U. Kuter, G. Infantes, Incremental plan aggregation for generating policies in MDPs, in: AAMAS\u02bc10, 2010."},{"key":"10.1016\/j.artint.2012.05.002_br0420","unstructured":"S. Yoon, A. Fern, R. Givan, FF-Replan: A baseline for probabilistic planning, in: ICAPS\u02bc07, 2007, pp. 352\u2013359."},{"key":"10.1016\/j.artint.2012.05.002_br0430","unstructured":"S. Yoon, A. Fern, S. Kambhampati, R. Givan, Probabilistic planning via determinization in hindsight, in: AAAI\u02bc08, 2008."},{"key":"10.1016\/j.artint.2012.05.002_br0440","unstructured":"H.L.S. Younes, R.G. Simmons, Policy generation for continuous-time stochastic domains with concurrency, in: ICAPS\u02bc04, 2004, p. 325."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370212000598?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370212000598?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:50:19Z","timestamp":1743133819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370212000598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":44,"alternative-id":["S0004370212000598"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2012.05.002","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}