Thayne Walker
Thayne Walker
Verified email at
Cited by
Cited by
Multi-agent pathfinding: Definitions, variants, and benchmarks
R Stern, N Sturtevant, A Felner, S Koenig, H Ma, T Walker, J Li, D Atzmon, ...
arXiv preprint arXiv:1906.08291, 2019
Extended Increasing Cost Tree Search for Non-Unit Cost Domains.
TT Walker, NR Sturtevant, A Felner
IJCAI, 534-540, 2018
Using hierarchical constraints to avoid conflicts in multi-agent pathfinding
T Walker, D Chan, N Sturtevant
Proceedings of the International Conference on Automated Planning and …, 2017
Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search
TT Walker, NR Sturtevant, A Felner
Proceedings of the AAAI Conference on Artificial Intelligence 34 (05), 7277-7284, 2020
Collision detection for agents in multi-agent pathfinding
TT Walker, NR Sturtevant
arXiv preprint arXiv:1908.09707, 2019
Tech Report: Efficient and Exact Collision Detection for Circular Agents.
T Walker
arXiv preprint arXiv:1908.09707, 2019
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains.
TT Walker, NR Sturtevant, A Felner
SOCS, 204-205, 2019
Multi-Agent Pathfinding in Complex Domains
TT Walker
Artificial Intelligence 219, 40-66, 0
The system can't perform the operation now. Try again later.
Articles 1–8