6 citations · 15 across the 16 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…
Policy Based Inference in Trick-Taking Card Games
Douglas Rebstock, Christopher Solinas, Michael Buro +1
Trick-taking card games feature a large amount of private information that slowly gets revealed through a long sequence of actions. This makes the number of histories exponentially…