1. Achá, R.A., López, R., Hagedorn, S., Baier, J.A.: A new boolean encoding for mapf and its performance with asp and maxsat solvers. In: Proceedings of the International Symposium on Combinatorial Search, vol. 12, pp. 11–19 (2021).https://ojs.aaai.org/index.php/SOCS/article/view/18546

2. Barer, M., Sharon, G., Stern, R., Felner, A.: Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Seventh Annual Symposium on Combinatorial Search (2014).https://doi.org/10.3233/978-1-61499-419-0-961

3. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. In: Technical Communications of the 13th International Conference on Logic Programming, vol. 14(4–5) (2014).https://arxiv.org/abs/1405.3694

4. Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Logic Programming, Proceedings of the Seventh International Conference, pp. 579–597. MIT Press, Jerusalem, Israel (June 1990).https://dl.acm.org/doi/10.5555/87961.88030

5. Gómez, R.N., Hernández, C., Baier, J.A.: A compact answer set programming encoding of multi-agent pathfinding. IEEE Access9, 26886–26901 (2021).https://doi.org/10.1109/ACCESS.2021.3053547

   Article  Google Scholar 

6. Kuhn, H.W.: The hungarian method for the assignment problem. Naval Res. Logist. Quart.2(1–2), 83–97 (1955).https://doi.org/10.1002/nav.3800020109

   Article MathSciNet MATH  Google Scholar 

7. MacQueen, J.: Classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Oakland, CA, USA, pp. 281–297 (1967)

   Google Scholar 

8. Malinen, M.I., Fränti, P.: BalancedK-means for clustering. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 32–41. Springer, Heidelberg (2014).https://doi.org/10.1007/978-3-662-44415-3_4

   Chapter  Google Scholar 

9. Pianpak, P., Son, T.C.: DMAPF: A decentralized and distributed solver for multi-agent path finding problem with obstacles. Electron. Proc. Theor. Comput. Sci. (EPTCS)345, 99–112 (2021).https://doi.org/10.4204/eptcs.345.24. Sep

   Article  Google Scholar 

10. Pianpak, P., Son, T.C., Toups, Z.O., Yeoh, W.: A distributed solver for multi-agent path finding problems. In: Proceedings of the First International Conference on Distributed Artificial Intelligence (DAI), pp. 1–7 (2019).https://doi.org/10.1145/3356464.3357702

11. Salzman, O., Stern, R.Z.: Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems blue sky ideas track. In: 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020, pp. 1711–1715. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) (2020).http://www.orensalzman.com/docs/AAMAS20.pdf

12. Silver, D.: Cooperative pathfinding. In: Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, pp. 117–122 (2005).https://ojs.aaai.org/index.php/AIIDE/article/view/18726

13. Stern, R.: Multi-agent path finding - an overview. In: Osipov, G.S., Panov, A.I., Yakovlev, K.S. (eds.) Artificial Intelligence. LNCS (LNAI), vol. 11866, pp. 96–115. Springer, Cham (2019).https://doi.org/10.1007/978-3-030-33274-7_6

    Chapter  Google Scholar 

14. Stern, R., et al.: Multi-agent pathfinding: Definitions, variants, and benchmarks. Symposium on Combinatorial Search (SoCS), pp. 151–158 (2019).https://www.aaai.org/ocs/index.php/SOCS/SOCS19/paper/view/18341

15. Wilt, C.M., Botea, A.: Spatially distributed multiagent path planning. In: Twenty-Fourth International Conference on Automated Planning and Scheduling, pp. 332–340 (2014).https://www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7858/8043

Download references