4 citations · 4 across the 4 of their papers we have counts for
4 papers
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation
David Vainshtein, Kiril Solovey, Oren Salzman
Multi-agent pathfinding (MAPF) is concerned with planning collision-free paths for a team of agents from their start to goal locations in an environment cluttered with obstacles. T…
Leveraging Experience in Lifelong Multi-Agent Pathfinding
Nitzan Madar, Kiril Solovey, Oren Salzman
In Lifelong Multi-Agent Path Finding (L-MAPF) a team of agents performs a stream of tasks consisting of multiple locations to be visited by the agents on a shared graph while avoid…
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…
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…