Publications by Walker, Thayne T.
In Conference (refereed)
1. | T. Walker, N. Sturtevant, A. Felner. "Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search". National Conference on Artificial Intelligence (AAAI), pp 7277-7284, February 2020. |
2. | R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, T. Kumar, R. Barták, E. Boyarski. "Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks". Symposium on Combinatorial Search, (ed: Pavel Surynek, William Yeoh), pp 151-159, July 2019. |
3. | T. Walker, N. Sturtevant, A. Felner. "Unbounded Sub-Optimal Conflict-Based Search in Complex Domains". Symposium on Combinatorial Search, (ed: Pavel Surynek, William Yeoh), pp 204-205, July 2019. |
4. | T. Walker, N. Sturtevant, A. Felner. "Extended Increasing Cost Tree Search for Non-Unit Cost Domains". International Joint Conference on Artificial Intelligence (IJCAI), (ed: Jérôme Lang), pp 534-540, July 2018. |
5. | T. Walker, D. Chan, N. Sturtevant. "Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding". ICAPS, (ed: Laura Barbulescu, Jeremy Frank, Mausam, Stephen F. Smith), pp 316-324, June 2017. |