Streaming Multi-agent Pathfinding
By: Mingkai Tang, Lu Gan, Kaichen Zhang
Potential Business Impact:
Helps robots on assembly lines move without bumping.
The task of the multi-agent pathfinding (MAPF) problem is to navigate a team of agents from their start point to the goal points. However, this setup is unsuitable in the assembly line scenario, which is periodic with a long working hour. To address this issue, the study formalizes the streaming MAPF (S-MAPF) problem, which assumes that the agents in the same agent stream have a periodic start time and share the same action sequence. The proposed solution, Agent Stream Conflict-Based Search (ASCBS), is designed to tackle this problem by incorporating a cyclic vertex/edge constraint to handle conflicts. Additionally, this work explores the potential usage of the disjoint splitting strategy within ASCBS. Experimental results indicate that ASCBS surpasses traditional MAPF solvers in terms of runtime for scenarios with prolonged working hours.
Similar Papers
Prioritized Planning for Continuous-time Lifelong Multi-agent Pathfinding
Systems and Control
Helps robots move together without crashing.
CTS-CBS: A New Approach for Multi-Agent Collaborative Task Sequencing and Path Finding
Robotics
Helps robots find paths and do jobs.
Multi-Agent Path Finding For Large Agents Is Intractable
Multiagent Systems
Robots avoid bumping into each other, even when big.