{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T19:12:30Z","timestamp":1775934750491,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T00:00:00Z","timestamp":1570924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Office of Integrative Activities","award":["1757207"],"award-info":[{"award-number":["1757207"]}]},{"DOI":"10.13039\/100000171","name":"Division of Human Resource Development","doi-asserted-by":"publisher","award":["1345232"],"award-info":[{"award-number":["1345232"]}],"id":[{"id":"10.13039\/100000171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1619273,1812628"],"award-info":[{"award-number":["1619273,1812628"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,10,13]]},"DOI":"10.1145\/3356464.3357702","type":"proceedings-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T12:20:52Z","timestamp":1572524452000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A distributed solver for multi-agent path finding problems"],"prefix":"10.1145","author":[{"given":"Poom","family":"Pianpak","sequence":"first","affiliation":[{"name":"New Mexico State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran Cao","family":"Son","sequence":"additional","affiliation":[{"name":"New Mexico State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phoebe O.","family":"Toups Dugas","sequence":"additional","affiliation":[{"name":"New Mexico State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Yeoh","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI). 740--746","author":"Boyarski Eli","year":"2015","unstructured":"Eli Boyarski, Ariel Feiner, Roni Stern, Guni Sharon, David Tolpin, Oded Betzalel, and Solomon Eyal Shimony. 2015. ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI). 740--746."},{"key":"e_1_3_2_1_2_1","volume-title":"ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI). 740--746","author":"Boyarski Eli","year":"2015","unstructured":"Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, David Tolpin, Oded Betzalel, and Solomon Eyal Shimony. 2015. ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI). 740--746."},{"key":"e_1_3_2_1_3_1","volume-title":"DMAPP: A Distributed Multi-agent Path Planning Algorithm. In Australasian Joint Conference on Artificial Intelligence (AI). 123--135","author":"Chouhan Satyendra Singh","year":"2015","unstructured":"Satyendra Singh Chouhan and Rajdeep Niyogi. 2015. DMAPP: A Distributed Multi-agent Path Planning Algorithm. In Australasian Joint Conference on Artificial Intelligence (AI). 123--135."},{"key":"e_1_3_2_1_4_1","volume-title":"Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. In International Joint Conference on Artificial Intelligence (IJCAI). 3067--3074","author":"Cohen Liron","year":"2016","unstructured":"Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, and Sven Koenig. 2016. Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. In International Joint Conference on Artificial Intelligence (IJCAI). 3067--3074."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750423.2750435"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8592"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"e_1_3_2_1_8_1","volume-title":"Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. In International Conference on Automated Planning and Scheduling (ICAPS). 155--162","author":"Gange Graeme","unstructured":"Graeme Gange, Daniel Harabor, and Peter J. Stuckey. 2019. Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. In International Conference on Automated Planning and Scheduling (ICAPS). 155--162."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"e_1_3_2_1_10_1","first-page":"3","article-title":"Experimenting with Robotic Intra-Logistics Domains","volume":"18","author":"Gebser Martin","year":"2018","unstructured":"Martin Gebser, Philipp Obermeier, Thomas Otto, Torsten Schaub, Orkunt Sabuncu, Van Nguyen, and Tran Cao Son. 2018. Experimenting with Robotic Intra-Logistics Domains. Theory and Practice of Logic Programming (TPLP) 18, 3-4 (2018), 502--519.","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Fifth International Conference and Symposium (ICLP\/SLP). 1070--1080","author":"Gelfond Michael","year":"1988","unstructured":"Michael Gelfond and Vladimir Lifschitz. 1988. The Stable Model Semantics for Logic Programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium (ICLP\/SLP). 1070--1080."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2693068.2693073"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622394.1622404"},{"key":"e_1_3_2_1_14_1","volume-title":"Conflict-Based Search with Optimal Task Assignment. In International Conference on Autonomous Agents and MultiAgent Systems (AAMAS). 757--765","author":"H\u00f6nig Wolfgang","year":"2018","unstructured":"Wolfgang H\u00f6nig, Scott Kiesel, Andrew Tinka, Joseph W. Durham, and Nora Ayanian. 2018. Conflict-Based Search with Optimal Task Assignment. In International Conference on Autonomous Agents and MultiAgent Systems (AAMAS). 757--765."},{"key":"e_1_3_2_1_15_1","volume-title":"Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. In International Conference on Automated Planning and Scheduling (ICAPS). 279--283","author":"Li Jiaoyang","year":"2019","unstructured":"Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, and Sven Koenig. 2019. Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. In International Conference on Automated Planning and Scheduling (ICAPS). 279--283."},{"key":"e_1_3_2_1_16_1","volume-title":"Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence. 6087--6095","author":"Li Jiaoyang","year":"2019","unstructured":"Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, and Sven Koenig. 2019. Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence. 6087--6095."},{"key":"e_1_3_2_1_17_1","volume-title":"Multi-Agent Path Finding for Large Agents. In AAAI Conference on Artificial Intelligence. 7627--7634","author":"Li Jiaoyang","year":"2019","unstructured":"Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, and Sven Koenig. 2019. Multi-Agent Path Finding for Large Agents. In AAAI Conference on Artificial Intelligence. 7627--7634."},{"key":"e_1_3_2_1_18_1","volume-title":"Task and Path Planning for Multi-Agent Pickup and Delivery. In International Conference on Autonomous Agents and MultiAgent Systems (AAMAS). 1152--1160","author":"Liu Minghua","year":"2019","unstructured":"Minghua Liu, Hang Ma, Jiaoyang Li, and Sven Koenig. 2019. Task and Path Planning for Multi-Agent Pickup and Delivery. In International Conference on Autonomous Agents and MultiAgent Systems (AAMAS). 1152--1160."},{"key":"e_1_3_2_1_19_1","volume-title":"Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees. In International Joint Conference on Artificial Intelligence (IJCAI). 294--300","author":"Luna Ryan","unstructured":"Ryan Luna and Kostas E. Bekris. 2011. Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees. In International Joint Conference on Artificial Intelligence (IJCAI). 294--300."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017651"},{"key":"e_1_3_2_1_21_1","volume-title":"Multi-Agent Path Finding with Deadlines. In International Joint Conference on Artificial Intelligence (IJCAI). 417--423","author":"Ma Hang","year":"2018","unstructured":"Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, and Sven Koenig. 2018. Multi-Agent Path Finding with Deadlines. In International Joint Conference on Artificial Intelligence (IJCAI). 417--423."},{"key":"e_1_3_2_1_22_1","volume-title":"Scheduling and Monitoring for Airport Surface Operations. In AAAI Workshop on Planning for Hybrid Systems.","author":"Morris Robert","year":"2016","unstructured":"Robert Morris, Corina S. Pasareanu, Kasper S\u00f8e Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, and Sven Koenig. 2016. Planning, Scheduling and Monitoring for Airport Surface Operations. In AAAI Workshop on Planning for Hybrid Systems."},{"key":"e_1_3_2_1_23_1","volume-title":"Generalized Target Assignment and Path Finding Using Answer Set Programming. In International Joint Conference on Artificial Intelligence (IJCAI). 1216--1223","author":"Nguyen Van","year":"2017","unstructured":"Van Nguyen, Philipp Obermeier, Tran Cao Son, Torsten Schaub, and William Yeoh. 2017. Generalized Target Assignment and Path Finding Using Answer Set Programming. In International Joint Conference on Artificial Intelligence (IJCAI). 1216--1223."},{"key":"e_1_3_2_1_24_1","volume-title":"ICRA Workshop on Open Source Software in Robotics.","author":"Quigley Morgan","year":"2009","unstructured":"Morgan Quigley, Brian Gerkey, Ken Conley, Josh Faust, Tully Foote, Jeremy Leibs, Eric Berger, Rob Wheeler, and Andrew Ng. 2009. ROS: an Open-source Robot Operating System. In ICRA Workshop on Open Source Software in Robotics."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"e_1_3_2_1_26_1","volume-title":"Cooperative Pathfinding. In Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE). 117--122","author":"Silver David","year":"2005","unstructured":"David Silver. 2005. Cooperative Pathfinding. In Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE). 117--122."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"e_1_3_2_1_28_1","first-page":"2","article-title":"Answer Set Planning in Single-and Multi-Agent Environments","volume":"32","author":"Son Tran Cao","year":"2018","unstructured":"Tran Cao Son and Marcello Balduccini. 2018. Answer Set Planning in Single-and Multi-Agent Environments. K\u00fcnstliche Intelligenz (KI) 32, 2-3 (2018), 133--141.","journal-title":"K\u00fcnstliche Intelligenz (KI)"},{"key":"e_1_3_2_1_29_1","volume-title":"International Symposium on Combinatorial Search (SOCS). 151--159","author":"Stern Roni","year":"2019","unstructured":"Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma andw Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Bart\u00e1k, and Eli Boyarski. 2019. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. In International Symposium on Combinatorial Search (SOCS). 151--159."},{"key":"e_1_3_2_1_30_1","volume-title":"European Conference on Artificial Intelligence (ECAI). 810--818","author":"Surynek Pavel","year":"2016","unstructured":"Pavel Surynek, Ariel Felner, Roni Stern, and Eli Boyarski. 2016. Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. In European Conference on Artificial Intelligence (ECAI). 810--818."},{"key":"e_1_3_2_1_31_1","volume-title":"CoBots: Robust Symbiotic Autonomous Mobile Service Robots. In International Joint Conference on Artificial Intelligence (IJCAI). 4423--4429","author":"Veloso Manuela M.","year":"2015","unstructured":"Manuela M. Veloso, Joydeep Biswas, Brian Coltin, and Stephanie Rosenthal. 2015. CoBots: Robust Symbiotic Autonomous Mobile Service Robots. In International Joint Conference on Artificial Intelligence (IJCAI). 4423--4429."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"e_1_3_2_1_33_1","volume-title":"Fast and Memory-Efficient Multi-Agent Pathfinding. In International Conference on Automated Planning and Scheduling (ICAPS). 380--387","author":"Cindy Wang Ko-Hsin","year":"2008","unstructured":"Ko-Hsin Cindy Wang and Adi Botea. 2008. Fast and Memory-Efficient Multi-Agent Pathfinding. In International Conference on Automated Planning and Scheduling (ICAPS). 380--387."},{"key":"e_1_3_2_1_34_1","first-page":"55","article-title":"MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees","volume":"42","author":"Cindy Wang Ko-Hsin","year":"2011","unstructured":"Ko-Hsin Cindy Wang and Adi Botea. 2011. MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. Journal of Artificial Intelligence Research (JAIR) 42 (2011), 55--90.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"e_1_3_2_1_35_1","volume-title":"Spatially Distributed Multiagent Path Planning. In International Conference on Automated Planning and Scheduling (ICAPS). 332--340","author":"Wilt Christopher Makoto","year":"2014","unstructured":"Christopher Makoto Wilt and Adi Botea. 2014. Spatially Distributed Multiagent Path Planning. In International Conference on Automated Planning and Scheduling (ICAPS). 332--340."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i4.2180"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"}],"event":{"name":"DAI '19: First International Conference on Distributed Artificial Intelligence","location":"Beijing China","acronym":"DAI '19"},"container-title":["Proceedings of the First International Conference on Distributed Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3356464.3357702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3356464.3357702","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3356464.3357702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:22:54Z","timestamp":1750202574000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3356464.3357702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,13]]},"references-count":37,"alternative-id":["10.1145\/3356464.3357702","10.1145\/3356464"],"URL":"https:\/\/doi.org\/10.1145\/3356464.3357702","relation":{},"subject":[],"published":{"date-parts":[[2019,10,13]]},"assertion":[{"value":"2019-10-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}