{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:49:25Z","timestamp":1761486565520},"reference-count":46,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4220,"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":[[2002,2]]},"DOI":"10.1016\/s0004-3702(01)00158-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:25:09Z","timestamp":1027614309000},"page":"73-123","source":"Crossref","is-referenced-by-count":24,"title":["Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search"],"prefix":"10.1016","volume":"135","author":[{"given":"XuanLong","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Subbarao","family":"Kambhampati","sequence":"additional","affiliation":[]},{"given":"Romeo S.","family":"Nigenda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00158-8_BIB001","series-title":"Results of the AIPS 2000 Planning Competition","author":"Bacchus","year":"2000"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00158-8_BIB002","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(01)00158-8_BIB003","series-title":"Proc. ECP-99, Durham, UK","article-title":"Planning as heuristic search: New results","author":"Bonet","year":"1999"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB004","series-title":"Proc. AAAI-97, Providence, RI","article-title":"A robust and fast action selection mechanism for planning","author":"Bonet","year":"1997"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB005","series-title":"AIPS-98 Planning Competition, Pittsburgh, PA","article-title":"HSP planner","author":"Bonet","year":"1998"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB006","series-title":"Proc. AIPS-2000, Breckenridge, CO","article-title":"New results about LCGP, a least committed Graphplan","author":"Cayrol","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB007","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1111\/0824-7935.00065","article-title":"Pattern databases","volume":"14","author":"Culberson","year":"1998","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB008","series-title":"Proc. AIPS-2000, Breckenridge, CO","article-title":"Investigating the effect of relevance and reachability constraints on SAT encodings of planning","author":"Do","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB009","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(01)00128-X","article-title":"Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP","volume":"132","author":"Do","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB010","series-title":"Proc. ECP-2001, Toledo, Spain","article-title":"SAPA: A domain-independent heuristic metric temporal planner","author":"Do","year":"2001"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB011","series-title":"Proc. ECP-2001, Toledo, Spain","article-title":"Planning with pattern databases","author":"Edelkamp","year":"2001"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB012","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","article-title":"STRIPS: A new approach to the application of theorem proving to problem solving","volume":"1","author":"Fikes","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB013","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1613\/jair.544","article-title":"Automatic inference of state invariants in TIM","volume":"9","author":"Fox","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00158-8_BIB014","series-title":"Proc. AIPS-94, Chicago, IL","article-title":"Representation and control in IxTeT","author":"Ghallab","year":"1994"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB015","series-title":"Proc. AAAI-98, Madison, WI","article-title":"Inferring state constraints for domain-independent planning","author":"Gerevini","year":"1998"},{"issue":"3","key":"10.1016\/S0004-3702(01)00158-8_BIB016","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","article-title":"Criticizing solutions to relaxed models yields powerful admissible heuristics","volume":"63","author":"Hansson","year":"1992","journal-title":"Inform. Sci."},{"key":"10.1016\/S0004-3702(01)00158-8_BIB017","series-title":"Proc. AIPS-2000, Breckenridge, CO","article-title":"Admissible heuristics for optimal planning","author":"Haslum","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB018","unstructured":"J. Hoffman, A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm, Technical Report No. 133, Albert Ludwigs University"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.655","article-title":"Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in Graphplan","volume":"12","author":"Kambhampati","year":"2000","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00158-8_BIB020","series-title":"Proc. ECP-97, Toulouse, France","article-title":"Understanding and extending graphplan","author":"Kambhampati","year":"1997"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB021","series-title":"Proc. IJCAI-97, Nagoya, Japan","article-title":"Challenges in bridging plan synthesis paradigms","author":"Kambhampati","year":"1997"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB022","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"EBL & DDB for Graphplan","author":"Kambhampati","year":"1999"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB023","series-title":"Proc. AIPS-2000, Breckenridge, CO","article-title":"Distance based goal ordering heuristics for Graphplan","author":"Kambhampati","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB024","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"Blackbox: Unifying sat based and graph based planning","author":"Kautz","year":"1999"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB025","series-title":"Proc. 4th AIPS, Pittsburgh, PA","article-title":"Solving complex planning tasks through extraction of subproblems","author":"Koehler","year":"1998"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB026","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","article-title":"Linear-space best-first search","volume":"62","author":"Korf","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB027","series-title":"Proc. AAAI-97, Providence, RI","article-title":"Finding optimal solutions to Rubik's Cube using pattern databases","author":"Korf","year":"1997"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB028","series-title":"Proc. AAAI-2000, Austin, TX","article-title":"Recent progress in in the design and analysis of admissible heuristic functions (Invited Talk)","author":"Korf","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB029","series-title":"Proc. AAAI-96, Portland, OR","article-title":"Finding optimal solutions to the twenty-four puzzle","author":"Korf","year":"1996"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB030","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1613\/jair.570","article-title":"Efficient implementation of the plan graph in STAN","volume":"10","author":"Long","year":"1999","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00158-8_BIB031","series-title":"Proc. AIPS-96, Edinburgh, Scotland","article-title":"A heuristic estimator for means-ends analysis in planning","author":"McDermott","year":"1996"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB032","series-title":"AIPS-98 Planning Competition Results","author":"McDermott","year":"1998"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00158-8_BIB033","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0004-3702(99)00010-7","article-title":"Using regression graphs to control search in planning","volume":"109","author":"McDermott","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB034","series-title":"Proc. AAAI-90, Boston, MA","article-title":"Dynamic constraint satisfaction problems","author":"Mittal","year":"1990"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB035","series-title":"Proc. ECP-97, Toulouse, France","article-title":"Ignoring irrelevant facts and operators in plan generation","author":"Nebel","year":"1997"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB036","series-title":"Proc. AAAI-2000, Austin, TX","article-title":"Extracting effective and admissible state-space heuristics from the planning graph","author":"Nguyen","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB037","series-title":"Proc. IJCAI-01, Seattle, WA","article-title":"Reviving partial order planning","author":"Nguyen","year":"2001"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB038","series-title":"Proc. KBCS-2000, Mumbai, India","article-title":"AltAlt: Combining the advantages of Graphplan and heuristic state search","author":"Nigenda","year":"2000"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB039","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB040","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB041","series-title":"Proc. ECP-99, Durham, UK","article-title":"GRT: A domain independent heuristic for strips worlds based on greedy regression tables","author":"Refanidis","year":"1999"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB042","series-title":"Proc. AAAI-2000, Austin, TX","article-title":"An iterative algorithm for synthesizing invariants","author":"Rintanen","year":"2000"},{"issue":"1","key":"10.1016\/S0004-3702(01)00158-8_BIB043","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1017\/S0269888900001089","article-title":"Bridging the gap between planning and scheduling","volume":"15","author":"Smith","year":"2000","journal-title":"Knowledge Engineering Review"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB044","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0004-3702(01)00158-8_BIB045","series-title":"Proc. AAAI-98, Madison, WI","article-title":"Extending graphplan to handle uncertainty & sensing actions","author":"Weld","year":"1998"},{"issue":"2","key":"10.1016\/S0004-3702(01)00158-8_BIB046","first-page":"93","article-title":"Recent advances in AI planning","volume":"20","author":"Weld","year":"1999","journal-title":"AI Magazine"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001588?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001588?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T10:43:41Z","timestamp":1578739421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201001588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0004370201001588"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00158-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}