## 4 Solving the Warehouse Delivery Problem
### Task Assignment and Sequencing
#### 4.3.2 Conflict Detection and Resolution
* Gelfond and Lifschitz (1990) Gelfond, M.; Lifschitz, V. Logic Programs with Classical Negation. In Proceedings of the Seventh International Conference on Logic Programming (ICLP'90), Jerusalem, Israel, 18-20 June 1990; Warren, D., Szeredi, P., Eds. ; MIT Press: Cambridge, MA, USA, 1990; pp. 579-597. * Simons et al. (2002) Simons, P.; Niemela, I.; Soininen, T. Extending and implementing the stable model semantics. _Artif. Intell._**2002**, _138_, 181-234. [CrossRef]
* Gebser et al. (2023) Gebser, M.; Kaminski, R.; Kaufmann, B.; Lindauer, M.; Ostrowski, M.; Romero, J.; Schaub, T.; Thiele, S. _Potassco User Guide_, 2 nd ed. ; University of Potsdam: Potsdam, Germany, 2015. Available online: [[https://potassco.sourceforge.net/](https://potassco.sourceforge.net/)]([https://potassco.sourceforge.net/](https://potassco.sourceforge.net/)) (accessed on 1 February 2023). * Gebser et al. (2013) Gebser, M.; Kaufmann, B.; Otero, R.; Romero, J.; Schaub, T.; Wanko, P. Domain-specific Heuristics in Answer Set Programming. In Proceedings of the Twenty-Seventh Conference on Artificial Intelligence, Bellevue, WA, USA, 14-18 July 2013; AAAI Press: Cambridge, MA, USA, 2013; pp. 350-356. * Bomanson et al. (2016) Bomanson, J.; Gebser, M.; Janhunen, T.; Kaufmann, B.; Schaub, T. Answer Set Programming Modulo Acyclicity. _Fundam. Informatic_**2016**, _147_, 63-91. [CrossRef]
* Gebser et al. (2016) Gebser, M.; Kaminski, R.; Kaufmann, B.; Ostrowski, M.; Schaub, T.; Wanko, P. Theory Solving Made Easy with Clingo 5. In _Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP'16)_; OpenAccess Series in Informatics (OASICs); Carro, M., King, A., Eds. ; Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik: Wadern, Germany, 2016; Volume 52, pp. 2:1-2:15. * Janhunen et al. (2017) Janhunen, T.; Kaminski, R.; Ostrowski, M.; Schaub, T.; Schellhorn, S.; Wanko, P. Clingo goes Linear Constraints over Reals and Integers. _Theory Pract. Log. Program._**2017**, _17_, 872-888. [CrossRef]
* Stern et al. (2019) Stern, R.; Sturtevant, N.; Felner, A.; Koenig, S.; Ma, H.; Walker, T.; Li, J.; Atzmon, D.; Cohen, L.; Kumar, T.; et al. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. 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. 151-159. * Lifschitz (2002) Lifschitz, V. Answer set programming and plan generation. _Artif. Intell._**2002**, _138_, 39-54. [CrossRef]
* Hahn et al. (2022) Hahn, S.; Sabuncu, O.; Schaub, T.; Stolzmann, T. clingraph: ASP-based Visualization. In _Logic Programming and Nonmonotonic Reasoning (LPNMR'22)_; Lecture Notes in Artificial Intelligence; Gottlob, G., Inclezan, D., Maratea, M., Eds. ; Springer: Berlin/Heidelberg, Germany, 2022; Volume 13416, pp. 401-414. * Floyd (1962) Floyd, R.W. Algorithm 97: Shortest Path. _Commun. ACM_**1962**, \(5\), 345. [CrossRef]
* Bartak et al. (2019) Bartak, R.; Svancara, J.; Skopkova, V.; Nohejl, D.; Krasicenko, I. Multi-agent path finding on real robots. _AI Mag._**2019**, _32_, 175-189. [CrossRef]
* Salzman and Stern (2020) Salzman, O.; Stern, R. Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems. In Proceedings of the Nineteenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS'20), Auckland, New Zealand, 9-13 May 2020; El Fallah Seghrouchni, A., Sukthankar, G., An, B., Yorke-Smith, N., Eds. ; IFAAMAS: Richland, SC, USA, 2020; pp. 1711-1715. * Goldenberg et al. (2014) Goldenberg, M.; Felner, A.; Stern, R.; Sharon, G.; Sturtevant, N.; Holte, R.; Schaeffer, J. Enhanced Partial Expansion A*. _J. Artif. Intell. Res._**2014**, _50_, 141-187. [CrossRef]
* Li et al. (2021) Li, J.; Harabor, D.; Stuckey, P.J. ; Ma, H.; Gange, G.; Koenig, S. Pairwise symmetry reasoning for multi-agent path finding search. _Artif. Intell._**2021**, _301_, 103574.