亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
ChenhaoTong发布了新的文献求助30
1秒前
俭朴的元绿完成签到 ,获得积分10
7秒前
零零柒完成签到 ,获得积分10
7秒前
e任思完成签到 ,获得积分10
13秒前
13秒前
14秒前
唐棠发布了新的文献求助30
16秒前
Jasper应助漂亮寻云采纳,获得10
17秒前
21秒前
科研小白发布了新的文献求助10
24秒前
26秒前
彩虹猫完成签到 ,获得积分10
28秒前
科研小白完成签到,获得积分20
31秒前
Darcy完成签到,获得积分10
31秒前
SciKid524完成签到 ,获得积分10
38秒前
河鲸完成签到 ,获得积分10
44秒前
47秒前
49秒前
花开发布了新的文献求助10
54秒前
爱静静应助科研通管家采纳,获得10
54秒前
54秒前
爱静静应助科研通管家采纳,获得10
54秒前
乐乐应助科研通管家采纳,获得10
54秒前
55秒前
58秒前
huanglu发布了新的文献求助10
1分钟前
Yanice_Wan完成签到 ,获得积分10
1分钟前
颖中竹子完成签到,获得积分10
1分钟前
kongchanjie完成签到,获得积分10
1分钟前
迷人的千易完成签到,获得积分10
1分钟前
1分钟前
1分钟前
cc完成签到 ,获得积分10
1分钟前
Lucas应助huanglu采纳,获得10
1分钟前
CSS发布了新的文献求助10
1分钟前
YUAN发布了新的文献求助20
1分钟前
如果完成签到 ,获得积分10
1分钟前
1分钟前
漂亮寻云发布了新的文献求助10
1分钟前
闪闪善若完成签到 ,获得积分10
1分钟前
高分求助中
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
麻省总医院内科手册(原著第8版) (美)马克S.萨巴蒂尼 500
Chen Hansheng: China’s Last Romantic Revolutionary 500
宽禁带半导体紫外光电探测器 388
COSMETIC DERMATOLOGY & SKINCARE PRACTICE 388
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3142628
求助须知:如何正确求助?哪些是违规求助? 2793538
关于积分的说明 7806782
捐赠科研通 2449789
什么是DOI,文献DOI怎么找? 1303425
科研通“疑难数据库(出版商)”最低求助积分说明 626871
版权声明 601314