## 4 Solving the Warehouse Delivery Problem
### Task Assignment and Sequencing
#### 4.3.2 Conflict Detection and Resolution
[CrossRef]
* Wagner and Choset (2015) Wagner, G.; Choset, H. Subdimensional expansion for multirobot path planning. _Artif. Intell._**2015**, _219_, 1-24. [CrossRef]
* Sharon et al. (2015) Sharon, G.; Stern, R.; Felner, A.; Sturtevant, N.R. Conflict-based search for optimal multi-agent pathfinding. _Artif. Intell._**2015**, _219_, 40-66. [CrossRef]
* Boyarski et al. (2015) Boyarski, E.; Felner, A.; Stern, R.; Sharon, G.; Tolpin, D.; Betzalel, O.; Shimony, S. ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI'15), Buenos Aires, Argentina, 25-31 July 2015; Yang, Q., Wooldridge, M., Eds. ; AAAI Press: Washington, DC, USA, 2015; pp. 740-746. * Cohen et al. (2016) Cohen, L.; Uras, T.; Kumar, T.; Xu, H.; Ayanian, N.; Koenig, S. Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI'16), New York, NY, USA, 9-15 July 2016; Kambhampati, R., Ed. ; IJCAI/AAAI Press: Washington, DC, USA, 2016; pp. 3067-3074. * Wang et al. (2011) Wang, K.; Botea, A. MAPP a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. _J. Artif. Intell. Res._**2011**, _42_, 55-90. * Luna and Bekris (2011) Luna, R.; Bekris, K. Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI'11), Barcelona, Spain, 16-22 July 2011; Walsh, T., Ed. ; IJCAI/AAAI Press: Washington, DC, USA, 2011; pp. 294-300. * de Wilde et al. (2014) de Wilde, B.; ter Mors, A.; Witteveen, C. Push and Rotate: A Complete Multi-agent Pathfinding Algorithm. _J. Artif. Intell. Res._**2014**, _51_, 443-492. [CrossRef]* Li et al. (2021) Li, J.; Ruml, W.; Koenig, S. EECBS: A bounded-suboptimal search for multi-agent path finding. In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, Virtual Event, 2-9 February 2021; AAAI Press: Washington, DC, USA, 2021; pp. 12353-12362. [CrossRef]
* Barer et al. (2014) Barer, M.; Sharon, G.; Stern, R.; Felner, A. Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In Proceedings of the Seventh Annual Symposium on Combinatorial Search, Prague, Czech Republic, 15-17 August 2014; AAAI Press: Washington, DC, USA, 2021. * Thayer and Ruml (2011) Thayer, J.T. ; Ruml, W. Bounded suboptimal search: A direct approach using inadmissible estimates. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, Barcelona, Spain, 16-22 July; Walsh, T., Ed. ; IJCAI/AAAI Press: Washington, DC, USA, 2011; pp. 674-679. * Ma et al. (2019) Ma, H.; Harabor, D.; Stuckey, P.J. ; Li, J.; Koenig, S. Searching with consistent prioritization for multi-agent path finding. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, Honolulu, HI, USA, 27 January-1 February 2019; AAAI Press: Washington, DC, USA, 2019; pp. 7643-7650. [CrossRef]
* Silver (2005) Silver, D. Cooperative pathfinding. In Proceedings of the First Artificial Intelligence and Interactive Digital Entertainment Conference, Marina Del Rey, CA, USA, 1-5 June 2005; AAAI Press: Washington, DC, USA, 2005; pp. 117-122. * Ma and Koenig (2016) Ma, H.; Koenig, S. Optimal Target Assignment and Path Finding for Teams of Agents. In Proceedings of the Fifteenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS'16), Singapore, 9-13 May 2016; Jonker, C., Marsella, S., Thangarajah, J., Tuyls, K., Eds. ; ACM Press: New York, NY, USA, 2016; pp. 1144-1152. * Ma et al. (2018) Ma, H.; Wagner, G.; Felner, A.; Li, J.; Kumar, T.; Koenig, S. Multi-Agent Path Finding with Deadlines. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI'18), Stockholm, Sweden, 13-19 July 2018; Lang, J., Ed. ; IJCAI: CA, USA, 2018; pp. 417-423. * Ma et al.