1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.AI2020★ 1 cited
Conflict-Based Search for Connected Multi-Agent Path Finding
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
We study a variant of the multi-agent path finding problem (MAPF) in which agents are required to remain connected to each other and to a designated base. This problem has applicat…
cs.AI2019
Reachability and Coverage Planning for Connected Agents: Extended Version
Tristan Charrier, Arthur Queffelec, Ocan Sankur +1
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model…