{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:24:41Z","timestamp":1742988281785,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030944780"},{"type":"electronic","value":"9783030944797"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94479-7_3","type":"book-chapter","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T09:02:57Z","timestamp":1641546177000},"page":"24-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-agent Pick and\u00a0Delivery with\u00a0Capacities: Action Planning Vs Path Finding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6695-7492","authenticated-orcid":false,"given":"Nima","family":"Tajelipirbazari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1607-8753","authenticated-orcid":false,"given":"Cagri Uluc","family":"Yildirimoglu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1432-042X","authenticated-orcid":false,"given":"Orkunt","family":"Sabuncu","sequence":"additional","affiliation":[]},{"given":"Ali Can","family":"Arici","sequence":"additional","affiliation":[]},{"given":"Idil Helin","family":"Ozen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6644-3937","authenticated-orcid":false,"given":"Volkan","family":"Patoglu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8384-7810","authenticated-orcid":false,"given":"Esra","family":"Erdem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,7]]},"reference":[{"key":"3_CR1","unstructured":"Bartholdi, J.J., III., Hackman, S.T.: Warehouse and distribution science. Supply Chain and Logistics Institute, Georgia Institute of Technology (2019)"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1609\/aimag.v37i3.2669","volume":"37","author":"G Brewka","year":"2016","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming: an introduction to the special issue. AI Mag. 37(3), 5\u20136 (2016). https:\/\/doi.org\/10.1609\/aimag.v37i3.2669","journal-title":"AI Mag."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"5816","DOI":"10.1109\/LRA.2021.3074883","volume":"6","author":"Z Chen","year":"2021","unstructured":"Chen, Z., Alonso-Mora, J., Bai, X., Harabor, D.D., Stuckey, P.J.: Integrated task assignment and path planning for capacitated multi-agent pickup and delivery. IEEE RAL 6(3), 5816\u20135823 (2021). https:\/\/doi.org\/10.1109\/LRA.2021.3074883","journal-title":"IEEE RAL"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Erdem, E., Kisa, D., Oztok, U., Sch\u00fcller, P.: A general formal framework for pathfinding problems with multiple agents. In: Proceedings of AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8592"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. TPLP 19(1), 27\u201382 (2019). https:\/\/doi.org\/10.1017\/S1471068418000054","journal-title":"TPLP"},{"issue":"3\u20134","key":"3_CR6","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1017\/S1471068418000200","volume":"18","author":"M Gebser","year":"2018","unstructured":"Gebser, M., et al.: Experimenting with robotic intra-logistics domains. TPLP 18(3\u20134), 502\u2013519 (2018). https:\/\/doi.org\/10.1017\/S1471068418000200","journal-title":"TPLP"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Grenouilleau, F., van Hoeve, W.J., Hooker, J.N.: A multi-label A* algorithm for multi-agent pathfinding. In: Proceedings of ICAPS, pp. 181\u2013185 (2019)","DOI":"10.1609\/icaps.v29i1.3474"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"102570","DOI":"10.1016\/j.jretconser.2021.102570","volume":"61","author":"C Guthrie","year":"2021","unstructured":"Guthrie, C., Fosso-Wamba, S., Arnaud, J.B.: Online consumer resilience during a pandemic: an exploratory study of e-commerce behavior before, during and after a COVID-19 lockdown. JRCS 61, 102570 (2021). https:\/\/doi.org\/10.1016\/j.jretconser.2021.102570","journal-title":"JRCS"},{"key":"3_CR10","unstructured":"H\u00f6nig, W., Kiesel, S., Tinka, A., Durham, J., Ayanian, N.: Conflict-based search with optimal task assignment. In: Proceedings of AAMAS (2018)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. AIJ 138, 39\u201354 (2002). https:\/\/doi.org\/10.1016\/S0004-3702(02)00186-8","journal-title":"AIJ"},{"key":"3_CR12","unstructured":"Liu, M., Ma, H., Li, J., Koenig, S.: Task and path planning for multi-agent pickup and delivery. In: Proceedings of AAMAS, pp. 1152\u20131160 (2019)"},{"key":"3_CR13","unstructured":"Ma, H., Koenig, S.: Optimal target assignment and path finding for teams of agents. In: Proceedings of AAMAS, pp. 1144\u20131152 (2016)"},{"key":"3_CR14","unstructured":"Ma, H., Li, J., Kumar, T.K.S., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of AAMAS, pp. 837\u2013845 (2017)"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm. Artificial Intelligence. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60085-2_17","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Nguyen, V., Obermeier, P., Son, T.C., Schaub, T., Yeoh, W.: Generalized target assignment and path finding using answer set programming. In: Proceedings of IJCAI, pp. 1216\u20131223 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/169","DOI":"10.24963\/ijcai.2017\/169"},{"key":"3_CR17","first-page":"241","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. AMAI 25, 241\u2013273 (1999)","journal-title":"AMAI"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. AIJ 219, 40\u201366 (2015). https:\/\/doi.org\/10.1016\/j.artint.2014.11.006","journal-title":"AIJ"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Surynek, P.: On propositional encodings of cooperative path-finding. In: Proceedings of ICTAI, pp. 524\u2013531 (2012). https:\/\/doi.org\/10.1109\/ICTAI.2012.77","DOI":"10.1109\/ICTAI.2012.77"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Vodr\u00e1zka, J., Bart\u00e1k, R., Svancara, J.: On modelling multi-agent path finding as a classical planning problem. In: Proceedings of ICTAI, pp. 23\u201328 (2020). https:\/\/doi.org\/10.1109\/ICTAI50040.2020.00014","DOI":"10.1109\/ICTAI50040.2020.00014"},{"issue":"5","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu, J., LaValle, S.M.: Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE TRO 32(5), 1163\u20131177 (2016). https:\/\/doi.org\/10.1109\/TRO.2016.2593448","journal-title":"IEEE TRO"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94479-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T06:41:41Z","timestamp":1674369701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94479-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030944780","9783030944797"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94479-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/PADL-2022","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":"22","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":"9","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":"4","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":"41% - 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)"}}]}}