Nathan Sturtevant
Papers
9
Total Citations
430
H-Index
6
About
Nathan Sturtevant is a leading figure in artificial intelligence, whose pioneering work has fundamentally shaped the field of multi-agent pathfinding (MAPF). His research focuses on developing efficient algorithms for planning collision-free paths for multiple agents, a critical challenge with direct applications in automated warehouses, robotics, and video games. Sturtevant’s major contributions include the foundational survey "Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks" (276 citations), which serves as the definitive roadmap for the entire research community. He has also introduced key algorithmic innovations, such as Extended Increasing Cost Tree Search for non-unit cost domains and Direction Maps for cooperative pathfinding, which have significantly advanced the state of the art. His work on Jump Point Search with temporal obstacles and optimized auction methods for multi-agent routing demonstrates a consistent drive to solve complex, real-world constraints. With a career spanning over a decade and a half, Sturtevant’s research has not only achieved high citation impact but has also provided the practical tools and benchmarks that enable the next generation of autonomous systems to navigate and cooperate effectively.
Research Focus
Key Achievements
Top Papers
- 1Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks276 citations · 2021
- 2Extended Increasing Cost Tree Search for Non-Unit Cost Domains59 citations · 2018
- 3Direction Maps for Cooperative Pathfinding39 citations · 2008
- 4Combining Bounding Boxes and JPS to Prune Grid Pathfinding21 citations · 2016
- 5Optimized algorithms for multi-agent routing13 citations · 2008
- 6Rapid Randomized Restarts for Multi-Agent Path Finding Solvers12 citations · 2021
- 7Jump Point Search with Temporal Obstacles5 citations · 2021
- 8Conflict-tolerant and conflict-free multi-agent meeting3 citations · 2023
- 9The compressed differential heuristic2 citations · 2017