Chenxi Huang
A new dynamic path planning approach for unmanned aerial vehicles
Huang, Chenxi; Lan, Yisha; Liu, Yuchen; Zhou, Wen; Pei, Hongbin; Yang, Longzhi; Cheng, Yongqiang; Hao, Yongtao; Peng, Yonghong
Authors
Yisha Lan
Yuchen Liu
Wen Zhou
Hongbin Pei
Longzhi Yang
Yongqiang Cheng
Yongtao Hao
Yonghong Peng
Abstract
Dynamic path planning is one of the key procedures for unmanned aerial vehicles (UAV) to successfully fulfill the diversified missions. In this paper, we propose a new algorithm for path planning based on ant colony optimization (ACO) and artificial potential field. In the proposed algorithm, both dynamic threats and static obstacles are taken into account to generate an artificial field representing the environment for collision free path planning. To enhance the path searching efficiency, a coordinate transformation is applied to move the origin of the map to the starting point of the path and in line with the source-destination direction. Cost functions are established to represent the dynamically changing threats, and the cost value is considered as a scalar value of mobile threats which are vectors actually. In the process of searching for an optimal moving direction for UAV, the cost values of path, mobile threats, and total cost are optimized using ant optimization algorithm. The experimental results demonstrated the performance of the new proposed algorithm, which showed that a smoother planning path with the lowest cost for UAVs can be obtained through our algorithm.
Citation
Huang, C., Lan, Y., Liu, Y., Zhou, W., Pei, H., Yang, L., Cheng, Y., Hao, Y., & Peng, Y. (2018). A new dynamic path planning approach for unmanned aerial vehicles. Complexity, 2018, Article 8420294. https://doi.org/10.1155/2018/8420294
Journal Article Type | Article |
---|---|
Acceptance Date | Oct 21, 2018 |
Online Publication Date | Nov 5, 2018 |
Publication Date | Nov 5, 2018 |
Deposit Date | Aug 9, 2019 |
Publicly Available Date | Aug 9, 2019 |
Journal | Complexity |
Print ISSN | 1076-2787 |
Publisher | Hindawi |
Peer Reviewed | Peer Reviewed |
Volume | 2018 |
Article Number | 8420294 |
DOI | https://doi.org/10.1155/2018/8420294 |
Keywords | Multidisciplinary |
Public URL | https://hull-repository.worktribe.com/output/1150890 |
Publisher URL | https://www.hindawi.com/journals/complexity/2018/8420294/ |
Contract Date | Aug 9, 2019 |
Files
Published article
(5.9 Mb)
PDF
Copyright Statement
© 2018 Chenxi Huang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
You might also like
Using outlier elimination to assess learning-based correspondence matching methods
(2024)
Journal Article
An AI-Driven Secure and Intelligent Robotic Delivery System
(2022)
Journal Article
Downloadable Citations
About Repository@Hull
Administrator e-mail: repository@hull.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search