Multiple Robot Rearrangement Planning Using a Territorial Approach and an Extended Project Scheduling Problem Solver

摘要

In this paper, we address a multiple robot rearrangement problem. For different applications, problem-solving methods should be able to cope with various working environments. We focus on small working environments in particular with a concentrated arrangement of objects and narrow corridors. In this type of environment, the rearrangement problem can be very complicated because of high computational cost for priority settings to prevent robots from colliding and constraints related to the order of transportation. We propose a practical algorithm that divides a complicated rearrangement problem into simple subproblems. In our method, the rearrangement problem can be reduced to a project scheduling problem using a territorial approach. The application of a territorial approach can relax the complexity of priority settings, but yields new kinds of constraints at the same time. We propose an extended project scheduling problem solver to address these constraints. The solver is constructed on the basis of meta-heuristic strategy and generates the order of transportation that observes constraints. The proposed method is tested in a simulated environment with up to four mobile robots and 12 movable objects. Simulation results show the effectiveness of our method with respect to the applicability and a reasonable calculation time.