Search Results for author:
Found 3 papers, 2 papers with code
Improving Continuous-time Conflict Based Search
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 steps.
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
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 without colliding with each other.
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
