|
- 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.
- 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.
- 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.
|