{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T13:14:39Z","timestamp":1690982079163},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014edp7170","type":"journal-article","created":{"date-parts":[[2015,1,31]],"date-time":"2015-01-31T22:09:48Z","timestamp":1422742188000},"page":"363-371","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Macro-Based Heuristic Planning through Action Relationship Analysis"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Zhuo","family":"JIANG","sequence":"first","affiliation":[{"name":"College of Computer Science, Chongqing University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhao","family":"WEN","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Chongqing University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"ZENG","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Chongqing University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihao","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Computer Science, Chongqing University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xibin","family":"WANG","sequence":"additional","affiliation":[{"name":"College of Computer Science, Chongqing University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachio","family":"HIROKAWA","sequence":"additional","affiliation":[{"name":"Research Institute for Information Technology, Kyushu University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Ghallab, D. Nau, and P. Traverso, Automated planning: Theory & practice, Morgan Kaufmann, 2004.","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] B. Bonet and H. Geffner, \u201cPlanning as heuristic search,\u201d Artificial Intelligence, vol.129, no.1-2, pp.5-33, 2001.","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Helmert and C. Domshlak, \u201cLandmarks, critical paths and abstractions: What's the difference anyway?,\u201d 19th International Conference on Automated Planning and Scheduling, ICAPS 2009, pp.162-169, 2009.","DOI":"10.1609\/icaps.v19i1.13370"},{"key":"4","unstructured":"[4] B. Bonnet and H. Geffner, \u201cHsp: Heuristic search planner,\u201d Ai Magazine, 1998."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Betz and M. Helmert, \u201cPlanning with h+ in theory and practice,\u201d 32nd Annual German Conference on Artificial Intelligence, KI 2009, pp.9-16, 2009.","DOI":"10.1007\/978-3-642-04617-9_2"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T. Bylander, \u201cComputational complexity of propositional strips planning,\u201d Artificial Intelligence, vol.69, no.1-2, pp.165-204, 1994.","DOI":"10.1016\/0004-3702(94)90081-7"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Hoffmann and B. Nebel, \u201cThe ff planning system: Fast plan generation through heuristic search,\u201d J. Artificial Intelligence Research, vol.14, pp.263-312, 2001.","DOI":"10.1613\/jair.855"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Hoffmann, J. Porteous, and L. Sebastia, \u201cOrdered landmarks in planning,\u201d J. Artificial Intelligence Research, vol.22, pp.215-278, 2004.","DOI":"10.1613\/jair.1492"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] F. Pommerening and M. Helmert, \u201cOptimal planning for delete-free tasks with incremental lm-cut,\u201d 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012, pp.363-367, Sao Paulo, Brazil, 2012.","DOI":"10.1609\/icaps.v22i1.13532"},{"key":"10","unstructured":"[10] E. Karpas and C. Domshlak, \u201cCost-optimal planning with landmarks,\u201d 21st International Joint Conference on Artificial Intelligence, IJCAI-09, July 2009, pp.1728-1733, International Joint Conferences on Artificial Intelligence, 2009."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] P. Haslum, J. Slaney, and S. Thiebaux, \u201cMinimal landmarks for optimal delete-free planning,\u201d 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012, pp.353-357, June 2012, Sao Paulo, Brazil, 2012.","DOI":"10.1609\/icaps.v22i1.13534"},{"key":"12","unstructured":"[12] P. Haslum, B. Bonet, and H. Geffner, \u201cNew admissible heuristics for domain-independent planning,\u201d 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05\/IAAI-05, pp.1163-1168, 2005."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] T. dela Rosa, A. Garcia-Olaya, and D. Borrajo, \u201cA case-based approach to heuristic planning,\u201d pp.1-18, 2013.","DOI":"10.1007\/s10489-012-0404-6"},{"key":"14","unstructured":"[14] M.A.H. Newton, J. Levine, M. Fox, and D. Long, \u201cLearning macro-actions for arbitrary planners and domains,\u201d Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp.256-263, 2007."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] A. Botea, M. Enzenberger, M. Muller, and J. Schaeffer, \u201cMacro-ff: Improving ai planning with automatically learned macro-operators,\u201d J. Artificial Intelligence Research, vol.24, pp.581-621, 2005.","DOI":"10.1613\/jair.1696"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] A. Dulac, D. Pellier, H. Fiorino, and D. Janiszek, \u201cLearning useful macro-actions for planning with n-grams,\u201d 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, pp.803-810, Nov. 2013.","DOI":"10.1109\/ICTAI.2013.123"},{"key":"17","unstructured":"[17] D. Cai, J. Sun, and M. Yin, \u201cConformant planning heuristics based on plan reuse in belief states,\u201d 23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference, AAAI-08\/IAAI-08, pp.1780-1781, 2008."},{"key":"18","unstructured":"[18] L. Chrpa and R. Bartak, \u201cTowards getting domain knowledge: Plans analysis through investigation of actions dependencies,\u201d 21st International Florida Artificial Intelligence Research Society Conference, FLAIRS-21, pp.531-536, 2008."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] L. Chrpa, T.L. McCluskey, and H. Osborne, \u201cOptimizing plans through analysis of action dependencies and independencies,\u201d 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012, pp.338-342, Sao Paulo, Brazil, 2012.","DOI":"10.1609\/icaps.v22i1.13536"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] A. Coles and A. Smith, \u201cMarvin: A heuristic search planner with online macro-action learning,\u201d J. Artificial Intelligence Research, vol.28, no.1, pp.119-156, 2007.","DOI":"10.1613\/jair.2077"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] S. Warshall, \u201cA theorem on boolean matrices,\u201d J. ACM, vol.9, no.1, pp.11-12, 1962.","DOI":"10.1145\/321105.321107"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Jimenez, T. De La Rosa, S. Fernandez, F. Fernandez, and D. Borrajo, \u201cA review of machine learning for automated planning,\u201d Knowledge Engineering Review, vol.27, no.4, pp.433-467, 2012.","DOI":"10.1017\/S026988891200001X"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/2\/E98.D_2014EDP7170\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T12:35:10Z","timestamp":1690979710000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/2\/E98.D_2014EDP7170\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edp7170","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}