A Complete Algorithm for Generating Safe Trajectories for Multi-robot Teams

Sarah Tang, Vijay Kumar

Abstract: In this paper, we consider the problem of planning collision-free trajectories to navigate a team of labeled robots from a set of start locations to a set of goal locations, where robots have pre-assigned and non-interchangeable goals. We present a solution to this problem for a centralized team operating in an obstacle-free, two-dimensional workspace. Our algorithm allows robots to follow Optimal Motion Plans (OMPs) to their goals when possible and has them enter Circular HOlding Patterns (CHOPs) to safely navigate congested areas. This OMP $$+$$ CHOP algorithm is shown to be safe and complete, and simulation results show scalability to hundreds of robots.