Click here for Nathan's personal webpage.
- T. Walker, N. Sturtevant, A. Felner, H. Zhang, J. Li and S. Kumar. Conflict-Based Increasing Cost Search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 385-395, 2021.
- D. Atzmon, R. Stern, A. Felner, N. Sturtevant and S. Koenig. Probabilistic Robust Multi-Agent Path Finding. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2020.
- T. Walker, N. Sturtevant and A. Felner. Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 7277-7284, 2020.
- R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, S. Kumar, E. Boyarski and R. Bartak. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks [Position Paper]. In Proceedings of the Symposium on Combinatorial Search (SoCS), (in print), 2019.
- T. Walker and N. Sturtevant. Collision Detection for Agents in Multi-Agent Pathfinding. arXiv preprint arXiv:1908.09707, 2019.
- T. Walker, N. Sturtevant and A. Felner. Extended Increasing Cost Tree Search for Non-Unit Cost Domains. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 534-540, 2018.
- A. Felner, R. Stern, E. Shimony, M. Goldenberg, G. Sharon, N. Sturtevant, G. Wagner and P. Surynek. Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. In Proceedings of the Symposium on Combinatorial Search (SoCS), 28-37, 2017.
- T. Walker, D. Chan and N. Sturtevant. Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 316-324, 2017.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. Conflict-Based Search for Optimal Multi-Agent Pathfinding. Artificial Intelligence, 219, 40-66, 2015.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. In Proceedings of the Symposium on Combinatorial Search (SoCS), 2012.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. Conflict-Based Search for Optimal Multi-Agent Path Finding. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2012.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 662-667, 2011.
- M. Khorshid, R. Holte and N. Sturtevant. A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. In Proceedings of the Symposium on Combinatorial Search (SoCS), 76-83, 2011.
- M. Jansen and N. Sturtevant. Direction Maps for Cooperative Pathfinding. In Proceedings of the Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE), 185-190, 2008.
- M. Jansen and N. Sturtevant. A New Approach to Cooperative Pathfinding. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1401-1404, 2008.
- N. Sturtevant and M. Buro. Improving Collaborative Pathfinding using Map Abstraction. In Proceedings of the Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE), 80-85, 2006.