.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Path planning
Deadlock prediction
Dynamic backtracking
Ant colony algorithm
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization基于多目标粒子群优化的移动机器人分层全局路径规划方法
OAAI
OAAI分享收藏分享收藏Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path PlanningOAAI
OAAI分享收藏Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm基于混合PSO-MFB优化算法的自主移动机器人多目标路径规划OAAI
OAAI分享收藏
查看更多内容