{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:05:09Z","timestamp":1743012309973,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031387111"},{"type":"electronic","value":"9783031387128"}],"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-38712-8_1","type":"book-chapter","created":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T04:02:26Z","timestamp":1691640146000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Multi-Agent Programming Contest 2022"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4652-901X","authenticated-orcid":false,"given":"Tobias","family":"Ahlbrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-1440","authenticated-orcid":false,"given":"J\u00fcrgen","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8369-4890","authenticated-orcid":false,"given":"Niklas","family":"Fiekas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8252-4099","authenticated-orcid":false,"given":"Tabajara","family":"Krausburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"1_CR1","unstructured":"Aeronautiques, C., et al.: PDDL $$|$$ the planning domain definition language. Technical report (1998)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-66534-0_9","volume-title":"Engineering Multi-Agent Systems","author":"T Ahlbrecht","year":"2020","unstructured":"Ahlbrecht, T., Dix, J., Fiekas, N., Krausburg, T.: Accept a challenge: the multi-agent programming contest. In: Baroglio, C., Hubner, J.F., Winikoff, M. (eds.) EMAS 2020. LNCS (LNAI), vol. 12589, pp. 129\u2013143. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-66534-0_9"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-59299-8_1","volume-title":"The Multi-Agent Programming Contest 2019","author":"T Ahlbrecht","year":"2020","unstructured":"Ahlbrecht, T., Dix, J., Fiekas, N., Krausburg, T.: The multi-agent programming contest: a R\u00e9sum\u00e9. In: Ahlbrecht, T., Dix, J., Fiekas, N., Krausburg, T. (eds.) MAPC 2019. LNCS (LNAI), vol. 12381, pp. 3\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59299-8_1"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-88549-6_1","volume-title":"The Multi-Agent Programming Contest 2021","author":"T Ahlbrecht","year":"2021","unstructured":"Ahlbrecht, T., Dix, J., Fiekas, N., Krausburg, T.: The 15th multi-agent programming contest. In: Ahlbrecht, T., Dix, J., Fiekas, N., Krausburg, T. (eds.) MAPC 2021. LNCS (LNAI), vol. 12947, pp. 3\u201320. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88549-6_1"},{"key":"1_CR5","unstructured":"Behnke, G., et al.: Hierarchical planning in the IPC. In: Workshop on HTN Planning (ICAPS) (2019)"},{"key":"1_CR6","unstructured":"Bellifemine, F., Poggi, A., Rimassa, G.: JADE\u2013a FIPA-compliant agent framework. In: Proceedings of PAAM, London, vol. 99, p. 33 (1999)"},{"key":"1_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71956-4","volume-title":"Programming Multi-agent Systems in AgentSpeak Using Jason","author":"RH Bordini","year":"2007","unstructured":"Bordini, R.H., H\u00fcbner, J.F., Wooldridge, M.: Programming Multi-agent Systems in AgentSpeak Using Jason, vol. 8. Wiley, Hoboken (2007)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-66534-0_10","volume-title":"Engineering Multi-Agent Systems","author":"S Castle-Green","year":"2020","unstructured":"Castle-Green, S., Dewfall, A., Logan, B.: The intention progression competition. In: Baroglio, C., Hubner, J.F., Winikoff, M. (eds.) EMAS 2020. LNCS (LNAI), vol. 12589, pp. 144\u2013151. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-66534-0_10"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11750734_21","volume-title":"Computational Logic in Multi-Agent Systems","author":"M Dastani","year":"2006","unstructured":"Dastani, M., Dix, J., Novak, P.: The first contest on multi-agent systems based on computational logic. In: Toni, F., Torroni, P. (eds.) CLIMA 2005. LNCS (LNAI), vol. 3900, pp. 373\u2013384. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11750734_21"},{"issue":"4","key":"1_CR10","first-page":"73","volume":"39","author":"W Harrison","year":"2018","unstructured":"Harrison, W., Downs, A., Schlenoff, C.: The agile robotics for industrial automation competition. AI Mag. 39(4), 73\u201376 (2018)","journal-title":"AI Mag."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-0-387-89299-3_4","volume-title":"Multi-Agent Programming","author":"KV Hindriks","year":"2009","unstructured":"Hindriks, K.V.: Programming rational agents in GOAL. In: El Fallah Seghrouchni, A., Dix, J., Dastani, M., Bordini, R.H. (eds.) Multi-Agent Programming, pp. 119\u2013157. Springer, Boston, MA (2009). https:\/\/doi.org\/10.1007\/978-0-387-89299-3_4"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-319-18615-3_54","volume-title":"RoboCup 2014: Robot World Cup XVIII","author":"A Visser","year":"2015","unstructured":"Visser, A., Ito, N., Kleiner, A.: RoboCup rescue simulation innovation strategy. In: Bianchi, R.A.C., Akin, H.L., Ramamoorthy, S., Sugiura, K. (eds.) RoboCup 2014. LNCS (LNAI), vol. 8992, pp. 661\u2013672. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18615-3_54"}],"container-title":["Lecture Notes in Computer Science","The Multi-Agent Programming Contest 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38712-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T04:02:34Z","timestamp":1691640154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38712-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031387111","9783031387128"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38712-8_1","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":"11 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MAPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Multi-Agent Progamming Contest","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mapc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/multiagentcontest.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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","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":"7","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":"100% - 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-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)"}}]}}