1. D. Atzmon, A. Felner, R. Stern, G. Wagner, R. Barták and N. Zhou, k-robust multi-agent path finding, in: Proceedings of the Tenth International Symposium on Combinatorial Search, Edited by Alex Fukunaga and Akihiro Kishimoto, Pittsburgh, Pennsylvania, USA, 16–17 June 2017, A. Fukunaga and A. Kishimoto, eds, AAAI Press, 2017, pp. 157–158, https://aaai.org/ocs/index.php/SOCS/SOCS17/paper/view/15797.
2. Multi-agent Path Finding on Real Robots: First Experience with Ozobots
3. R. Barták, J. S˘vancara and M. Vlk, A scheduling-based approach to multi-agent path finding with weighted and capacitated arcs, in: Proceedings of AAMAS 2018, Stockholm, Sweden, July 11–13, 2018, 2018.
4. Modeling and Solving the Multi-agent Pathfinding Problem in Picat
5. E. Boyarski, A. Felner, R. Stern, G. Sharon, O. Betzalel, D. Tolpin and S.E. Shimony, ICBS: the improved conflict-based search algorithm for multi-agent pathfinding, in: Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, Ein Gedi, the Dead Sea, Israel, 11–13 June 2015, L. Lelis and R. Stern, eds, AAAI Press, 2015, pp. 223–225, http://www.aaai.org/ocs/index.php/SOCS/SOCS15/paper/view/10974. ISBN 978-1-57735-732-2.