.png){kind=icon}
.png){kind=icon}
Return
A decoupling method for solving the multi-agent path finding problem
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-023-01088-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many existing multi-agent path finding (MAPF) solvers focus on completeness, speed, or optimization. However, completeness and rapidity are usually in conflict with each other, which makes these algorithms far from satisfactory in practical applications. Motivated by this realistic requirement, we propose an efficient decoupling method to accelerate the solution of large MAPF problems. First, we define the concept of 'non-essential vertex'-vertices which are not needed to solve a MAPF problem, and a scheme to identify them. Then, a decoupling scheme based on 'non-essential vertex' is proposed, which will assign higher priorities to agents whose goal positions are non-essential vertices and lower priorities to agents whose start positions are non-essential vertices. That is, invoking our decoupling algorithm can decouple any given MAPF problem into three subproblems while maintaining the completeness of the solution. All three sub-MAPF problems can be solved sequentially by a complete solver (e.g., CBS or EECBS, etc.), and two of them can also be solved by a prioritized planning algorithm. We have conducted several experiments in different workspaces, and the statistical results show that the proposed decoupling method significantly improves the speed and success rate of existing MAPF solvers with almost no degradation in solution quality when solving problems with high agent density. In addition, the solving efficiency can be further improved if the prioritized planning algorithm is invoked to solve the first and third sub-MAPF problems.
Keywords:
Multi-agent systems
Multi-agent path finding
Path planning for multiple mobile robots or agents
Collision avoidance
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K