{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:14:22Z","timestamp":1649006062864},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4923,"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":[[2000,2]]},"DOI":"10.1016\/s0004-3702(99)00103-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:20:41Z","timestamp":1027581641000},"page":"1-29","source":"Crossref","is-referenced-by-count":5,"title":["Towards efficient universal planning: A randomized approach"],"prefix":"10.1016","volume":"117","author":[{"given":"Peter","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Patrik","family":"Haslum","sequence":"additional","affiliation":[]},{"given":"Christer","family":"B\u00e4ckstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(99)00103-4_ID003","series-title":"Readings in Planning, San Mateo, CA","year":"1990"},{"issue":"4","key":"10.1016\/S0004-3702(99)00103-4_ID004","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","article-title":"Complexity results for SAS^+ planning","volume":"11","author":"B\u00e4ckstr\u00f6m","year":"1995","journal-title":"Comput. Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(99)00103-4_ID005","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(94)00081-B","article-title":"Expressive equivalence of planning formalisms","volume":"76","author":"B\u00e4ckstr\u00f6m","year":"1995","journal-title":"Artificial Intelligence"},{"issue":"9","key":"10.1016\/S0004-3702(99)00103-4_ID006","article-title":"Relating theories of actions and reactive control","volume":"3","author":"Baral","year":"1998","journal-title":"Link\u00f6ping Electronic Articles in Computer and Information Science"},{"key":"10.1016\/S0004-3702(99)00103-4_ID007","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(94)90012-4","article-title":"Partial-order planning: Evaluating possible efficiency gains","volume":"67","author":"Barret","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(99)00103-4_ID008","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\/S0004-3702(99)00103-4_ID009","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"},{"issue":"4","key":"10.1016\/S0004-3702(99)00103-4_ID010","first-page":"45","article-title":"Penguins can make cake","volume":"10","author":"Chapman","year":"1989","journal-title":"AI Magazine"},{"key":"10.1016\/S0004-3702(99)00103-4_ID011","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/S0004-3702(99)00103-4_ID012","first-page":"61","article-title":"Ginsberg replies to Chapman and Schoppers","volume":"10","author":"Ginsberg","year":"1989","journal-title":"AI Magazine"},{"issue":"4","key":"10.1016\/S0004-3702(99)00103-4_ID013","first-page":"40","article-title":"Universal planning: An (almost) universally bad idea","volume":"10","author":"Ginsberg","year":"1989","journal-title":"AI Magazine"},{"key":"10.1016\/S0004-3702(99)00103-4_ID014","series-title":"Proc. IJCAI-69, Washington, DC","first-page":"219","article-title":"Application of theorem proving to planning","author":"Green","year":"1969"},{"key":"10.1016\/S0004-3702(99)00103-4_ID015","series-title":"Handbook of Theoretical Computer Science: Algorithms and Complexity, Vol. A, Chapter 2","first-page":"67","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(99)00103-4_ID016","series-title":"Proc. AAAI-96, Portland, OR","first-page":"1182","article-title":"On the size of reactive plans","author":"Jonsson","year":"1996"},{"issue":"3\u20134","key":"10.1016\/S0004-3702(99)00103-4_ID017","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018995620232","article-title":"Tractable plan existence does not imply tractable plan generation","volume":"22","author":"Jonsson","year":"1998","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00103-4_ID018","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"issue":"1","key":"10.1016\/S0004-3702(99)00103-4_ID019","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/S0097539795296206","article-title":"New collapse consequences of NP having small circuits","volume":"28","author":"K\u00f6bler","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(99)00103-4_ID020","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(87)90051-8","article-title":"Planning as search: A quantitative approach","volume":"33","author":"Korf","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00103-4_ID021","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","article-title":"Symmetric space-bounded computation","volume":"19","author":"Lewis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(99)00103-4_ID022","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0004-3702(99)00103-4_ID023","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0004-3702(99)00103-4_ID024","series-title":"Proc. IJCAI-75, Tbilisi, Georgia","first-page":"206","article-title":"The non-linear nature of plans","author":"Sacerdoti","year":"1975"},{"issue":"2","key":"10.1016\/S0004-3702(99)00103-4_ID025","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(99)00103-4_ID026","series-title":"Proc. IJCAI-87, Milan, Italy","first-page":"1039","article-title":"Universal plans for reactive robots in unpredictable environments","author":"Schoppers","year":"1987"},{"issue":"4","key":"10.1016\/S0004-3702(99)00103-4_ID027","first-page":"51","article-title":"In defense of reaction plans as caches","volume":"10","author":"Schoppers","year":"1989","journal-title":"AI Magazine"},{"key":"10.1016\/S0004-3702(99)00103-4_ID028","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1238","article-title":"Estimating reaction plan size","author":"Schoppers","year":"1994"},{"key":"10.1016\/S0004-3702(99)00103-4_ID029","series-title":"Proc. 4th Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany","first-page":"521","article-title":"Near-optimal plans, tractability, and reactivity","author":"Selman","year":"1994"},{"key":"10.1016\/S0004-3702(99)00103-4_ID030","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"1178","article-title":"A reactive planner for a model-based executive","author":"Williams","year":"1997"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299001034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299001034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:20:09Z","timestamp":1556742009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370299001034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0004370299001034"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(99)00103-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}