{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:29:32Z","timestamp":1743013772777,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031490071"},{"type":"electronic","value":"9783031490088"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49008-8_39","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:04:15Z","timestamp":1702559055000},"page":"495-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Search Optimisation Using Planning and Curriculum Learning Techniques"],"prefix":"10.1007","author":[{"given":"Leah","family":"Chrestien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1s\u0306","family":"Pevn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton\u00edn","family":"Komenda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"issue":"8","key":"39_CR1","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1038\/s42256-019-0070-z","volume":"1","author":"F Agostinelli","year":"2019","unstructured":"Agostinelli, F., McAleer, S., Shmakov, A., Baldi, P.: Solving the rubik\u2019s cube with deep reinforcement learning and search. Nature Mach. Intell. 1(8), 356\u2013363 (2019)","journal-title":"Nature Mach. Intell."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Asai, M., Fukunaga, A.: Classical planning in deep latent space: Bridging the subsymbolic-symbolic boundary. arXiv preprint arXiv:1705.00154 (2017)","DOI":"10.1609\/aaai.v32i1.12077"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artif. Intell. 129(1\u20132), 5\u201333 (2001)","DOI":"10.1016\/S0004-3702(01)00108-4"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0010-0277(93)90058-4","volume":"48","author":"JL Elman","year":"1993","unstructured":"Elman, J.L.: Learning and development in neural networks: the importance of starting small. Cognition 48(1), 71\u201399 (1993)","journal-title":"Cognition"},{"key":"39_CR5","unstructured":"Ernandes, M., Gori, M.: Likely-admissible and sub-symbolic heuristics. In: Proceedings of the 16th European Conference on Artificial Intelligence, pp. 613\u2013617 (2004)"},{"issue":"3\u20134","key":"39_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: Strips: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\u20134), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Fox, M., Long, D.: Pddl2. 1: An extension to pddl for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61\u2013124 (2003)","DOI":"10.1613\/jair.1129"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Groshev, E., Goldstein, M., Tamar, A., Srivastava, S., Abbeel, P.: Learning generalized reactive policies using deep neural networks. arXiv:1708.07280 (2017)","DOI":"10.1609\/icaps.v28i1.13872"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"39_CR10","unstructured":"Katz, M., Hoffmann, J.: Mercury planner: Pushing the limits of partial delete relaxation. In: IPC 2014 Planner Abstracts, pp. 43\u201347 (2014)"},{"key":"39_CR11","unstructured":"Katz, M., Sohrabi, S., Samulowitz, H., Sievers, S.: Delfi: Online planner selection for cost-optimal planning. In: IPC-9 Planner Abstracts, pp. 57\u201364 (2018)"},{"key":"39_CR12","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)"},{"key":"39_CR13","unstructured":"Long, D., Fox, M.: Automatic synthesis and use of generic types in planning. In: AAAI, pp. 196\u2013205. AAAI Press (2000)"},{"key":"39_CR14","first-page":"5690","volume":"30","author":"S Racani\u00e8re","year":"2017","unstructured":"Racani\u00e8re, S., Weber, T., Reichert, D., Buesing, L., Guez, A., Jimenez Rezende, D., Puigdom\u00e8nech Badia, A., Vinyals, O., Heess, N., Li, Y., et al.: Imagination-augmented agents for deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 30, 5690\u20135701 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter, S., Westphal, M.: The lama planner: Guiding cost-based anytime planning with landmarks. J. Artif. Intell. Res. 39, 127\u2013177 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"6","key":"39_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S1364-6613(99)01327-3","volume":"3","author":"S Schaal","year":"1999","unstructured":"Schaal, S.: Is imitation learning the route to humanoid robots? Trends Cogn. Sci. 3(6), 233\u2013242 (1999)","journal-title":"Trends Cogn. Sci."},{"key":"39_CR17","unstructured":"Schrader, M.P.B.: gym-sokoban. github.com\/mpSchrader\/gym-sokoban (2018)"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al.: Mastering the game of go without human knowledge. Nature 550(7676), 354\u2013359 (2017)","DOI":"10.1038\/nature24270"},{"issue":"1\u20132","key":"39_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(01)00110-2","volume":"134","author":"G Tesauro","year":"2002","unstructured":"Tesauro, G.: Programming backgammon using self-teaching neural nets. Artif. Intell. 134(1\u20132), 181\u2013199 (2002)","journal-title":"Artif. Intell."},{"key":"39_CR20","first-page":"1069","volume":"7","author":"S Thrun","year":"1994","unstructured":"Thrun, S.: Learning to play the game of chess. Adv. Neural. Inf. Process. Syst. 7, 1069\u20131076 (1994)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"39_CR21","unstructured":"Torralba, A., Alc\u00e1zar, V., Borrajo, D., Kissmann, P., Edelkamp, S.: Symba*: A symbolic bidirectional a* planner. In: International Planning Competition, pp. 105\u2013108 (2014)"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Torrey, L., Shavlik, J., Walker, T., Maclin, R.: Skill acquisition via transfer learning and advice taking. In: European Conference on Machine Learning, pp. 425\u2013436. Springer (2006)","DOI":"10.1007\/11871842_41"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Tsai, Y.H.H., Bai, S., Yamada, M., Morency, L.P., Salakhutdinov, R.: Transformer dissection: An unified understanding for transformer\u2019s attention via the lens of kernel. arXiv:1908.11775 (2019)","DOI":"10.18653\/v1\/D19-1443"},{"key":"39_CR24","first-page":"5998","volume":"30","author":"A Vaswani","year":"2017","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, \u0141, Polosukhin, I.: Attention is all you need. Adv. Neural. Inf. Process. Syst. 30, 5998\u20136008 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"39_CR25","unstructured":"Virseda, J., Borrajo, D., Alc\u00e1zar, V.: Learning heuristic functions for cost-based planning. Plan. Learn. 6 (2013)"},{"key":"39_CR26","unstructured":"Yoon, S.W., Fern, A., Givan, R.: Inductive policy selection for first-order mdps. arXiv preprint arXiv:1301.0614 (2012)"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49008-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:20:30Z","timestamp":1702560030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49008-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031490071","9783031490088"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49008-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faial Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2023.inesctec.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"163","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}