2 citations · 2 across the 1 of their papers we have counts for
3 papers · 1 filter
Improving Continuous-time Conflict Based Search
Anton Andreychuk, Konstantin Yakovlev, Eli Boyarski +1
Conflict-Based Search (CBS) is a powerful algorithmic framework for optimally solving classical multi-agent path finding (MAPF) problems, where time is discretized into the time st…
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…
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
Pavel Surynek, Ariel Felner, Roni Stern +1
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-cos…