## 4 Solving the Warehouse Delivery Problem
### Task Assignment and Sequencing
#### 4.3.2 Conflict Detection and Resolution
(2017) Ma, H.; Kumar, T.; Koenig, S. Multi-Agent Path Finding with Delay Probabilities. In Proceedings of the Thirty-First National Conference on Artificial Intelligence (AAAI'17), San Francisco, CA, USA, 4-9 February 2017; Satinder, P., Markovitch, S., Eds. ; AAAI Press: Washington, DC, USA, 2017; pp. 3605-3612. * Li et al. (2021) Li, J.; Tinka, A.; Kiesel, S.; Durham, J.W. ; Kumar, T.S. ; Koenig, S. Lifelong multi-agent path finding in large-scale warehouses. In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, Virtual Event, 2-9 February 2021; AAAI Press: Washington, DC, USA, 2021; pp. 11272-11281. * Andreychuk et al. (2019) Andreychuk, A.; Yakovlev, K.; Atzmon, D.; Stern, R. Multi-Agent Pathfinding with Continuous Time. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI'19), Macao, China, 10-16 August 2019; Kraus, S., Ed. ; IJCAI: CA, USA, 2019; pp. 39-45. * Bartak and Svancara (2019) Bartak, R.; Svancara, J. On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. In Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS'19), Napa, CA, USA, 16-17 July 2019; Surynek, P., Yeoh, W., Eds. ; AAAI Press: Cambridge, MA, USA, 2019; pp. 10-17. * Surynek (2019) Surynek, P. Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). In Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS'19), Napa, CA, USA, 16-17 July 2019; Surynek, P., Yeoh, W., Eds. ; AAAI Press: Cambridge, MA, USA, 2019; pp. 200-201. * Atzmon et al. (2020) Atzmon, D.; Stern, R.; Felner, A.; Wagner, G.; Bartak, R.; Zhou, N. Robust Multi-Agent Path Finding and Executing. _J. Artif. Intell. Res._**2020**, 67, 549-579. [CrossRef]
* Ma et al. (2016) Ma, H.; Tovey, C.; Sharon, G.; Kumar, T.; Koenig, S. Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. In Proceedings of the Thirtieth National Conference on Artificial Intelligence (AAAI'16), Phoenix, AZ, USA, 12-17 February 2016; Schuurmans, D., Wellman, M., Eds. ; AAAI Press: Washington, DC, USA, 2016; pp. 3166-3173. * Honig et al. (2016) Honig, W.; Kumar, T.; Cohen, L.; Ma, H.; Xu, H.; Ayanian, N.; Koenig, S. Multi-Agent Path Finding with Kinematic Constraints. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS'16), London, UK, 12-17 June 2016; Coles, A., Coles, A., Edelkamp, S., Magazzeni, D., Sanner, S., Eds. ; AAAI Press: Washington, DC, USA, 2016, pp. 477-485. * Erdem et al. (2013) Erdem, E.; Kisa, D.; Oztok, U.; Schuller, P. A General Formal Framework for Pathfinding Problems with Multiple Agents. In Proceedings of the Twenty-Seventh Conference on Artificial Intelligence, Bellevue, WA, USA, 14-18 July 2013; AAAI Press: Cambridge, MA, USA, 2013; pp. 290-296. * Gebser et al. (2018) Gebser, M.; Obermeier, P.; Otto, T.; Schaub, T.; Sabuncu, O.; Nguyen, V.; Son, T. Experimenting with robotic intra-logistics domains. _Theory Pract. Log. Program._**2018**, _18_, 502-519. [CrossRef]
* Nguyen et al. (2017) Nguyen, V.; Obermeier, P.; Son, T.; Schaub, T.; Yeoh, W. Generalized Target Assignment and Path Finding Using Answer Set Programming. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 19-25 August 2017; Sierra, C., Ed. ; IJCAI: CA, USA, 2017; pp. 1216-1223. * Gomez et al. (2021) Gomez, R.; Hernandez, C.; Baier, J. A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding. _IEEE Access_**2021**, \(9\), 26886-26901. [CrossRef]
* Pianpak et al. (2019) Pianpak, P.; Son, T.; Toups, Z.; Yeoh, W. A distributed solver for multi-agent path finding problems. In Proceedings of the First International Conference on Distributed Artificial Intelligence (DAT'19), Beijing, China, 13-15 October 2019; ACM Press: New York, NY, USA, 2019; pp. 2:1-2:7. * _Leet et al.