Overview of Path Planning Algorithms

运动规划 任意角度路径规划 路径(计算) 算法 计算机科学 障碍物 人工智能 机器人 政治学 法学 程序设计语言
作者
Hongbo Liu,Shuai Zhang,Xiaodong Yang
出处
期刊:Recent Patents on Engineering [Bentham Science]
卷期号:18 (7)
标识
DOI:10.2174/1872212118666230828150857
摘要

Background: Path-planning algorithms are widely used in robotics, vehicles, UAVs, carrier-based aircraft towing vehicles, etc. Using these algorithms, an optimal path with safe obstacle avoidance and high efficiency can be planned. In recent years, path-planning algorithms have received more and more attention from scholars at home and abroad. Objective: In order to promote the application and development of path-planning algorithms, an in-depth analysis of the current development status of path-planning algorithms was presented. The most widely used and representative algorithms in several representative results were extracted, and the characteristics and advantages and disadvantages of each algorithm were analyzed and elaborated in detail for the readers' reference. Methods: The existing path-planning algorithms were classified, and a brief overview of each traditional algorithm was given, followed by an in-depth study of the improved algorithms to summarize the advantages and disadvantages of each type of algorithm. Finally, based on these research results, the future development trend of path-planning algorithms was projected. Results: Through the research and analysis of the path-planning algorithm, it was found that the path- planning algorithm before the improvement had the problems of an unsmooth path, low computational efficiency, a slow response time, the inability to safely avoid obstacles, etc. After the improvement and optimization of the path-planning algorithm, the performance was greatly improved. Conclusion: After research and analysis, it was found that multi-algorithm fusion had great potential for development in path-planning compared to the application and optimization of a single algorithm. In addition, further research is needed in the areas of algorithm adaptability, fusion, intelligent algorithms, and extending the range of algorithmic applications.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
东方三问完成签到,获得积分10
1秒前
无花果应助丰富的小甜瓜采纳,获得10
1秒前
2秒前
生生发布了新的文献求助20
2秒前
4秒前
4秒前
XXX发布了新的文献求助10
4秒前
5秒前
freshman3005发布了新的文献求助10
5秒前
JamesPei应助赵某人采纳,获得10
6秒前
7秒前
7秒前
7秒前
苹果丑完成签到,获得积分10
7秒前
在水一方应助吉吉米米采纳,获得10
8秒前
9秒前
9秒前
9秒前
randomnyle发布了新的文献求助10
9秒前
9秒前
翊瑾发布了新的文献求助10
10秒前
10秒前
高高ai完成签到,获得积分10
10秒前
11秒前
Orange应助科研通管家采纳,获得10
11秒前
11秒前
ding应助科研通管家采纳,获得10
11秒前
十四吉发布了新的文献求助10
11秒前
CipherSage应助科研通管家采纳,获得30
11秒前
传奇3应助科研通管家采纳,获得10
11秒前
隐形曼青应助科研通管家采纳,获得10
11秒前
小面包狗应助科研通管家采纳,获得10
11秒前
在水一方应助科研通管家采纳,获得30
11秒前
隐形曼青应助科研通管家采纳,获得10
12秒前
今后应助科研通管家采纳,获得10
12秒前
12秒前
12秒前
北木萧完成签到,获得积分10
12秒前
宜醉宜游宜睡应助胡小月采纳,获得10
12秒前
12秒前
高分求助中
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
Foreign Policy of the French Second Empire: A Bibliography 500
Chen Hansheng: China’s Last Romantic Revolutionary 500
XAFS for Everyone 500
Classics in Total Synthesis IV 400
宽禁带半导体紫外光电探测器 388
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3143963
求助须知:如何正确求助?哪些是违规求助? 2795613
关于积分的说明 7815684
捐赠科研通 2451611
什么是DOI,文献DOI怎么找? 1304572
科研通“疑难数据库(出版商)”最低求助积分说明 627251
版权声明 601419