{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:46:26Z","timestamp":1743137186113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031284687"},{"type":"electronic","value":"9783031284694"}],"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-28469-4_8","type":"book-chapter","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T07:04:50Z","timestamp":1679555090000},"page":"87-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Evaluating Action-Based Temporal Planners Performance in\u00a0the\u00a0RoboCup Logistics League"],"prefix":"10.1007","author":[{"given":"Marco","family":"De Bortoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerald","family":"Steinbauer-Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,24]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Benton, J., Coles, A., Coles, A.: Temporal planning with preferences and time-dependent continuous costs, vol. 22 (2012)","DOI":"10.1609\/icaps.v22i1.13509"},{"key":"8_CR2","unstructured":"Bit-Monnot, A., Ghallab, M., Ingrand, F., Smith, D.E.: FAPE: a constraint-based planner for generative and hierarchical temporal planning. arXiv preprint arXiv:2010.13121 (2020)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Coles, A., Coles, A., Fox, M., Long, D.: Forward-chaining partial-order planning, pp. 42\u201349 (2010)","DOI":"10.1609\/icaps.v20i1.13403"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.3608","volume":"44","author":"AJ Coles","year":"2012","unstructured":"Coles, A.J., Coles, A.I., Fox, M., Long, D.: Colin: planning with continuous linear numeric change. J. Artif. Intell. Res. 44, 1\u201396 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR5","unstructured":"Dr\u00e9o, J., Sav\u00e9ant, P., Schoenauer, M., Vidal, V.: Divide-and-evolve: the marriage of descartes and darwin. In: Proceedings of the 7th International Planning Competition (IPC). Freiburg, Germany, vol. 91, p. 155 (2011)"},{"key":"8_CR6","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: ICAPS (2009)","DOI":"10.1609\/icaps.v19i1.13373"},{"key":"8_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. (JAIR) 20, 61\u2013124 (2003)","DOI":"10.1613\/jair.1129"},{"key":"8_CR8","unstructured":"Furelos-Blanco, D., Jonsson, A.: Cp4tp: A classical planning for temporal planning portfolio (2018)"},{"key":"8_CR9","unstructured":"Gigante, N.: Timeline-based planning: Expressiveness and complexity (2019)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Hertle, A., Nebel, B.: Efficient auction based coordination for distributed multi-agent planning in temporal domains using resource abstraction. In: Trollmann, F., Turhan, A.Y. (eds.) KI 2018: Advances in Artificial Intelligence, pp. 86\u201398 (2018)","DOI":"10.1007\/978-3-030-00111-7_8"},{"key":"8_CR11","unstructured":"H\u00f6ller, D., et al.: Hddl - a language to describe hierarchical planning problems"},{"key":"8_CR12","unstructured":"IPC: International Planning Competition 2018 (2021). https:\/\/ipc2018.bitbucket.io\/#. Accessed 27 Apr 2022"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00502-020-00826-5","volume":"137","author":"P Kohout","year":"2020","unstructured":"Kohout, P., De Bortoli, M., Ludwiger, J., Ulz, T., Steinbauer, G.: A multi-robot architecture for the RoboCup logistics league. Elektrotechnik und Informationstechnik 137(6), 291\u2013296 (2020)","journal-title":"Elektrotechnik und Informationstechnik"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1613\/jair.1141","volume":"20","author":"DS Nau","year":"2003","unstructured":"Nau, D.S., et al.: Shop2: an HTN planning system. J. Artif. Intell. Res. 20, 379\u2013404 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR15","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)","DOI":"10.1007\/978-3-319-42620-4_45"},{"issue":"1","key":"8_CR16","first-page":"754","volume":"29","author":"T Niemueller","year":"2021","unstructured":"Niemueller, T., Hofmann, T., Lakemeyer, G.: Goal reasoning in the clips executive for integrated planning and execution. Proc. Int. Conf. Autom. Plan. Sched. 29(1), 754\u2013763 (2021)","journal-title":"Proc. Int. Conf. Autom. Plan. Sched."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1613\/jair.4697","volume":"53","author":"MF Rankooh","year":"2015","unstructured":"Rankooh, M.F., Ghassem-Sani, G.: ITSAT: an efficient sat-based temporal planner. J. Artif. Intell. Res. 53, 541\u2013632 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Sch\u00e4pers, B., Niemueller, T., Lakemeyer, G., Gebser, M., Schaub, T.: Asp-based time-bounded planning for logistics robots (2018)","DOI":"10.1609\/icaps.v28i1.13927"},{"key":"8_CR19","unstructured":"Smith, D.E., Frank, J., Cushing, W.: The ANML language. In: The ICAPS-08 Workshop on Knowledge Engineering for Planning and Scheduling (KEPS), vol. 31 (2008)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Vallati, M., Chrpa, L., Grze\u015b, M., McCluskey, T.L., Roberts, M., Sanner, S., et al.: The 2014 international planning competition: Progress and trends (2015)","DOI":"10.1609\/aimag.v36i3.2571"},{"key":"8_CR21","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":"8_CR22","doi-asserted-by":"crossref","unstructured":"Wang, D., Williams, B.: tBurton: a divide and conquer temporal planner. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29, no. 1 (2015)","DOI":"10.1609\/aaai.v29i1.9656"}],"container-title":["Lecture Notes in Computer Science","RoboCup 2022:"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28469-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T07:06:19Z","timestamp":1679555179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28469-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031284687","9783031284694"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28469-4_8","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 March 2023","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":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"robocup2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.robocup.org\/","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":"40","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":"28","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":"70% - 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":"1.43","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)"}}]}}