Cooperative sweeping by multiple mobile robots with relocating portable obstacles

In this paper, we propose an off-line planning algorithm for cooperative tasks of multiple mobile robots. Sweeping means a motion that a robot covers a 2-dimensional area by its effector. Sweeping of a whole work area is fundamental and essential task of mobile robots. It is more effective if a robot can move an obstacle during a sweeping task as if we clean our room with relocating chairs. We can also consider that this is the simplest task which includes both point-to-point motion and sweeping. We model sweeping and relocation, and propose an algorithm to find appropriate path for robot and way of relocation of each obstacle. We apply the LT graph to solve the problem, which describes both motions of robots and blockades by obstacles in path-time space. We verify the efficiency of the algorithm through simulations and experiments