IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i1p21-52.html
   My bibliography  Save this article

A modified symbiotic organisms search algorithm for unmanned combat aerial vehicle route planning problem

Author

Listed:
  • Fahui Miao
  • Yongquan Zhou
  • Qifang Luo

Abstract

Route planning is the core component of unmanned combat aerial vehicle (UCAV) systems and the premise for implementation of airborne reconnaissance, surveillance, combat, and other tasks. The purpose is to find the optimal flight route under certain constraints, and its essence is a multi-constrained global optimisation problem. This paper presents a modified symbiotic organisms search algorithm based on the simplex method (SMSOS) to solve the UCAV path planning problem. In addition to the flight environment for the fixed threat area, this paper tested the flight environment of the randomly generated threat area because of the complexity of the actual battlefield threat area. After many simulation tests, it was concluded that SMSOS can find the shortest flight path while avoiding the threat areas. The experimental results show that SMSOS has faster convergence speed, higher precision, and stronger robustness than the other main swarm intelligence algorithms for solving the UCAV flight planning problem.

Suggested Citation

  • Fahui Miao & Yongquan Zhou & Qifang Luo, 2019. "A modified symbiotic organisms search algorithm for unmanned combat aerial vehicle route planning problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(1), pages 21-52, January.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:1:p:21-52
    DOI: 10.1080/01605682.2017.1418151
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2017.1418151
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2017.1418151?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tjorxx:v:70:y:2019:i:1:p:21-52. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.