Collision-free Path Planning for UAVs using Efficient Artificial Potential Field Algorithm

被引:13
|
作者
Selvam, Praveen Kumar [1 ]
Raja, Gunasekaran [3 ]
Rajagopal, Vasantharaj [4 ]
Dev, Kapal [5 ]
Knorr, Sebastian [2 ]
机构
[1] Ernst Abbe Univ, Dept SciTech, Jena, Germany
[2] Ernst Abbe Univ, Dept Elect & Comp Engn, Jena, Germany
[3] Anna Univ, Dept Comp Technol, Chennai, Tamil Nadu, India
[4] Anna Univ, Dept Aerosp Engn, Chennai, Tamil Nadu, India
[5] Trinity Coll Dublin, CONNECT Ctr, Dublin, Ireland
关键词
Unmanned Aerial Vehicle (UAV); Obstacle Avoidance; Software-In-The-Loop (SITL); Artificial Potential Field Algorithm; Collision-free Path Planning; OBSTACLE AVOIDANCE;
D O I
10.1109/VTC2021-Spring51267.2021.9448937
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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).
引用
收藏
页数:5
相关论文
共 50 条
  • [21] Collision-free path planning for efficient inspection of free-form surface by using a trigger probe
    Zhao, Zhengcai
    Li, Yao
    Fu, Yucan
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2022, 120 (3-4): : 2183 - 2200
  • [22] Collision-free path planning with neural networks
    Lee, SK
    Kardaras, G
    1997 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION - PROCEEDINGS, VOLS 1-4, 1997, : 3565 - 3570
  • [23] COLLISION-FREE PATH PLANNING FOR LABORATORY ROBOT
    Babiarz, Artur
    Jaskot, Krzysztof
    PROCEEDINGS OF 11TH INTERNATIONAL CARPATHIAN CONTROL CONFERENCE, 2010, 2010, : 63 - 66
  • [24] Collision-free path planning for efficient inspection of free-form surface by using a trigger probe
    Zhengcai Zhao
    Yao Li
    Yucan Fu
    The International Journal of Advanced Manufacturing Technology, 2022, 120 : 2183 - 2200
  • [25] AN EFFICIENT ALGORITHM FOR FINDING A COLLISION-FREE PATH AMONG POLYHEDRAL OBSTACLES
    FU, LC
    LIU, DY
    JOURNAL OF ROBOTIC SYSTEMS, 1990, 7 (01): : 129 - 137
  • [26] Collision-free trajectory planning of multi-rotor UAVs in a wind condition based on modified potential field
    Heidari, Hamidreza
    Saska, Martin
    MECHANISM AND MACHINE THEORY, 2021, 156
  • [27] Efficient collision-free path planning for autonomous underwater vehicles in dynamic environments with a hybrid optimization algorithm
    Zhuang, Yufei
    Sharma, Sanjay
    Subudhi, Bidyadhar
    Huang, Haibin
    Wan, Jian
    OCEAN ENGINEERING, 2016, 127 : 190 - 199
  • [28] MT-SIPP: An Efficient Collision-Free Multi-Chain Robot Path Planning Algorithm
    Miao, Jinchao
    Li, Ping
    Chen, Chuangye
    Tian, Jiya
    Yang, Liwei
    MACHINES, 2024, 12 (07)
  • [29] Collision-free path planning for multiple robots using efficient turn-angle assignment
    Rodriguez, F.
    Diaz-Banez, J. M.
    Fabila-Monroy, R.
    Caraballo, L. E.
    Capitan, J.
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2024, 177
  • [30] A Collision-Free Path Planning Algorithm for Non-Complex ASRS Using Heuristic Functions
    Abi-Char, Pierre E.
    Riman, Chadi
    2021 44TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2021, : 52 - 57