most citedExponential-Binary State-Space Search

4 citations · 5 across the 3 of their papers we have counts for

collaborators

7 papers

cs.HC2021

The Definition-Context-Purpose Paradigm and Other Insights from Industry Professionals About the Definition of a Quest

Kristen K. Yu, Matthew Guzdial, Nathan R. Sturtevant

Among academic communities there is no single agreed upon definition of a quest. The industry perspective on this topic is also largely unknown. Thus, thee purpose of this paper is…

cs.HC20211 cited

The Impact of Visualizing Design Gradients for Human Designers

Matthew Guzdial, Nathan Sturtevant, Carolyn Yang

Mixed-initiative Procedural Content Generation (PCG) refers to tools or systems in which a human designer works with an algorithm to produce game content. This area of research rem…

cs.RO2019

Collision Detection for Agents in Multi-Agent Pathfinding

Thayne T. Walker, Nathan R. Sturtevant

Recent work on the multi-agent pathfinding problem (MAPF) has begun to study agents with motion that is more complex, for example, with non-unit action durations and kinematic cons…

cs.DS2019

Iterative Budgeted Exponential Search

Malte Helmert, Tor Lattimore, Levi H. S. Lelis +2

We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require expansions, where is the number of sta…

cs.AI2019

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

Roni Stern, Nathan Sturtevant, Ariel Felner +9

The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently witho…

cs.AI20194 cited

Exponential-Binary State-Space Search

Nathan Sturtevant, Malte Helmert

Iterative deepening search is used in applications where the best cost bound for state-space search is unknown. The iterative deepening process is used to avoid overshooting the ap…