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

Potential Odor Intensity Grid Based UAV Path Planning Algorithm with Particle Swarm Optimization Approach

Author

Listed:
  • Yang Liu
  • Xuejun Zhang
  • Xiangmin Guan
  • Daniel Delahaye

Abstract

This paper proposes a potential odor intensity grid based optimization approach for unmanned aerial vehicle (UAV) path planning with particle swarm optimization (PSO) technique. Odor intensity is created to color the area in the searching space with highest probability where candidate particles may locate. A potential grid construction operator is designed for standard PSO based on different levels of odor intensity. The potential grid construction operator generates two potential location grids with highest odor intensity. Then the middle point will be seen as the final position in current particle dimension. The global optimum solution will be solved as the average. In addition, solution boundaries of searching space in each particle dimension are restricted based on properties of threats in the flying field to avoid prematurity. Objective function is redesigned by taking minimum direction angle to destination into account and a sampling method is introduced. A paired samples -test is made and an index called straight line rate (SLR) is used to evaluate the length of planned path. Experiments are made with other three heuristic evolutionary algorithms. The results demonstrate that the proposed method is capable of generating higher quality paths efficiently for UAV than any other tested optimization techniques.

Suggested Citation

  • Yang Liu & Xuejun Zhang & Xiangmin Guan & Daniel Delahaye, 2016. "Potential Odor Intensity Grid Based UAV Path Planning Algorithm with Particle Swarm Optimization Approach," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-16, September.
  • Handle: RePEc:hin:jnlmpe:7802798
    DOI: 10.1155/2016/7802798
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7802798.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7802798.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/7802798?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
    ---><---

    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:jnlmpe:7802798. 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.