{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:35:44Z","timestamp":1771612544199,"version":"3.50.1"},"reference-count":44,"publisher":"International Academy Publishing (IAP)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.7.9.2099-2106","type":"journal-article","created":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T09:49:29Z","timestamp":1349344169000},"source":"Crossref","is-referenced-by-count":5,"title":["A Survey of Heuristics for Domain-Independent Planning"],"prefix":"10.17706","volume":"7","author":[{"given":"Ruishi","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2012,9,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00364-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00108-4"},{"issue":"3","key":"ref4","first-page":"77","article-title":"Heuristic Search Planner 2.0.","volume":"22","author":"Bonet","year":"2001","unstructured":"[5] Bonet, B., Geffner, H. Heuristic Search Planner 2.0. AI Magazine 2001, 22(3): 77-80.","journal-title":"AI Mag","ISSN":"https:\/\/id.crossref.org\/issn\/0738-4602","issn-type":"print"},{"key":"ref5","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","unstructured":"[6] Hoffmann, J. and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14: 253-302.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"issue":"24","key":"ref6","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1613\/jair.1747","article-title":"Where \"Ignoring Delete Lists\" Works: Local Search Topology in Planning Benchmarks.","author":"Hoffmann","year":"2005","unstructured":"[7] Hoffmann, J. Where \"Ignoring Delete Lists\" Works: Local Search Topology in Planning Benchmarks. Journal of Artificial Intelligence Research, 2005(24): 685-758.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"key":"ref7","first-page":"12","article-title":"LPG: a Planner based on Local Search for Planning Graphs.","volume-title":"Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 02)","author":"Gerevini","year":"2002","unstructured":"[8] Gerevini, A., Serina, I. LPG: a Planner based on Local Search for Planning Graphs. Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS'02), 2002: 12-22."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.01.002"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","article-title":"The fast downward planning system.","volume":"26","author":"Helmert","year":"2006","unstructured":"[10] Helmert, M. 2006. The fast downward planning system. Journal of Artificial Intelligence Research, 26: 191--246.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","article-title":"The LAMA planner: Guiding cost-based anytime planning with landmarks.","volume":"39","author":"Richter","year":"2010","unstructured":"[11] Richter, S. and Westphal, M. The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 2010, 39: 127-177.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"key":"ref11","first-page":"975","article-title":"Landmark revisited.","volume-title":"Proc AAAI 2008","author":"Richter","year":"2008","unstructured":"[12] Richter, S., Helmert, M. and Westphal, M. 2008. Landmark revisited. In Proc. AAAI 2008, 975\u2013982."},{"key":"ref12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1613\/jair.1144","article-title":"The Metric-FF Planning System: Translating \"Ignoring Delete Lists\" to Numeric State Variables.","volume":"20","author":"Hoffmann","year":"2003","unstructured":"[13] Hoffmann, J. The Metric-FF Planning System: Translating \"Ignoring Delete Lists\" to Numeric State Variables. Journal of Artificial Intelligence Research, 2003,20: 291-341.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"issue":"3","key":"ref13","first-page":"67","article-title":"The model checking integrated planning system (MIPS).","volume":"22","author":"Edelkamp","year":"2001","unstructured":"[15] Edelkamp, S. and Helmert, M. 2001. The model checking integrated planning system (MIPS). AI Magazine, 22(3):67-71.","journal-title":"AI Mag","ISSN":"https:\/\/id.crossref.org\/issn\/0738-4602","issn-type":"print"},{"key":"ref14","first-page":"13","article-title":"Planning with pattern databases.","volume-title":"Proc ECP 2001","author":"Edelkamp","year":"2001","unstructured":"[16] Edelkamp, S. 2001. Planning with pattern databases. In Proc. ECP 2001, 13\u201324."},{"key":"ref15","first-page":"1728","article-title":"Cost-optimal planning with landmarks.","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009)","author":"Karpas","year":"2009","unstructured":"[17] Karpas, E., Domshlak, C. 2009. Cost-optimal planning with landmarks. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1728\u20131733."},{"key":"ref16","volume-title":"Heuristics intelligent search strategies for computer problem solving","author":"Pearl","year":"1983","unstructured":"[18] Pearl, J. 1983. Heuristics: intelligent search strategies for computer problem solving. New York, Addison-Wesley, 1983."},{"key":"ref17","first-page":"484","article-title":"Speeding up the calculation of heuristics for heuristic search-based planning.","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI 2002)","author":"Liu","year":"2002","unstructured":"[20] Liu, Y. and Koenig, S. and Furcy, D. 2002. Speeding up the calculation of heuristics for heuristic search-based planning. In Proceedings of the National Conference on Artificial Intelligence (AAAI 2002), 484-491."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00047-1"},{"key":"ref19","first-page":"140","article-title":"Admissible heuristics for optimal planning.","volume-title":"Proc of AIPS 2000","author":"Haslum","year":"2000","unstructured":"[24] Haslum, P. and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. of AIPS 2000, 140-149."},{"key":"ref20","first-page":"1163","article-title":"New admissible heuristics for domain-independent planning.","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI 2005)","author":"Haslum","year":"2005","unstructured":"[25] Haslum, P. and Bonet, B. and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In Proceedings of the National Conference on Artificial Intelligence (AAAI 2005), 1163-1168."},{"key":"ref21","first-page":"176","article-title":"Flexible abstraction heuristics for optimal sequential planning.","volume-title":"Proc ICAPS 2007","author":"Helmert","year":"2007","unstructured":"[26] Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In Proc. ICAPS 2007, 176\u2013183."},{"key":"ref22","first-page":"1202","article-title":"Finding optimal solutions to the twenty-four puzzle.","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI 1996)","author":"Korf","year":"1996","unstructured":"[27] Korf, R.E. and Taylor, L.A. 1996. Finding optimal solutions to the twenty-four puzzle. In Proceedings of the National Conference on Artificial Intelligence (AAAI 1996), 1202-1207."},{"key":"ref23","first-page":"700","article-title":"Finding optimal solutions to Rubik's Cube using pattern databases.","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI 1998)","author":"Korf","year":"1998","unstructured":"[28] Korf, R.E. 1998. Finding optimal solutions to Rubik's Cube using pattern databases. In Proceedings of the National Conference on Artificial Intelligence (AAAI 1998), 700-705."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00092-3"},{"key":"ref25","first-page":"1007","article-title":"Domain-independent construction of pattern database heuristics for cost-optimal planning.","volume-title":"Proceedings of 22rd AAAI Conference on Artificial Intelligence (AAAI 07)","author":"Haslum","year":"2007","unstructured":"[30] Haslum, P. and Botea, A. and Helmert, M. and Bonet, B. and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proceedings of 22rd AAAI Conference on Artificial Intelligence (AAAI'07), 1007- 1012."},{"key":"ref26","first-page":"1547","article-title":"Explicit-state abstraction: A new method for generating heuristic functions.","volume-title":"Proceedings of 23rd AAAI Conference on Artificial Intelligence (AAAI 08)","author":"Helmert","year":"2008","unstructured":"[32] Helmert, M. and Haslum, P. and Hoffmann, J. 2008. Explicit-state abstraction: A new method for generating heuristic functions. In Proceedings of 23rd AAAI Conference on Artificial Intelligence (AAAI'08), 1547- 1550."},{"key":"ref27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1613\/jair.3063","article-title":"Implicit Abstraction Heuristics.","volume":"39","author":"Katz","year":"2010","unstructured":"[33] Katz, M., and Domshlak, C. Implicit Abstraction Heuristics. Journal of Artificial Intelligence Research, 2010, 39: 51-126.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"key":"ref28","first-page":"186","article-title":"Structural-pattern databases.","volume-title":"Proc ICAPS 2009","author":"Katz","year":"2009","unstructured":"[34] Katz, M., and Domshlak, C. 2009. Structural-pattern databases. In Proc ICAPS 2009, 186\u2013193."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.021"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1613\/jair.1492","article-title":"Ordered landmarks in planning.","volume":"22","author":"Hoffmann","year":"2004","unstructured":"[36] Hoffmann J and Porteous J and Sebastia L. Ordered landmarks in planning. Journal of Artificial Intelligence Research, 2004, 22: 215-278.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1613\/jair.715","article-title":"On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm.","volume":"12","author":"Koehler","year":"2000","unstructured":"[37] Koehler, J. and Hoffmann, J. 2000. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 2000, 12: 338-386.","journal-title":"J Artif Intell Res","ISSN":"https:\/\/id.crossref.org\/issn\/1076-9757","issn-type":"print"},{"key":"ref32","first-page":"50","article-title":"When abstractions met landmarks.","volume-title":"Proc ICAPS 2010","author":"Domshlak","year":"2010","unstructured":"[41] Domshlak, C., Katz, M., Lefler, S. 2010. When abstractions met landmarks. In Proc ICAPS 2010, pp. 50\u201356."},{"key":"ref33","article-title":"SATPLAN04: Planning as satisfiability.","volume-title":"Proc ICAPS 2004","author":"Kautz","year":"2004","unstructured":"[42] Kautz, H. and Selman, B. 2004. SATPLAN04: Planning as satisfiability. In Proc. ICAPS 2004."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.11.010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[3] International Planning Competition Archives official website: http:\/\/ipc.icaps-conference.org\/.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[14] Bertoli, P. and Cimatti, A. and Pistore, M. and Roveri, M. and Traverso, P. 2001. MBP: a model based planner. In Proc. of the IJCAI'01 Workshop on Planning under Uncertainty and Incomplete Information.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[19] Russell, J., Norvig, P. 2002. Artificial Intelligence: A Modern Approach. Prentice Hall. 2002.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[22] Yoon, S. and Fern, A. and Givan, R. 2006. Learning Heuristic Functions from Relaxed Plans. In Proc. of International conference on automated planning and scheduling (ICAPS 2006), 162-171.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[23] Helmert, M. and Domshlak, C. 2009. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway. In Proc. of International conference on automated planning and scheduling (ICAPS 2009), 162-169.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[31] Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In Proc. Artificial Intelligence Planning and Scheduling (AIPS 2002), 274-283.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[38] Karpas, E., Domshlak, C. (2009). Cost-optimal planning with landmarks. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 1728\u20131733, Pasadena, CA, USA.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[39] Helmert, M. and MattmUller. 2008. Accuracy of admissible heuristic functions in selected planning domains. In Proceedings of 23rd AAAI Conference on Artificial Intelligence (AAAI'08), 938-943.","DOI":"10.1016\/j.artint.2007.05.009"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[40] Roger, G. and Helmert, M. 2009. Combining heuristic estimators for satisficing planning. In ICAPS 2009 Workshop on Heuristics for Domain-Independent Planning, 43-48.","DOI":"10.1016\/j.artint.2007.05.009"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T11:48:04Z","timestamp":1562240884000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/7281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,1]]},"references-count":44,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2012,9,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.7.9.2099-2106","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,9,1]]}}}