4 citations · 5 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.MA2021
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance
Nir Greshler, Ofir Gordon, Oren Salzman +1
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem, an extension to the classical MAPF problem, where cooperative behavior is incorporated. In this setting, a…
cs.MA2021
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds
Ofir Gordon, Yuval Filmus, Oren Salzman
The problem of Multi-Agent Path Finding (MAPF) calls for finding a set of conflict-free paths for a fleet of agents operating in a given environment. Arguably, the state-of-the-art…