{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:07:39Z","timestamp":1743084459250,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031550140"},{"type":"electronic","value":"9783031550157"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55015-7_24","type":"book-chapter","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:57:33Z","timestamp":1710363453000},"page":"287-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Applicability of\u00a0Planning in\u00a0the\u00a0RoboCup Logistics League Using Macro-actions Refinement"],"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":[[2024,3,14]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Benton, J., Coles, A., Coles, A.: Temporal planning with preferences and time-dependent continuous costs (2012)","key":"24_CR1","DOI":"10.1609\/icaps.v22i1.13509"},{"key":"24_CR2","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)","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Cashmore, M., et al.: ROSPlan: planning in the robot operating system. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 25 (2015)","key":"24_CR3","DOI":"10.1609\/icaps.v25i1.13699"},{"doi-asserted-by":"crossref","unstructured":"Chrpa, L., Vallati, M.: Improving domain-independent planning via critical section macro-operators. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33 (2019)","key":"24_CR4","DOI":"10.1609\/aaai.v33i01.33017546"},{"key":"24_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."},{"doi-asserted-by":"crossref","unstructured":"Chrpa, L., Vallati, M., McCluskey, T.L.: MUM: a technique for maximising the utility of macro-operators by constrained generation and use. In: Twenty-Fourth ICAPS (2014)","key":"24_CR6","DOI":"10.1609\/icaps.v24i1.13626"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2017.11.006","volume":"256","author":"A Cimatti","year":"2018","unstructured":"Cimatti, A., Do, M., Micheli, A., Roveri, M., Smith, D.E.: Strong temporal planning with uncontrollable durations. Artif. Intell. 256, 1\u201334 (2018)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Coles, A., Coles, A., Fox, M., Long, D.: Forward-chaining partial-order planning. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 20 (2010)","key":"24_CR8","DOI":"10.1609\/icaps.v20i1.13403"},{"unstructured":"Coles, A., Smith, A.: On the inference and management of macro-actions in forward-chaining planning. In: Twenty-Fourth UK Planning and Scheduling SIG (2005)","key":"24_CR9"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1613\/jair.2077","volume":"28","author":"AI Coles","year":"2007","unstructured":"Coles, A.I., Smith, A.J.: Marvin: a heuristic search planner with online macro-action learning. J. Artif. Intell. Res. 28, 119\u2013156 (2007)","journal-title":"J. Artif. Intell. Res."},{"unstructured":"Dawson, C., Siklossy, L.: The role of preprocessing in problem solving systems: \u201can ounce of reflection is worth a pound of backtracking\u201d. In: Proceedings of the 5th International Joint Conference on Artificial Intelligence, vol. 1, pp. 465\u2013471 (1977)","key":"24_CR11"},{"doi-asserted-by":"publisher","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. LNCS, vol. 13561, pp. 87\u201399. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-28469-4_8","key":"24_CR12","DOI":"10.1007\/978-3-031-28469-4_8"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1), 61\u201395 (1991). https:\/\/doi.org\/10.1016\/0004-3702(91)90006-6","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287\u2013290 (2022)","key":"24_CR14","DOI":"10.1145\/3544585.3544600"},{"doi-asserted-by":"crossref","unstructured":"Eyerich, P., Mattm\u00fcller, R., R\u00f6ger, G.: Using the context-enhanced additive heuristic for temporal and numeric planning. In: Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009). AAAI Press (2009)","key":"24_CR15","DOI":"10.1609\/icaps.v19i1.13373"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s13218-016-0449-5","volume":"30","author":"A Ferrein","year":"2016","unstructured":"Ferrein, A., Steinbauer, G.: 20 years of RoboCup: a subjective retrospection. KI-K\u00fcnstliche Intelligenz 30, 225\u2013232 (2016)","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"issue":"3\/4","key":"24_CR17","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.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\/4), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. (JAIR) 20, 61\u2013124 (2003)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"unstructured":"Hansson, E.: Temporal task and motion plans: Planning and plan repair: repairing temporal task and motion plans using replanning with temporal macro operators (2018)","key":"24_CR19"},{"doi-asserted-by":"crossref","unstructured":"Hofmann, T., Limpert, N., Matar\u00e9, V., Ferrein, A., Lakemeyer, G.: Winning the robocup logistics league with fast navigation, precise manipulation, and robust goal reasoning. In: RoboCup 2019: Robot World Cup XXIII, pp. 504\u2013516 (2019)","key":"24_CR20","DOI":"10.1007\/978-3-030-35699-6_41"},{"doi-asserted-by":"crossref","unstructured":"Hofmann, T., Niemueller, T., Lakemeyer, G.: Initial results on generating macro actions from a plan database for planning on autonomous mobile robots. In: Twenty-Seventh International Conference on Automated Planning and Scheduling (2017)","key":"24_CR21","DOI":"10.1609\/icaps.v27i1.13868"},{"doi-asserted-by":"crossref","unstructured":"Miura, S., Fukunaga, A.: Automatic extraction of axioms for planning. In: Twenty-Seventh International Conference on Automated Planning and Scheduling (2017)","key":"24_CR22","DOI":"10.1609\/icaps.v27i1.13815"},{"key":"24_CR23","volume-title":"Automated Planning: Theory & Practice","author":"D Nau","year":"2004","unstructured":"Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"unstructured":"Newton, M.A.H., Levine, J., Fox, M., Long, D.: Learning macro-actions for arbitrary planners and domains. In: ICAPS, vol. 2007, pp. 256\u2013263 (2007)","key":"24_CR24"},{"doi-asserted-by":"crossref","unstructured":"Niemueller, T., Ewert, D., Reuter, S., Ferrein, A., Jeschke, S., Lakemeyer, G.: RoboCup Logistics League Sponsored by Festo: A Competitive Factory Automation Testbed, pp. 605\u2013618 (2016)","key":"24_CR25","DOI":"10.1007\/978-3-319-42620-4_45"},{"unstructured":"RoboCup: RoboCup Logistics League - German Open Aachen 2023 (2023). https:\/\/robocup-logistics.github.io\/go2023\/. Accessed 01 May 2023","key":"24_CR26"},{"unstructured":"ROSPlan: ROSPlan Esteral Plan (2021). https:\/\/kcl-planning.github.io\/ROSPlan\/\/tutorials\/tutorial_05. Accessed 12 Apr 2023","key":"24_CR27"},{"doi-asserted-by":"crossref","unstructured":"Ulz, T., Ludwiger, J., Steinbauer, G.: A robust and flexible system architecture for facing the robocup logistics league challenge. In: RoboCup 2018: Robot World Cup XXII (2019)","key":"24_CR28","DOI":"10.1007\/978-3-030-27544-0_40"},{"unstructured":"Veloso, M.M., P\u00e9rez, A., Carbonell, J.G.: Nonlinear planning with parallel resource allocation (1990)","key":"24_CR29"},{"unstructured":"Vidal, V.: YAHSP3 and YAHSP3-MT in the 8th International Planning Competition. In: Proceedings of the 8th International Planning Competition (IPC-2014), pp. 64\u201365 (2014)","key":"24_CR30"},{"unstructured":"Wullinger, P., Schmid, U., Scholz, U.: Spanning the middle ground between classical and temporal planning. In: Proceedings of the 22nd Workshop on Planen, Scheduling und Konfigurieren (2008)","key":"24_CR31"}],"container-title":["Lecture Notes in Computer Science","RoboCup 2023: Robot World Cup XXVI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55015-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:59:50Z","timestamp":1710363590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55015-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031550140","9783031550157"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55015-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RoboCup","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Robot World Cup","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"robocup2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.robocup.org\/en\/home\/","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":"59","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":"36","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":"61% - 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","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)"}}]}}