Path planning techniques for unmanned aerial vehicles: A review, solutions, and challenges

计算机科学 运动规划 最短路径问题 任意角度路径规划 路径(计算) 图形 运筹学 实时计算 分布式计算 人工智能 计算机网络 理论计算机科学 机器人 数学
作者
Shubhani Aggarwal,Neeraj Kumar
出处
期刊:Computer Communications [Elsevier]
卷期号:149: 270-299 被引量:579
标识
DOI:10.1016/j.comcom.2019.10.014
摘要

Path planning is one of the most important problems to be explored in unmanned aerial vehicles (UAVs) for finding an optimal path between source and destination. Although, in literature, a lot of research proposals exist on the path planning problems of UAVs but still issues of target location and identification persist keeping in view of the high mobility of UAVs. To solve these issues in UAVs path planning, optimal decisions need to be taken for various mission-critical operations performed by UAVs. These decisions require a map or graph of the mission environment so that UAVs are aware of their locations with respect to the map or graph. Keeping focus on the aforementioned points, this paper analyzes various UAVs path planning techniques used over the past many years. The aim of path planning techniques is not only to find an optimal and shortest path but also to provide the collision-free environment to the UAVs. It is important to have path planning techniques to compute a safe path in the shortest possible time to the final destination. In this paper, various path planning techniques for UAVs are classified into three broad categories, i.e., representative techniques, cooperative techniques, and non-cooperative techniques. With these techniques, coverage and connectivity of the UAVs network communication are discussed and analyzed. Based on each category of UAVs path planning, a critical analysis of the existing proposals has also been done. For better understanding, various comparison tables using parameters such as-path length, optimality, completeness, cost-efficiency, time efficiency, energy-efficiency, robustness and collision avoidance are also included in the text. In addition, a number of open research problems based on UAVs path planning and UAVs network communication are explored to provide deep insights to the readers.
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
陆扬完成签到,获得积分10
1秒前
梦璃安发布了新的文献求助10
1秒前
1秒前
嗯哼完成签到,获得积分10
4秒前
7秒前
李李李发布了新的文献求助10
8秒前
Sml完成签到,获得积分10
11秒前
11秒前
鱼干星星完成签到 ,获得积分10
12秒前
14秒前
14秒前
Lee小白完成签到,获得积分10
14秒前
15秒前
Lucas应助研友_LaV1xn采纳,获得10
16秒前
1917发布了新的文献求助10
17秒前
李李李完成签到,获得积分10
19秒前
Narcissus发布了新的文献求助10
20秒前
21秒前
lqz0103完成签到,获得积分10
22秒前
CipherSage应助科研通管家采纳,获得10
22秒前
月蚀六花发布了新的文献求助10
22秒前
共享精神应助科研通管家采纳,获得10
22秒前
老阎应助科研通管家采纳,获得10
22秒前
脑洞疼应助科研通管家采纳,获得10
22秒前
老阎应助科研通管家采纳,获得30
22秒前
共享精神应助科研通管家采纳,获得10
23秒前
香蕉觅云应助科研通管家采纳,获得50
23秒前
科目三应助科研通管家采纳,获得10
23秒前
爆米花应助科研通管家采纳,获得10
23秒前
Niuma发布了新的文献求助10
23秒前
风轩轩发布了新的文献求助30
24秒前
花园荆棘完成签到,获得积分10
24秒前
干净惜蕊完成签到,获得积分10
26秒前
研友_LaV1xn发布了新的文献求助10
27秒前
月蚀六花完成签到,获得积分10
28秒前
TAKERA发布了新的文献求助10
28秒前
momo完成签到,获得积分10
28秒前
CodeCraft应助Jim luo采纳,获得10
29秒前
姜姜姜完成签到 ,获得积分10
30秒前
33秒前
高分求助中
中国国际图书贸易总公司40周年纪念文集 大事记1949-1987 2000
TM 5-855-1(Fundamentals of protective design for conventional weapons) 1000
草地生态学 880
Threaded Harmony: A Sustainable Approach to Fashion 799
Basic Modern Theory of Linear Complex Analytic 𝑞-Difference Equations 510
Queer Politics in Times of New Authoritarianisms: Popular Culture in South Asia 500
Livre et militantisme : La Cité éditeur 1958-1967 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3058597
求助须知:如何正确求助?哪些是违规求助? 2714676
关于积分的说明 7441656
捐赠科研通 2360028
什么是DOI,文献DOI怎么找? 1250485
科研通“疑难数据库(出版商)”最低求助积分说明 607447
版权声明 596421