activity
20142026
most citedMonte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups

6 citations · 15 across the 16 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

cs.AI2023

Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search

Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner

While the study of unit-cost Multi-Agent Pathfinding (MAPF) problems has been popular, many real-world problems require continuous time and costs due to various movement models. In…

cs.GT2023

History Filtering in Imperfect Information Games: Algorithms and Complexity

Christopher Solinas, Douglas Rebstock, Nathan R. Sturtevant +1

Historically applied exclusively to perfect information games, depth-limited search with value functions has been key to recent advances in AI for imperfect information games. Most…