Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Conflict-based search for optimal multi-agent pathfinding
2014701 citationsAriel Felner, Nathan Sturtevant et al.Artificial Intelligenceprofile →
Countries citing papers authored by Nathan Sturtevant
Since
Specialization
Citations
This map shows the geographic impact of Nathan Sturtevant's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nathan Sturtevant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nathan Sturtevant more than expected).
Fields of papers citing papers by Nathan Sturtevant
This network shows the impact of papers produced by Nathan Sturtevant. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nathan Sturtevant. The network helps show where Nathan Sturtevant may publish in the future.
Co-authorship network of co-authors of Nathan Sturtevant
This figure shows the co-authorship network connecting the top 25 collaborators of Nathan Sturtevant.
A scholar is included among the top collaborators of Nathan Sturtevant based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Nathan Sturtevant. Nathan Sturtevant is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sturtevant, Nathan, Jeff Orkin, Michael Cook, et al.. (2014). Playable Experiences at AIIDE 2014. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 10(1). 203–210.3 indexed citations
4.
Sturtevant, Nathan, et al.. (2013). Subset selection of search heuristics. International Joint Conference on Artificial Intelligence. 637–643.6 indexed citations
5.
Sturtevant, Nathan. (2013). Incorporating Human Relationships Into Path Planning. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 9(1). 177–183.5 indexed citations
Sturtevant, Nathan, Vadim Bulitko, & Yngvi Björnsson. (2010). On learning in agent-centered search. Adaptive Agents and Multi-Agents Systems. 333–340.20 indexed citations
10.
Zhang, Zhifu, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer, & Ariel Felner. (2009). A* search with inconsistent heuristics. International Joint Conference on Artificial Intelligence. 634–639.13 indexed citations
11.
Björnsson, Yngvi, Vadim Bulitko, & Nathan Sturtevant. (2009). TBA*: time-bounded A*. International Joint Conference on Artificial Intelligence. 431–436.27 indexed citations
12.
Sturtevant, Nathan, et al.. (2009). Memory-based heuristics for explicit state spaces. International Joint Conference on Artificial Intelligence. 609–614.71 indexed citations
13.
Buro, Michael, et al.. (2009). Improving state evaluation, inference, and search in trick-based card games. International Joint Conference on Artificial Intelligence. 1407–1413.34 indexed citations
14.
Sturtevant, Nathan, et al.. (2009). Optimal solutions for moving target search. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2. 1249–1250.13 indexed citations
15.
Sturtevant, Nathan, et al.. (2008). Direction Maps for Cooperative Pathfinding. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 4(1). 185–190.32 indexed citations
Sturtevant, Nathan. (2007). Memory-Efficient Abstractions for Pathfinding. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 3(1). 31–36.50 indexed citations
18.
Sturtevant, Nathan & Michael Buro. (2006). Improving Collaborative Pathfinding Using Map Abstraction. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 2(1). 80–85.47 indexed citations
19.
Sturtevant, Nathan, Martin Zinkevich, & Michael Bowling. (2006). Prob-Max n : playing N-player games with opponent models. National Conference on Artificial Intelligence. 1057–1063.21 indexed citations
20.
Sturtevant, Nathan & Richard E. Korf. (2000). On Pruning Techniques for Multi-Player Games. National Conference on Artificial Intelligence. 201–207.36 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.