IDEAS home Printed from https://ideas.repec.org/a/hin/complx/8420294.html
   My bibliography  Save this article

A New Dynamic Path Planning Approach for Unmanned Aerial Vehicles

Author

Listed:
  • Chenxi Huang
  • 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.

Suggested Citation

  • Chenxi Huang & Yisha Lan & Yuchen Liu & Wen Zhou & Hongbin Pei & Longzhi Yang & Yongqiang Cheng & Yongtao Hao & Yonghong Peng, 2018. "A New Dynamic Path Planning Approach for Unmanned Aerial Vehicles," Complexity, Hindawi, vol. 2018, pages 1-17, November.
  • Handle: RePEc:hin:complx:8420294
    DOI: 10.1155/2018/8420294
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/8420294.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2018/8420294.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/8420294?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fangyu Chen & Gangyan Xu & Yongchang Wei, 2019. "An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction," Complexity, Hindawi, vol. 2019, pages 1-14, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:8420294. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.