基于高效人工势场算法的无人机无碰撞路径规划

Praveen Kumar Selvam, G. Raja, Vasantharaj Rajagopal, K. Dev, S. Knorr
{"title":"基于高效人工势场算法的无人机无碰撞路径规划","authors":"Praveen Kumar Selvam, G. Raja, Vasantharaj Rajagopal, K. Dev, S. Knorr","doi":"10.1109/VTC2021-Spring51267.2021.9448937","DOIUrl":null,"url":null,"abstract":"Unmanned Aerial Vehicles (UAVs), a new emerging form of Internet of Things (IoT), is a promising technology to be widely used in both civil and military applications. On the fly, the UAVs need to find an efficient and safe path by avoiding both static and dynamic obstacles to carry out any mission successfully. The Artificial Potential Field (APF) algorithm is one of the conventional catalysts in UAV path planning. However, APF-aided UAVs can be easily trapped into a local minimum solution before reaching the destination. Therefore, this paper proposes an efficient APF algorithm for Collision-free Path Planning (eAPF-CPP) in UAVs. In eAPF-CPP, the attractive and repulsive potentials evaluate the quadratic distance to the destination and the obstacle respectively. The evaluation aids the UAV to select the optimal path in navigation. The eAPF-CPP mechanism is simulated in the Software-In-The-Loop (SITL) setup, and the experimental results show that the eAPF-CPP mechanism utilizes an average of 24.4 seconds to track a safe path and has a lower collision rate of 8.56% compared with Artifical Potential Field Approach (APFA).","PeriodicalId":194840,"journal":{"name":"2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Collision-free Path Planning for UAVs using Efficient Artificial Potential Field Algorithm\",\"authors\":\"Praveen Kumar Selvam, G. Raja, Vasantharaj Rajagopal, K. Dev, S. Knorr\",\"doi\":\"10.1109/VTC2021-Spring51267.2021.9448937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unmanned Aerial Vehicles (UAVs), a new emerging form of Internet of Things (IoT), is a promising technology to be widely used in both civil and military applications. On the fly, the UAVs need to find an efficient and safe path by avoiding both static and dynamic obstacles to carry out any mission successfully. The Artificial Potential Field (APF) algorithm is one of the conventional catalysts in UAV path planning. However, APF-aided UAVs can be easily trapped into a local minimum solution before reaching the destination. Therefore, this paper proposes an efficient APF algorithm for Collision-free Path Planning (eAPF-CPP) in UAVs. In eAPF-CPP, the attractive and repulsive potentials evaluate the quadratic distance to the destination and the obstacle respectively. The evaluation aids the UAV to select the optimal path in navigation. The eAPF-CPP mechanism is simulated in the Software-In-The-Loop (SITL) setup, and the experimental results show that the eAPF-CPP mechanism utilizes an average of 24.4 seconds to track a safe path and has a lower collision rate of 8.56% compared with Artifical Potential Field Approach (APFA).\",\"PeriodicalId\":194840,\"journal\":{\"name\":\"2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTC2021-Spring51267.2021.9448937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTC2021-Spring51267.2021.9448937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

无人机(uav)是物联网(IoT)的一种新兴形式,是一种具有广泛民用和军事应用前景的技术。在飞行中,无人机需要通过避开静态和动态障碍物来找到有效和安全的路径,以成功执行任何任务。人工势场(APF)算法是无人机路径规划中常用的催化剂之一。然而,apf辅助无人机在到达目的地之前很容易陷入局部最小解。为此,本文提出了一种用于无人机无碰撞路径规划(eAPF-CPP)的高效APF算法。在eAPF-CPP中,吸引电位和排斥电位分别对目标和障碍物的二次距离进行评估。该评价有助于无人机在导航中选择最优路径。在软件在环(software - in - loop, SITL)环境下对eAPF-CPP机制进行了仿真,实验结果表明,与人工势场法(APFA)相比,eAPF-CPP机制追踪安全路径的平均时间为24.4秒,碰撞率为8.56%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Collision-free Path Planning for UAVs using Efficient Artificial Potential Field Algorithm
Unmanned Aerial Vehicles (UAVs), a new emerging form of Internet of Things (IoT), is a promising technology to be widely used in both civil and military applications. On the fly, the UAVs need to find an efficient and safe path by avoiding both static and dynamic obstacles to carry out any mission successfully. The Artificial Potential Field (APF) algorithm is one of the conventional catalysts in UAV path planning. However, APF-aided UAVs can be easily trapped into a local minimum solution before reaching the destination. Therefore, this paper proposes an efficient APF algorithm for Collision-free Path Planning (eAPF-CPP) in UAVs. In eAPF-CPP, the attractive and repulsive potentials evaluate the quadratic distance to the destination and the obstacle respectively. The evaluation aids the UAV to select the optimal path in navigation. The eAPF-CPP mechanism is simulated in the Software-In-The-Loop (SITL) setup, and the experimental results show that the eAPF-CPP mechanism utilizes an average of 24.4 seconds to track a safe path and has a lower collision rate of 8.56% compared with Artifical Potential Field Approach (APFA).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信