.png){kind=icon}
.png){kind=icon}
Return
Deadlock avoidance based on connectivity detection and dynamic backtracking for path planning
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-022-07557-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main purpose of this paper is to solve the deadlock problem encountered by the algorithm in robot path planning, so as to improve the efficiency of the algorithm. Therefore, two strategies are proposed in this paper to help the algorithm solve the common deadlock problem. First, a deadlock prediction strategy based on connectivity detection is proposed to preprocess the map. The deadlock region is filled by the image processing method. Second, a dynamic backtracking strategy is proposed to help the algorithm exit quickly in the deadlock region to complete the task. With these two strategies, even if the deadlock region is large, the algorithm can get the result quickly. This paper takes the ant colony algorithm as an example to demonstrate the deadlock strategy. By comparing with other algorithms, it can be found that the optimization rate of the proposed strategy is up to 5.96% and 88.5% for the optimal path and the number of iterations, respectively.
Keywords:
Path planning
Deadlock prediction
Dynamic backtracking
Ant colony algorithm
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W