[Edit]

Nathan R. Sturtevant
(ALIAS: Nathan Reed Sturtevant, Nathan Sturtevant) [FOAF]  [Follow]

Position: Adjunct Assistant Professor
Phone: (780) 492-2427
Email:
Homepage: http://www.cs.ualberta.ca/~nathanst/
[Edit]
Statistics: H-index: 8 (See all experts' h-index.)
total citation number: 213
highest-cited paper: Partial Pathfinding Using Map Abstraction and Refinement (2005) at AAAI (Cited By 52)

Research Interest:

Multi-player Games, Automatic State Abstraction, Map Abstraction, N-Player Games, Pruning Non-Zero-Sum Games

Show Temporal Interests (Do you want to see the change of his/her research interests?)


Publications: [Edit disambiguation Result]

2009(7)
[30]Carsten Moldenhauer, Nathan R. Sturtevant. Optimal solutions for moving target search.  AAMAS (2)'2009. pp.1249~1250    Cited By 6[Bibtex]
[29]Barnabas Poczos, Yasin Abbasi-Yadkori, Csaba Szepesvari, Russell Greiner, Nathan R. Sturtevant. Learning when to stop thinking and do something!.  ICML'2009. pp.104~104   [Bibtex]
[28]Michael Buro, Jeffrey R. Long, Timothy Furtak, Nathan R. Sturtevant. Improving State Evaluation, Inference, and Search in Trick-Based Card Games.  IJCAI'2009. pp.1407~1413   [Bibtex]
[27]Carsten Moldenhauer, Nathan R. Sturtevant. Evaluating Strategies for Running from the Cops.  IJCAI'2009. pp.584~589    Cited By 2[Bibtex]
[26]Zhifu Zhang, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer, Ariel Felner. A* Search with Inconsistent Heuristics.  IJCAI'2009. pp.634~639   [Bibtex]
[25]Yngvi Bjornsson, Vadim Bulitko, Nathan R. Sturtevant. TBA*: Time-Bounded A*.  IJCAI'2009. pp.431~436   [Bibtex]
[24]Nathan R. Sturtevant, Ariel Felner, Max Barrer, Jonathan Schaeffer, Neil Burch. Memory-Based Heuristics for Explicit State Spaces.  IJCAI'2009. pp.609~614    Cited By 7[Bibtex]
2008(6)
[23]M. Renee Jansen, Nathan R. Sturtevant. A new approach to cooperative pathfinding.  AAMAS (3)'2008. pp.1401~1404    Cited By 5[Bibtex]
[22]Akihiro Kishimoto, Nathan R. Sturtevant. Optimized algorithms for multi-agent routing.  AAMAS (3)'2008. pp.1585~1588    Cited By 3[Bibtex]
[21]Nathan R. Sturtevant. An Analysis of UCT in Multi-player Games.  Computers and Games'2008. pp.37~49    Cited By 7[Bibtex]
[20]Nathan R. Sturtevant, H. James Hoover, Jonathan Schaeffer, Sean Gouglas, Michael H. Bowling, Finnegan Southey, Matthew Bouchard, Ghassan Zabaneh. Multidisciplinary students and instructors: a second-year games course.  SIGCSE'2008. pp.383~387    Cited By 6[Bibtex]
[19]M. Renee Jansen, Nathan R. Sturtevant. Direction Maps for Cooperative Pathfinding.  AIIDE'2008.     Cited By 4[Bibtex]
[18]Nathan R. Sturtevant. An Analysis of UCT in Multi-Player Games. ICGA Journal, 2008: 195~208    Cited By 7[Bibtex]
2007(4)
[17]Uzi Zahavi, Ariel Felner, Jonathan Schaeffer, Nathan R. Sturtevant. Inconsistent Heuristics.  AAAI'2007. pp.1211~1216    Cited By 14[Bibtex]
[16]Nathan R. Sturtevant, M. Renee Jansen. An Analysis of Map-Based Abstraction and Refinement.  SARA'2007. pp.344~358    Cited By 8[Bibtex]
[15]Nathan R. Sturtevant. Memory-Efficient Abstractions for Pathfinding.  AIIDE'2007. pp.31~36    Cited By 11[Bibtex]
[14]Vadim Bulitko, Nathan R. Sturtevant, Jieshan Lu, Timothy Yau. Graph Abstraction in Real-time Heuristic Search. J. Artif. Intell. Res. (JAIR), 2007: 51~100    Cited By 31[Bibtex]
2006(5)
[13]Nathan R. Sturtevant, Martin Zinkevich, Michael H. Bowling. Prob-Maxn: Playing N-Player Games with Opponent Models.  AAAI'2006.     Cited By 7[Bibtex] [PDF]
[12]Yngvi Bjornsson, Jonathan Schaeffer, Nathan R. Sturtevant. Partial Information Endgame Databases.  ACG'2006. pp.11~22   [Bibtex]
[11]Nathan R. Sturtevant, Michael H. Bowling. Robust game play against unknown opponents.  AAMAS'2006. pp.713~719    Cited By 9[Bibtex] [PDF]
[10]Nathan R. Sturtevant, Adam M. White. Feature Construction for Reinforcement Learning in Hearts.  Computers and Games'2006. pp.122~134    Cited By 10[Bibtex]
[9]Nathan R. Sturtevant, Michael Buro. Improving Collaborative Pathfinding Using Map Abstraction.  AIIDE'2006. pp.80~85    Cited By 4[Bibtex]
2005(4)
[8]Vadim Bulitko, Nathan R. Sturtevant, Maryia Kazakevich. Speeding Up Learning in Real-time Search via Automatic State Abstraction.  AAAI'2005. pp.1349~1354    Cited By 25[Bibtex] [PDF]
[7]Nathan R. Sturtevant, Michael Buro. Partial Pathfinding Using Map Abstraction and Refinement.  AAAI'2005. pp.1392~1397    Cited By 52[Bibtex] [PDF]
[6]Nathan R. Sturtevant. Leaf-Value Tables for Pruning Non-Zero-Sum Games.  IJCAI'2005. pp.317~323    Cited By 1[Bibtex]
[5]Nathan R. Sturtevant, Vadim Bulitko, Michael Buro. Automatic State Abstraction for Pathfinding in Real-Time Video Games.  SARA'2005. pp.362~364    Cited By 1[Bibtex]
2004(1)
[4]Nathan R. Sturtevant. Current Challenges in Multi-player Game Search.  Computers and Games'2004. pp.285~300    Cited By 16[Bibtex]
2003(1)
[3]Nathan R. Sturtevant. Last-Branch and Speculative Pruning Algorithms for Maxn.  IJCAI'2003. pp.669~678   [Bibtex]
2002(1)
[2]Nathan R. Sturtevant. A Comparison of Algorithms for Multi-player Games.  Computers and Games'2002. pp.108~122    Cited By 11[Bibtex]
2000(1)
[1]Nathan R. Sturtevant, Richard E. Korf. On Pruning Techniques for Multi-Player Games.  AAAI/IAAI'2000. pp.201~207    Cited By 27[Bibtex] [PDF]