Search Results for author:
Found 2 papers, 0 papers with code
Conflict-Based Search for Connected Multi-Agent Path Finding
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.
Reachability and Coverage Planning for Connected Agents: Extended Version
We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
