{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:23:41Z","timestamp":1766067821988,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436185"},{"type":"electronic","value":"9783031436192"}],"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-43619-2_40","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"595-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing Temporal Planning by\u00a0Sequential Macro-Actions"],"prefix":"10.1007","author":[{"given":"Marco","family":"De Bortoli","sequence":"first","affiliation":[]},{"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[]},{"given":"Gerald","family":"Steinbauer-Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","unstructured":"Banihashemi, B., De Giacomo, G., Lesp\u00e9rance, Y.: Abstraction in situation calculus action theories. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1048\u20131055. AAAI Press (2017). https:\/\/doi.org\/10.1609\/aaai.v31i1.10693","DOI":"10.1609\/aaai.v31i1.10693"},{"key":"40_CR2","doi-asserted-by":"publisher","unstructured":"Benton, J., Coles, A., Coles, A.: Temporal planning with preferences and time-dependent continuous costs. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 2\u201310. AAAI Press (2012). https:\/\/doi.org\/10.1609\/icaps.v22i1.13509","DOI":"10.1609\/icaps.v22i1.13509"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1613\/jair.1696","volume":"24","author":"A Botea","year":"2005","unstructured":"Botea, A., Enzenberger, M., M\u00fcller, M., Schaeffer, J.: Macro-FF: improving AI planning with automatically learned macro-operators. J. Artif. Intell. Res. 24, 581\u2013621 (2005). https:\/\/doi.org\/10.1613\/jair.1696","journal-title":"J. Artif. Intell. Res."},{"key":"40_CR4","doi-asserted-by":"publisher","unstructured":"Chrpa, L., Vallati, M.: Improving domain-independent planning via critical section macro-operators. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 7546\u20137553. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33017546","DOI":"10.1609\/aaai.v33i01.33017546"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1613\/jair.1.13269","volume":"74","author":"L Chrpa","year":"2022","unstructured":"Chrpa, L., Vallati, M.: Planning with critical section macros: theory and practice. J. Artif. Intell. Res. 74, 691\u2013732 (2022). https:\/\/doi.org\/10.1613\/jair.1.13269","journal-title":"J. Artif. Intell. Res."},{"key":"40_CR6","doi-asserted-by":"publisher","unstructured":"Chrpa, L., Vallati, M., McCluskey, T.L.: MUM: a technique for maximising the utility of macro-operators by constrained generation and use. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 65\u201373. AAAI Press (2014). https:\/\/doi.org\/10.1609\/icaps.v24i1.13626","DOI":"10.1609\/icaps.v24i1.13626"},{"key":"40_CR7","unstructured":"Coles, A., Smith, A.: On the inference and management of macro-actions in forward-chaining planning. In: Proceedings of the UK Planning and Scheduling SIG. University of Strathclyde (2005). www.strathprints.strath.ac.uk\/2751\/1\/strathprints002751.pdf"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1613\/jair.2077","volume":"28","author":"A Coles","year":"2007","unstructured":"Coles, A., Smith, A.: Marvin: a heuristic search planner with online macro-action learning. J. Artif. Intell. Res. 28, 119\u2013156 (2007). https:\/\/doi.org\/10.1613\/jair.2077","journal-title":"J. Artif. Intell. Res."},{"key":"40_CR9","unstructured":"Dawson, C., Sikl\u00f3ssy, L.: The role of preprocessing in problem solving systems. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 465\u2013471. William Kaufmann (1977). www.ijcai.org\/Proceedings\/77-1\/Papers\/078.pdf"},{"key":"40_CR10","doi-asserted-by":"publisher","unstructured":"De Bortoli, M., Chrpa, L., Gebser, M., Steinbauer-Wagner, G.: Enhancing temporal planning domains by sequential macro-actions (extended version) (2023). https:\/\/doi.org\/10.48550\/arXiv.2307.12081","DOI":"10.48550\/arXiv.2307.12081"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-031-28469-4_8","volume-title":"RoboCup 2022, RoboCup 2022","author":"M De Bortoli","year":"2023","unstructured":"De Bortoli, M., Steinbauer-Wagner, G.: Evaluating action-based temporal planners performance in the RoboCup logistics league. In: Eguchi, A., Lau, N., Paetzel-Pr\u00fcsmann, M., Wanichanon, T. (eds.) RoboCup 2022, RoboCup 2022. Lecture Notes in Computer Science, vol. 13561, pp. 87\u201399. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-28469-4_8"},{"key":"40_CR12","doi-asserted-by":"publisher","unstructured":"Eyerich, P., Mattm\u00fcller, R., R\u00f6ger, G.: Using the context-enhanced additive heuristic for temporal and numeric planning. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 130\u2013137. AAAI Press (2009). https:\/\/doi.org\/10.1609\/icaps.v19i1.13373","DOI":"10.1609\/icaps.v19i1.13373"},{"key":"40_CR13","unstructured":"Fadel, R.: Planning with complex actions. Master\u2019s thesis, Stanford University (2002). www.ksl.stanford.edu\/pub\/KSL_Reports\/KSL-02-03.pdf"},{"issue":"3\/4","key":"40_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R Fikes","year":"1971","unstructured":"Fikes, R., Nilsson, N.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\/4), 189\u2013208 (1971). https:\/\/doi.org\/10.1016\/0004-3702(71)90010-5","journal-title":"Artif. Intell."},{"key":"40_CR15","doi-asserted-by":"publisher","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61\u2013124 (2003). https:\/\/doi.org\/10.1613\/jair.1129","DOI":"10.1613\/jair.1129"},{"key":"40_CR16","unstructured":"Gabaldon, A.: Programming hierarchical task networks in the situation calculus. In: Proceedings of the AIPS 2002 Workshop on On-line Planning and Scheduling (2002). www.cs.toronto.edu\/~alfredo\/Papers\/Gabaldon-KRA11.pdf"},{"key":"40_CR17","unstructured":"Hansson, E.: Temporal task and motion plans: planning and plan repair\u2013repairing temporal task and motion plans using replanning with temporal macro operators. Master\u2019s thesis, Linkoping University (2018). www.liu.diva-portal.org\/smash\/get\/diva2:1263869\/FULLTEXT01.pdf"},{"key":"40_CR18","doi-asserted-by":"publisher","unstructured":"Hofmann, T., Niemueller, T., Lakemeyer, G.: Initial results on generating macro actions from a plan database for planning on autonomous mobile robots. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 498\u2013503. AAAI Press (2017). https:\/\/doi.org\/10.1609\/icaps.v27i1.13868","DOI":"10.1609\/icaps.v27i1.13868"},{"key":"40_CR19","doi-asserted-by":"publisher","unstructured":"Hofmann, T., Niemueller, T., Lakemeyer, G.: Macro operator synthesis for ADL domains. In: Proceedings of the European Conference on Artificial Intelligence, pp. 761\u2013768. IOS Press (2020). https:\/\/doi.org\/10.3233\/FAIA200164","DOI":"10.3233\/FAIA200164"},{"key":"40_CR20","unstructured":"Lifschitz, V., Ren, W.: A modular action description language. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 853\u2013859. AAAI Press (2006). www.aaai.org\/Papers\/AAAI\/2006\/AAAI06-135.pdf"},{"key":"40_CR21","doi-asserted-by":"publisher","unstructured":"Miura, S., Fukunaga, A.: Automatic extraction of axioms for planning. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 218\u2013227. AAAI Press (2017). https:\/\/doi.org\/10.1609\/icaps.v27i1.13815","DOI":"10.1609\/icaps.v27i1.13815"},{"key":"40_CR22","unstructured":"Newton, M., Levine, J., Fox, M., Long, D.: Learning macro-actions for arbitrary planners and domains. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 256\u2013263. AAAI Press (2007). https:\/\/aaai.org\/papers\/icaps-07-033-learning-macro-actions-for-arbitrary-planners-and-domains\/"},{"key":"40_CR23","doi-asserted-by":"publisher","first-page":"e3","DOI":"10.1017\/S0269888918000012","volume":"33","author":"M Vallati","year":"2018","unstructured":"Vallati, M., Chrpa, L., McCluskey, T.: What you always wanted to know about the deterministic part of the international planning competition (IPC) 2014 (but were too afraid to ask). Knowl. Eng. Rev. 33, e3 (2018). https:\/\/doi.org\/10.1017\/S0269888918000012","journal-title":"Knowl. Eng. Rev."},{"key":"40_CR24","unstructured":"Vidal, V.: YAHSP3 and YAHSP3-MT in the 8th International Planning Competition. In: Proceedings of the International Planning Competition, pp. 64\u201365 (2014). www.v.vidal.free.fr\/onera\/publis\/ipc14-yahsp3.pdf"},{"key":"40_CR25","unstructured":"Wullinger, P., Schmid, U., Scholz, U.: Spanning the middle ground between classical and temporal planning. In: Workshop Planen und Konfigurieren (2008). www.cogsys.wiai.uni-bamberg.de\/publications\/pw_us_us_puk_22.pdf"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:10:04Z","timestamp":1695481804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_40","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":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","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":"41","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":"11","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":"37% - 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":"3","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":"3,6","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)"}}]}}