Conflict-based search for optimal multi-agent pathfinding G Sharon, R Stern, A Felner, NR Sturtevant Artificial intelligence 219, 40-66, 2015 | 1235 | 2015 |
Benchmarks for grid-based pathfinding NR Sturtevant IEEE Transactions on Computational Intelligence and AI in Games 4 (2), 144-148, 2012 | 680 | 2012 |
Multi-agent pathfinding: Definitions, variants, and benchmarks R Stern, N Sturtevant, A Felner, S Koenig, H Ma, T Walker, J Li, D Atzmon, ... Proceedings of the International Symposium on Combinatorial Search 10 (1 …, 2019 | 627 | 2019 |
Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges A Felner, R Stern, S Shimony, E Boyarski, M Goldenberg, G Sharon, ... Proceedings of the International Symposium on Combinatorial Search 8 (1), 29-37, 2017 | 230 | 2017 |
Partial pathfinding using map abstraction and refinement N Sturtevant, M Buro AAAI 5, 1392-1397, 2005 | 194 | 2005 |
Enhanced partial expansion A* M Goldenberg, A Felner, R Stern, G Sharon, N Sturtevant, RC Holte, ... Journal of Artificial Intelligence Research 50, 141-187, 2014 | 190 | 2014 |
An analysis of UCT in multi-player games N Sturtevant ICGA Journal 31 (4), 195-208, 2008 | 165 | 2008 |
Understanding the success of perfect information monte carlo sampling in game tree search J Long, N Sturtevant, M Buro, T Furtak Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 134-140, 2010 | 125 | 2010 |
Memory-based heuristics for explicit state spaces NR Sturtevant, A Felner, M Barrer, J Schaeffer, N Burch Twenty-First International Joint Conference on Artificial Intelligence, 2009 | 113 | 2009 |
On pruning techniques for multi-player games NR Sturtevant, RE Korf AAAI/IAAI 49, 201-207, 2000 | 113 | 2000 |
Graph abstraction in real-time heuristic search V Bulitko, N Sturtevant, J Lu, T Yau Journal of Artificial Intelligence Research 30, 51-100, 2007 | 106 | 2007 |
Improving state evaluation, inference, and search in trick-based card games M Buro, JR Long, T Furtak, N Sturtevant Twenty-First International Joint Conference on Artificial Intelligence, 2009 | 101 | 2009 |
Memory-efficient abstractions for pathfinding N Sturtevant Proceedings of the AAAI Conference on Artificial Intelligence and …, 2007 | 95 | 2007 |
A polynomial-time algorithm for non-optimal multi-agent pathfinding M Khorshid, R Holte, N Sturtevant Proceedings of the International Symposium on Combinatorial Search 2 (1), 76-83, 2011 | 94 | 2011 |
Meta-agent conflict-based search for optimal multi-agent path finding G Sharon, R Stern, A Felner, N Sturtevant Proceedings of the International Symposium on Combinatorial Search 3 (1), 97-104, 2012 | 93 | 2012 |
Partial-expansion A* with selective node generation A Felner, M Goldenberg, G Sharon, R Stern, T Beja, N Sturtevant, ... Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 471-477, 2012 | 91 | 2012 |
Improving collaborative pathfinding using map abstraction N Sturtevant, M Buro Proceedings of the AAAI Conference on Artificial Intelligence and …, 2006 | 88 | 2006 |
Feature construction for reinforcement learning in hearts NR Sturtevant, AM White Computers and Games: 5th International Conference, CG 2006, Turin, Italy …, 2007 | 82 | 2007 |
TBA*: Time-Bounded A*. Y Björnsson, V Bulitko, NR Sturtevant IJCAI, 431-436, 2009 | 78 | 2009 |
Inconsistent heuristics in theory and practice A Felner, U Zahavi, R Holte, J Schaeffer, N Sturtevant, Z Zhang Artificial Intelligence 175 (9-10), 1570-1603, 2011 | 76 | 2011 |