Multi-Robot Cooperative Task Allocation With Definite Path-Conflict-Free Handling

Abstract

Modeling and solving multi-robot task allocation with definite path-conflict-free handling is an important research, especially in real working environments. Some of the research lines are unable to obtain definite path-conflict-free solutions for multi-robot task allocations, such as using the penalty-term method in the fitness function to restrict the survival probabilities of the solutions with path conflicts. In some cases, these solutions are only able to satisfy the objective of minimizing task time. We formulate this problem based on grid maps, while focusing on the frequently used cooperative task allocation. In our model, two subtasks of each cooperative task must be executed by two robots, simultaneously. We propose vitality-driven genetic task allocation algorithm (VGTA), which is able to simultaneously minimize task time and realize definite conflict-free path planning. VGTA consists of local operators, such as random mutations, greedy crossovers, and vitality selection. Meanwhile, VGTA includes schedule conflict and path conflict handling strategies. In path conflict handling strategy, we not only consider the common path conflicts in a grid cell, but also focus on the path conflicts between robots when exchanging positions in the adjacent grid cells. Besides, we construct our benchmarks based on real working environments, such as factory, powerhouse, and airport environments. Experimental results indicate that VGTA’s search capability and computation cost are satisfactory. Meanwhile, its solutions are able to be really executed.