Nathan R. Sturtevant, Ph.D.

Affiliations: 
2003 University of California, Los Angeles, Los Angeles, CA 
Area:
artificial intelligence, including problem-solving, heuristic search, planning and parallel processing
Google:
"Nathan Sturtevant"

Parents

Sign in to add mentor
Richard Korf grad student 2003 UCLA
 (Multiplayer games: Algorithms and approaches.)

Children

Sign in to add trainee
David M. Chan research assistant 2013-2017 University of Denver (E-Tree)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Holte RC, Felner A, Sharon G, et al. (2017) MM: A bidirectional search algorithm that is guaranteed to meet in the middle Artificial Intelligence. 252: 232-266
Sturtevant NR, Bulitko V. (2016) Scrubbing during learning in real-time heuristic search Journal of Artificial Intelligence Research. 57: 307-343
Sharon G, Stern R, Felner A, et al. (2015) Conflict-based search for optimal multi-agent pathfinding Artificial Intelligence. 219: 40-66
Borrajo D, Felner A, Korf RE, et al. (2014) The Fifth Annual Symposium on Combinatorial Search Ai Communications. 27: 327-328
Agrawal V, Baier J, Bekris K, et al. (2012) Reports of the AAAI 2012 conference workshops Ai Magazine. 33: 119-127
Sturtevant NR. (2012) Benchmarks for grid-based pathfinding Ieee Transactions On Computational Intelligence and Ai in Games. 4: 144-148
Felner A, Zahavi U, Holte R, et al. (2011) Inconsistent heuristics in theory and practice Artificial Intelligence. 175: 1570-1603
Kirci M, Sturtevant NR, Schaeffer J. (2011) A GGP Feature Learning Algorithm KüNstliche Intelligenz. 25: 35-42
Bulitko V, Björnsson Y, Sturtevant NR, et al. (2011) Real-time heuristic search for pathfinding in video games Artificial Intelligence For Computer Games. 1-30
Moldenhauer C, Sturtevant NR. (2009) Evaluating strategies for running from the cops Ijcai International Joint Conference On Artificial Intelligence. 584-589
See more...