Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. We c...
Saved in:
| Published in | Theory and practice of logic programming Vol. 20; no. 6; pp. 974 - 989 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Cambridge, UK
Cambridge University Press
01.11.2020
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1471-0684 1475-3081 |
| DOI | 10.1017/S1471068420000320 |
Cover
| Abstract | The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. We consider a general version of MAPF, called mMAPF, that involves multi-modal transportation modes (e.g., due to velocity constraints) and consumption of different types of resources (e.g., batteries). The real-world applications of mMAPF require flexibility (e.g., solving variations of mMAPF) as well as explainability. Our earlier studies on mMAPF have focused on the former challenge of flexibility. In this study, we focus on the latter challenge of explainability, and introduce a method for generating explanations for queries regarding the feasibility and optimality of solutions, the nonexistence of solutions, and the observations about solutions. Our method is based on answer set programming. |
|---|---|
| AbstractList | The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. We consider a general version of MAPF, called mMAPF, that involves multi-modal transportation modes (e.g., due to velocity constraints) and consumption of different types of resources (e.g., batteries). The real-world applications of mMAPF require flexibility (e.g., solving variations of mMAPF) as well as explainability. Our earlier studies on mMAPF have focused on the former challenge of flexibility. In this study, we focus on the latter challenge of explainability, and introduce a method for generating explanations for queries regarding the feasibility and optimality of solutions, the nonexistence of solutions, and the observations about solutions. Our method is based on answer set programming. |
| Author | BOGATARKAN, AYSU ERDEM, ESRA |
| Author_xml | – sequence: 1 givenname: AYSU surname: BOGATARKAN fullname: BOGATARKAN, AYSU email: aysubogatarkan@sabanciuniv.edu organization: Sabanci University, Faculty of Engineering and Natural Sciences, Istanbul, Turkey (e-mail: aysubogatarkan@sabanciuniv.edu, esraerdem@sabanciuniv.edu) – sequence: 2 givenname: ESRA orcidid: 0000-0001-8384-7810 surname: ERDEM fullname: ERDEM, ESRA email: aysubogatarkan@sabanciuniv.edu organization: Sabanci University, Faculty of Engineering and Natural Sciences, Istanbul, Turkey (e-mail: aysubogatarkan@sabanciuniv.edu, esraerdem@sabanciuniv.edu) |
| BookMark | eNp9kN9LwzAQx4NMcJv-Ab4VfK7mmv58HGObwsbEueeStknNaNOaZEx98G83XQeCoveSu8v3c7l8R2ggG8kQugZ8Cxiiuw34EeAw9j1sg3j4DA1tK3AJjmFwzMHt7i_QSOsdxhASzx-iz9lbW1FJjWiks2CSqT7ljXJW-8oId9UUtDrlk5JJ4zxS8-LMhSyELJ2DsMW6NaK2qiemm73KmbM1ohIf_ai97nQTqQ9MORtmedWUita1bV-ic04rza5O5xht57Pn6b27XC8eppOlmxOIjBsFEQ0ympCEeBn1IPAzhjl4eQhAAx4kWZDzIgw5D6OkgDgreJZTVhASEm5BMkY3_dxWNa97pk26s4tK-2Tq-V3E1g6rinpVrhqtFeNpLszxE0ZRUaWA087s9JfZloQfZKusI-r9X4acGFpnShQl-17qb-oLNB2Tzw |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2025_3535097 crossref_primary_10_4204_EPTCS_416_14 crossref_primary_10_4204_EPTCS_385_52 crossref_primary_10_1016_j_artint_2024_104087 crossref_primary_10_1016_j_simpat_2023_102752 crossref_primary_10_4204_EPTCS_345_40 |
| Cites_doi | 10.1016/j.artint.2014.11.006 10.1007/BF01386390 10.1017/S1471068414000702 10.1007/BF03037169 10.1007/978-3-642-40564-8_53 10.1017/S1471068419000450 10.1109/ICRA.2013.6631084 10.1017/S1471068418000492 10.1609/aaai.v34i06.6534 10.1017/S1471068410000256 10.1613/jair.2502 10.1016/S0004-3702(02)00186-8 10.1007/978-3-030-46212-3_24 10.1109/IROS.2011.6095085 10.1017/S1471068418000534 10.1609/aiide.v1i1.18726 10.1017/S1471068414000234 10.1609/aaai.v27i1.8592 10.1109/ICTAI.2012.77 10.1017/S1471068413000598 10.1017/S1471068416000454 10.1023/A:1018930122475 10.1007/978-3-319-26350-2_11 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2020. Published by Cambridge University Press |
| Copyright_xml | – notice: The Author(s), 2020. Published by Cambridge University Press |
| DBID | AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U |
| DOI | 10.1017/S1471068420000320 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database CrossRef |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1475-3081 |
| EndPage | 989 |
| ExternalDocumentID | 10_1017_S1471068420000320 |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 3V. 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAEED AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABZCX ACBMC ACCHT ACGFS ACIMK ACNCT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGOOT AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ATUCA AUXHV AZQEC BBLKV BENPR BGHMG BGLVJ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCTKK CFAFE CHEAL CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EJD GNUQQ HCIFZ HG- HST HZ~ I.6 IH6 IOEEP IPYYG IS6 I~P J36 J38 J3A J9A JHPGK JQKCU K6V K7- KCGVB KFECR L98 LW7 M-V M0N NIKVX O9- OK1 OYBOY P2P P62 PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WXY WYP ZYDXJ AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN AFZFC AKMAY CITATION PHGZM PHGZT PQGLB PUEGO 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c317t-757a5ba93932ba2154be0f12c611a5f59b5cfd66ff679d18bdfbcaed3363f5ba3 |
| IEDL.DBID | BENPR |
| ISSN | 1471-0684 |
| IngestDate | Sun Sep 14 08:48:55 EDT 2025 Wed Oct 01 03:49:32 EDT 2025 Thu Apr 24 22:56:22 EDT 2025 Wed Mar 13 05:46:36 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c317t-757a5ba93932ba2154be0f12c611a5f59b5cfd66ff679d18bdfbcaed3363f5ba3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-8384-7810 |
| PQID | 2444448632 |
| PQPubID | 43613 |
| PageCount | 16 |
| ParticipantIDs | proquest_journals_2444448632 crossref_citationtrail_10_1017_S1471068420000320 crossref_primary_10_1017_S1471068420000320 cambridge_journals_10_1017_S1471068420000320 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20201100 2020-11-00 20201101 |
| PublicationDateYYYYMMDD | 2020-11-01 |
| PublicationDate_xml | – month: 11 year: 2020 text: 20201100 |
| PublicationDecade | 2020 |
| PublicationPlace | Cambridge, UK |
| PublicationPlace_xml | – name: Cambridge, UK – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationTitleAlternate | Theory and Practice of Logic Programming |
| PublicationYear | 2020 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | Erdem (S1471068420000320_ref15) 2015; 1 Cabalar (S1471068420000320_ref6) 2014; 4 S1471068420000320_ref25 S1471068420000320_ref27 S1471068420000320_ref28 S1471068420000320_ref21 S1471068420000320_ref22 Schulz (S1471068420000320_ref29) 2016; 1 S1471068420000320_ref20 S1471068420000320_ref2 S1471068420000320_ref1 S1471068420000320_ref4 S1471068420000320_ref3 Marek (S1471068420000320_ref23) 1999 S1471068420000320_ref18 Fandinno (S1471068420000320_ref16) 2019; 2 Dresner (S1471068420000320_ref12) 2008 S1471068420000320_ref19 Pontelli (S1471068420000320_ref26) 2009; 1 S1471068420000320_ref8 S1471068420000320_ref36 S1471068420000320_ref14 S1471068420000320_ref9 S1471068420000320_ref17 S1471068420000320_ref32 S1471068420000320_ref10 S1471068420000320_ref33 Cabalar (S1471068420000320_ref5) 2016; 5 S1471068420000320_ref11 S1471068420000320_ref34 Niemelä (S1471068420000320_ref24) 1999 S1471068420000320_ref35 S1471068420000320_ref13 Calimeri (S1471068420000320_ref7) 2020; 2 S1471068420000320_ref30 S1471068420000320_ref31 |
| References_xml | – ident: S1471068420000320_ref30 doi: 10.1016/j.artint.2014.11.006 – ident: S1471068420000320_ref10 doi: 10.1007/BF01386390 – volume: 1 start-page: 59 year: 2016 ident: S1471068420000320_ref29 article-title: Justifying answer sets using argumentation publication-title: Theory Pract. Log. Program. 16, doi: 10.1017/S1471068414000702 – ident: S1471068420000320_ref19 doi: 10.1007/BF03037169 – ident: S1471068420000320_ref9 doi: 10.1007/978-3-642-40564-8_53 – volume: 2 start-page: 294 year: 2020 ident: S1471068420000320_ref7 article-title: ASP-Core-2 Input Language Format publication-title: Theory Pract. Log. Program. 20, doi: 10.1017/S1471068419000450 – ident: S1471068420000320_ref36 doi: 10.1109/ICRA.2013.6631084 – ident: S1471068420000320_ref3 – ident: S1471068420000320_ref27 – ident: S1471068420000320_ref11 doi: 10.1017/S1471068418000492 – ident: S1471068420000320_ref17 – ident: S1471068420000320_ref32 – ident: S1471068420000320_ref13 doi: 10.1609/aaai.v34i06.6534 – ident: S1471068420000320_ref25 doi: 10.1017/S1471068410000256 – ident: S1471068420000320_ref35 – start-page: 591 year: 2008 ident: S1471068420000320_ref12 article-title: A multiagent approach to autonomous intersection management publication-title: J. Artif. Intell. Res. (JAIR) 31 doi: 10.1613/jair.2502 – volume-title: The Logic Programming Paradigm: a 25-Year Perspective year: 1999 ident: S1471068420000320_ref23 – ident: S1471068420000320_ref21 doi: 10.1016/S0004-3702(02)00186-8 – ident: S1471068420000320_ref2 doi: 10.1007/978-3-030-46212-3_24 – ident: S1471068420000320_ref20 – ident: S1471068420000320_ref22 doi: 10.1109/IROS.2011.6095085 – ident: S1471068420000320_ref1 – volume: 2 start-page: 114 year: 2019 ident: S1471068420000320_ref16 article-title: Answering the “why” in answer set programming - A survey of explanation approaches publication-title: Theory Pract. Log. Program. 19, doi: 10.1017/S1471068418000534 – ident: S1471068420000320_ref31 doi: 10.1609/aiide.v1i1.18726 – volume: 4 start-page: 603 year: 2014 ident: S1471068420000320_ref6 article-title: Causal graph justifications of logic programs publication-title: Theory Pract. Log. Program. 14, doi: 10.1017/S1471068414000234 – volume: 1 start-page: 1 year: 2009 ident: S1471068420000320_ref26 article-title: Justifications for logic programs under answer set semantics publication-title: Theory Pract. Log. Program. 9, – ident: S1471068420000320_ref4 – ident: S1471068420000320_ref14 doi: 10.1609/aaai.v27i1.8592 – ident: S1471068420000320_ref34 doi: 10.1109/ICTAI.2012.77 – ident: S1471068420000320_ref28 – volume: 1 start-page: 35 year: 2015 ident: S1471068420000320_ref15 article-title: Generating explanations for biomedical queries publication-title: Theory Pract. Log. Program. 15, doi: 10.1017/S1471068413000598 – volume: 5 start-page: 587 year: 2016 ident: S1471068420000320_ref5 article-title: Justifications for programs with disjunctive and causal-choice rules publication-title: Theory Pract. Log. Program. 16, doi: 10.1017/S1471068416000454 – ident: S1471068420000320_ref18 – ident: S1471068420000320_ref33 – start-page: 241 year: 1999 ident: S1471068420000320_ref24 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Annals of Mathematics and Artificial Intelligence 25 doi: 10.1023/A:1018930122475 – ident: S1471068420000320_ref8 doi: 10.1007/978-3-319-26350-2_11 |
| SSID | ssj0016324 |
| Score | 2.2776635 |
| Snippet | The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 974 |
| SubjectTerms | Combinatorial analysis Declarative programming Flexibility Mathematical programming Multiagent systems Optimization Original Article Resource utilization Warehouses |
| Title | Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming |
| URI | https://www.cambridge.org/core/product/identifier/S1471068420000320/type/journal_article https://www.proquest.com/docview/2444448632 |
| Volume | 20 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1475-3081 dateEnd: 20241103 omitProxy: true ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1475-3081 dateEnd: 20241103 omitProxy: true ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: 8FG dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8QwEB50vXjxLb7JwZNYbDdNmz2IrOIqwq4iLnhb8pSFffhY8eZvdyZtdxVhewpppi1JmsxM5vsG4BgnbsylQkvVOh6lUutIucxHSsUyl94JH4Ix253stpvePYvnBehUWBgKq6zWxLBQ27EhH_kZbkN4yYzXL17fIsoaRaerVQoNVaZWsOeBYmwRlurEjFWDpcvrzsPj9FyByMkD3iineB-ZVuecRCJNlVRH4BVKK_6bbeHvrvV30Q47UWsNVkoVkjWLMV-HBTfagNUqPQMr_9ZN-Kb4OlV4-1hBLx2KqKaygLuN2mOLDyrKTcJYsQdUCFmrH6AujHy07B7XlCG2qvz8rDvpD0rwJqOo-RfWHH180YsdyhfhXkOs3oJu6_rp6jYq0y1EBpWISZSLXAmtGhxVOq1QFUi1i31SN1mSKOFFQwvjbZZ5n-UNm0htvTbKWc4z7lGQb0NtNB65HWA8RRvdJUI5qVNprdSxkNag5WukENzswum0a3vlT_PRKwLO8t6_kdiFuOr9nimpyymDxmCeyMlU5LXg7ZjX-KAa0tnXzCbc3vzb-7BcJyM8ABQPoDZ5_3SHqKlM9BEsytbNUTkJfwBy_uU7 |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwEB5ROLSXFvpQaaH40F6qRk3iOPEeULVtWS2F3aKKlbilflZIsAvsVqgXfhq_rTOOs4CQ9kZOluNJInsyD3u-GYD3yLgplwo9Vet4UkitE-VKnyiVykp6J3wIxhwMy_6o-HEkjpbgusXCUFhlKxODoLYTQ3vkn1EN4SVLnn85O0-oahSdrrYlNFQsrWC3Q4qxCOzYc_8u0YWbbu9-x_X-kOe9ncNv_SRWGUgM6s5ZUolKCa06HC0ZrVADFtqlPstNmWVKeNHRwnhblt6XVcdmUluvjXKW85J7JOT43EewUvCig87fyted4cGv-TkGJUMP-KaK4otk0Z6rUtJq6qQ-AstQGfPb2R3uasm7SiJovt4qPI0mK-s2PLYGS278HJ615SBYlA4v4Iri-VSzu8iadNahiWYxCzjfZDCx-KCm3SVMFztAA5T1jgO0htGeMPuJMuwUR7XnCmw0Oz6JYFFGUfp_WHc8vaQXO6RvwstOsfsljB5k4l_B8ngydq-B8cJp7jKhnNSFtFbqVEhr0NM2Ughu1uHTfGrr-JNO6ybArarvrcQ6pO3s1yamSqeKHSeLSD7OSc6aPCGLBm-0S3rzNTcM_mbx7S143D8c7Nf7u8O9t_Akpw2AAI7cgOXZxV-3iVbSTL-LrMjg90Nz_388liL4 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Explanation+Generation+for+Multi-Modal+Multi-Agent+Path+Finding+with+Optimal+Resource+Utilization+using+Answer+Set+Programming&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=BOGATARKAN%2C+AYSU&rft.au=Erdem%2C+Esra&rft.date=2020-11-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=20&rft.issue=6&rft.spage=974&rft.epage=989&rft_id=info:doi/10.1017%2FS1471068420000320 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon |