﻿<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD with MathML3 v1.2 20190208//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article
    xmlns:mml="http://www.w3.org/1998/Math/MathML"
    xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">UJCSC</journal-id>
      <journal-title-group>
        <journal-title>Universal Journal of Computer Sciences and Communications</journal-title>
      </journal-title-group>
      <issn pub-type="epub"></issn>
      <issn pub-type="ppub"></issn>
      <publisher>
        <publisher-name>Science Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.31586/ujfs.2022.267</article-id>
      <article-id pub-id-type="publisher-id">UJCSC-267</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>
          Particle Swarm Network Design for UCAV Intelligence System Path Planning
        </article-title>
      </title-group>
      <contrib-group>
<contrib contrib-type="author">
<name>
<surname>Khan</surname>
<given-names>Sheharyar</given-names>
</name>
<xref rid="af1" ref-type="aff">1</xref>
<xref rid="cr1" ref-type="corresp">*</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Khan</surname>
<given-names>Sohrab</given-names>
</name>
<xref rid="af2" ref-type="aff">2</xref>
</contrib>
      </contrib-group>
<aff id="af1"><label>1</label> School of Software, Northwestren Polytechnical University, Xian, China</aff>
<aff id="af2"><label>2</label> School of Computer Science, University of Haripur, Haripur, Pakistan</aff>
<author-notes>
<corresp id="c1">
<label>*</label>Corresponding author at: School of Software, Northwestren Polytechnical University, Xian, China
</corresp>
</author-notes>
      <pub-date pub-type="epub">
        <day>22</day>
        <month>04</month>
        <year>2022</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <history>
        <date date-type="received">
          <day>22</day>
          <month>04</month>
          <year>2022</year>
        </date>
        <date date-type="rev-recd">
          <day>22</day>
          <month>04</month>
          <year>2022</year>
        </date>
        <date date-type="accepted">
          <day>22</day>
          <month>04</month>
          <year>2022</year>
        </date>
        <date date-type="pub">
          <day>22</day>
          <month>04</month>
          <year>2022</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>&#xa9; Copyright 2022 by authors and Trend Research Publishing Inc. </copyright-statement>
        <copyright-year>2022</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
          <license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p>
        </license>
      </permissions>
      <abstract>
        In military battle, the unmanned combat aerial vehicle (UCAV) plays a critical role. The UCAV avoids the fatal military zone as well as radars. If there is just a narrow path between the defensive areas, it is dan-gerous. It chooses the quickest and safest path. The balance evolution technique is used to improve the path planning of UCAV in this study, which results in a novel artificial bee colony. To regulate the position of a swarm of UCAVs, a particle swarm network is used to communicate between the UCAVs in the swarm. According to simulation data, the particle swarm network technique is more efficient than the ABC ap-proach. The intelligence system is taught via an artificial neural network.
      </abstract>
      <kwd-group>
        <kwd-group><kwd>Particle Swarm; Artificial Neural network (ANN); unmanned combat aerial vehicle (UCAV)</kwd>
</kwd-group>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
<title>Introduction</title><p>Several new strategies arose as a result of the Gulf and Kosovo Wars, and air power's dominance was cemented. As the Gulf War revealed [
<xref ref-type="bibr" rid="R1">1</xref>] strategic air superiority alone cannot win a war. According to military planners, air power will have a significant impact on the outcome of future battles. The UCAV component is automatically moved to the top of the list as a consequence of these conversations. With the UCAV, combat losses are kept at a minimal while simultaneously overcoming different human limitations. Human-piloted combat aircraft are expected to be more agile, faster, and smaller than unmanned aerial vehicles (UAVs) [
<xref ref-type="bibr" rid="R1">1</xref>,<xref ref-type="bibr" rid="R2">2</xref>]. In a heavily populated air defense battle sector, such unmanned vehicles could be used in place of manned aircraft using low-looking radars and QRMs (quick reaction missiles). It will be simple for them to keep a careful check on the adversary's activities and send that information to the command stations. The UCAV concept is technically feasible, despite its theoretical plausibility. This type of unmanned aerial vehicle might address operational needs while also fitting into a larger design. The historical preference for manned aircraft should not preclude them from being welcomed in future fights driven entirely by technological progress. To use these forces effectively, one must first understand them. Before ground soldiers can engage in serious combat with the enemy side, major battles will very definitely be won by air power in the near future. Unmanned combat aerial vehicles (UCAVs) will almost certainly play a key role in the future development of air power [
<xref ref-type="bibr" rid="R3">3</xref>,<xref ref-type="bibr" rid="R4">4</xref>].As a result, they will be utilized for reconnaissance, scouting, and disrupting the enemy's air defense system. "Not only does the UCAV have the attractiveness of decreasing combat casualties, but it also overcomes human constraints on Gcrunching techniques and a pleasant cockpit environment for the pilot's safety and survival," says the author. The invention of the synthetic UCAV can identify the adversary army's marketing activity. Avoid being spotted by radar and arterially by your foes. To this end, the module and set of rules for the UCAV must be laid out. The module will identify the potential danger zone and warn aircraft to stay away from it. Researchers have gradually turned their interests away from deterministic algorithms in order to cope with the increased complexity of modeling a fighting region. ABC is an artificial bee colony cognitive algorithm based on honeybee swarm foraging behavior. The majority of the swarm is made up of three types of bees. There are three sorts of bees: employ bees, observation bees, and scout bees [
<xref ref-type="bibr" rid="R5">5</xref>]. Using a bee, determine the profitability, distance, and direction of linked food. The information obtained by employed bees was examined by onlooker bees to assess the possibility of food and direction [
<xref ref-type="bibr" rid="R6">6</xref>]. Scout bees are in charge of locating new food once the old food has gone out. Foraging's purpose is to find as much food as possible. Unmanned combat air vehicles (UCAVs), which will be important in augmenting air power, are often included in these debates. It is theoretically possible, and it has been demonstrated in recent air battles. This type of unmanned aerial vehicle can fulfill operational needs while also fitting into a larger strategy. There should be no historical prejudice against unmanned aircraft that precludes us from implementing this technology in future technologically driven warfare.</p>
</sec><sec id="sec2">
<title>Materials and Methods</title><title>2.1. Intelligent system based on artificial neural networks</title><p>The network formed by a particle swarm network resembles a flock of birds. If the swarm comes across a dangerous location with a limited path, and only one UCAV travels through it, the swarm utilizes artificial neural network communication to instruct the other drones to plan the path experience of the drone that passes through the narrow way to avoid drone collision [
<xref ref-type="bibr" rid="R7">7</xref>].This strategy is employed to address this issue. Particle swarm was inspired by a flock of flying animals. The entire flock of birds moves in a swarm when hunting for prey, and communication between them is comparable to that of a Mesh network. Calculate reason, see relationships and analogies, learn from experience, store and retrieve data from memory, solve problems, comprehend sophisticated ideas, communicate effectively in natural language, classify, generalize, and adapt to new situations are just a few of the capabilities of an algorithm. Linguistic intelligence, musical intelligence, logical-mathematical intelligence, spatial intelligence, intrapersonal intelligence, and interpersonal intelligence are all artificial intelligence domains that might benefit from more research. Only the UCAV Intelligence system is discussed in this study.</p>
<title>2.2. Algorithm of Particle Swarms</title><title>2.3.1. (a) UCAV Swarm Path Planning Combat Field Modeling</title><p>UCAV proposed method (autonomous combat aerial vehicle path planning) is a global optimization issue involving the creation of a collection of waypoints from a starting point Q to a destination point M while avoiding flying outside of the map or being captured by threats. There are two types of environmental risks, according to our research: mobile and static threats. Static threats are obstacles that remain at a fixed position in space (represented by yellow circles with a set radius); mobile threats are obstructions that move dynamically and with a known constant velocity (denoted as blue circles). The straight-line QM divides the flight path into (M+1) segments, each representing one waypoint along the route [
<xref ref-type="bibr" rid="R3">3</xref>], as illustrated inFigure <xref ref-type="fig" rid="fig1"> 1</xref>. The initial population of particles is created in an active zone of particles separated by barrier sites, forcing a particle to follow the best path in a more constrained region. Throughout the search process, the acceleration coefficient and inertia weight of particles are adjusted adaptively as the number of iterations increases [
<xref ref-type="bibr" rid="R8">8</xref>,<xref ref-type="bibr" rid="R9">9</xref>]. A transformation of a coordinate system is designed to lessen the complexity of the computing process in the path planning for the UCAV, as shown inFigure <xref ref-type="fig" rid="fig2"> 2</xref>.</p>
<fig id="fig1">
<label>Figure 1</label>
<caption>
<p>UCAV Swarm Path Planning Combat Field Modeling</p>
</caption>
<graphic xlink:href="267.fig.001" />
</fig><fig id="fig2">
<label>Figure 2</label>
<caption>
<p>Mobile threats only</p>
</caption>
<graphic xlink:href="267.fig.002" />
</fig><p>The new x-axis is the straight line between Q and M (QM), and the new coordinate origin is the UCAV start point (S), yielding a new coordinate system (x', 0', y') that differs from the previous coordinate system (xoy). The link between the original and converted coordinates in the two coordinate systems may be represented as follows [
<xref ref-type="bibr" rid="R3">3</xref>] if the coordinates of a waypoint in the (xoy) system and the (x', 0', y') system are provided as (x 0, y 0)L and (x t, y t)L, respectively.</p>

<disp-formula id="FD1"><label>(1)</label><math> <semantics>  <mrow>   <mrow><mo>[</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <msub>       <mi>x</mi>       <mi>j</mi>      </msub>           </mtd>    </mtr>    <mtr>     <mtd>      <msub>       <mi>y</mi>       <mi>j</mi>      </msub>           </mtd>    </mtr>   </mtable>    <mo>]</mo></mrow><mo>=</mo><mrow><mo>[</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <mi>cos</mi><mi>&#x03B8;</mi><mtext>&#x00A0;&#x00A0;&#x00A0;</mtext><mi>sin</mi><mi>&#x03B8;</mi>     </mtd>    </mtr>    <mtr>     <mtd>      <mo>&#x2212;</mo><mi>sin</mi><mi>&#x03B8;</mi><mtext>&#x00A0;</mtext><mi>cos</mi><mi>&#x03B8;</mi><mtext>&#x00A0;</mtext>     </mtd>    </mtr>   </mtable>    <mo>]</mo></mrow><mrow><mo>[</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <msub>       <mi>x</mi>       <mi>O</mi>      </msub>      <mo>&#x2212;</mo><msub>       <mi>x</mi>       <mi>Q</mi>      </msub>           </mtd>    </mtr>    <mtr>     <mtd>      <msub>       <mi>y</mi>       <mi>O</mi>      </msub>      <mo>&#x2212;</mo><msub>       <mi>y</mi>       <mi>Q</mi>      </msub>           </mtd>    </mtr>   </mtable>    <mo>]</mo></mrow></mrow>   </semantics></math></disp-formula>
<disp-formula id="FD2"><label>(2)</label><math> <semantics>  <mrow>   <mo>&#x007C;</mo><mover accent='true'>    <mi>c</mi>    <mo stretchy='true'>&#x2192;</mo>   </mover>   <mo>&#x007C;</mo><mo>=</mo><mfrac>    <mn>1</mn>    <mrow>     <msubsup>      <mstyle mathsize='140%' displaystyle='true'><mi>d</mi></mstyle>      <mrow>       <mi>i</mi><mi>j</mi></mrow>      <mn>2</mn>     </msubsup>     </mrow>   </mfrac>   </mrow>   </semantics></math></disp-formula>
<disp-formula id="FD3"><label>(3)</label><math> <semantics>  <mrow>   <mo>&#x007C;</mo><mover accent='true'>    <mrow>     <msub>      <mi>c</mi>      <mi>x</mi>     </msub>     </mrow>    <mo stretchy='true'>&#x2192;</mo>   </mover>   <mo>&#x007C;</mo><mo>=</mo><mo>&#x007C;</mo><mover accent='true'>    <mi>c</mi>    <mo stretchy='true'>&#x2192;</mo>   </mover>   <mo>&#x007C;</mo><mo>&#x00B7;</mo><mfrac>    <mrow>     <msub>      <mi>x</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>     </msub>     </mrow>    <mrow>     <msub>      <mi>d</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>     </msub>     </mrow>   </mfrac>   <mo>=</mo><mfrac>    <mrow>     <msub>      <mi>x</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>     </msub>     </mrow>    <mrow>     <msubsup>      <mi>d</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>      <mn>3</mn>     </msubsup>     </mrow>   </mfrac>   </mrow>   </semantics></math></disp-formula>
<disp-formula id="FD4"><label>(4)</label><math> <semantics>  <mrow>   <mo>&#x007C;</mo><mover accent='true'>    <mrow>     <msub>      <mi>c</mi>      <mi>y</mi>     </msub>     </mrow>    <mo stretchy='true'>&#x2192;</mo>   </mover>   <mo>&#x007C;</mo><mo>=</mo><mo>&#x007C;</mo><mover accent='true'>    <mi>c</mi>    <mo stretchy='true'>&#x2192;</mo>   </mover>   <mo>&#x007C;</mo><mo>&#x00B7;</mo><mfrac>    <mrow>     <msub>      <mi>y</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>     </msub>     </mrow>    <mrow>     <msub>      <mi>d</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>     </msub>     </mrow>   </mfrac>   <mo>=</mo><mfrac>    <mrow>     <msub>      <mi>y</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>     </msub>     </mrow>    <mrow>     <msubsup>      <mi>d</mi>      <mrow>       <mi>i</mi><mi>j</mi></mrow>      <mn>3</mn>     </msubsup>     </mrow>   </mfrac>   </mrow>   </semantics></math></disp-formula>
<disp-formula id="FD5"><label>(5)</label><math> <semantics>  <mrow>   <mo>&#x007C;</mo><mstyle displaystyle='true'>    <msubsup>     <mo>&#x2211;</mo>     <mrow>      <mi>k</mi><mo>=</mo><mn>1</mn></mrow>     <mi>m</mi>    </msubsup>    <mrow>     <mover accent='true'>      <mi>c</mi>      <mo stretchy='true'>&#x2192;</mo>     </mover>     </mrow>   </mstyle><mo>&#x007C;</mo><mo>=</mo><msqrt>    <mrow>     <mo>&#x007C;</mo><mstyle displaystyle='true'>      <msubsup>       <mo>&#x2211;</mo>       <mrow>        <mi>k</mi><mo>=</mo><mn>1</mn></mrow>       <mi>m</mi>      </msubsup>      <mrow>       <mover accent='true'>        <mrow>         <msub>          <mi>c</mi>          <mi>x</mi>         </msub>         </mrow>        <mo stretchy='true'>&#x2192;</mo>       </mover>       </mrow>     </mstyle><msup>      <mo>&#x007C;</mo>      <mn>2</mn>     </msup>     <mo>+</mo><mo>&#x007C;</mo><mstyle displaystyle='true'>      <msubsup>       <mo>&#x2211;</mo>       <mrow>        <mi>k</mi><mo>=</mo><mn>1</mn></mrow>       <mi>m</mi>      </msubsup>      <mrow>       <mover accent='true'>        <mrow>         <msub>          <mi>c</mi>          <mi>y</mi>         </msub>         </mrow>        <mo stretchy='true'>&#x2192;</mo>       </mover>       </mrow>     </mstyle><msup>      <mo>&#x007C;</mo>      <mn>2</mn>     </msup>     </mrow>   </msqrt>   </mrow>   </semantics></math></disp-formula><p>When M is the beginning point's location in the original coordinate system (x Q,y Q)M, the cost of mobile threats is calculated as follows:The horizontal component of |c | is represented by the symbol |(c x) |, whereas the vertical component is represented by the symbol |(c y) |. The letter "m" also represents the ant's exposure to mobile threats, as well as the distance between sites I and j, where |c denotes a mobile threat and |(c x) | denotes the threat's horizontal component. The distance between places I and j contains a horizontal component x ij of d ij, a vertical component y ij of d ij, and a horizontal component x ij of d ij. Finally, when an ant or pheromone moves, the position of the ant or pheromone is updated in real time.</p>

<disp-formula id="FD6"><label>(6)</label><math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mi>T</mi>   </msub>   <mo>=</mo><mstyle displaystyle='true'>    <munderover>     <mo>&#x2211;</mo>     <mrow>      <mi>i</mi><mo>=</mo><mn>0</mn></mrow>     <mi>M</mi>    </munderover>    <mrow>     <msub>      <mi>J</mi>      <mi>T</mi>     </msub>     <mrow><mo>(</mo>      <mi>i</mi>     <mo>)</mo></mrow></mrow>   </mstyle></mrow>   </semantics></math></disp-formula>
<disp-formula id="FD7"><label>(7)</label><math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mi>F</mi>   </msub>   <mo>=</mo><mstyle displaystyle='true'>    <munderover>     <mo>&#x2211;</mo>     <mrow>      <mi>i</mi><mo>=</mo><mn>0</mn></mrow>     <mi>M</mi>    </munderover>    <mrow>     <msub>      <mi>J</mi>      <mi>F</mi>     </msub>     <mrow><mo>(</mo>      <mi>i</mi>     <mo>)</mo></mrow></mrow>   </mstyle></mrow>   </semantics></math></disp-formula>
<disp-formula id="FD8"><label>(8)</label><math> <semantics>  <mrow>   <mi>J</mi><mo>=</mo><msub>    <mi>J</mi>    <mi>T</mi>   </msub>   <mo>+</mo><msub>    <mi>J</mi>    <mi>F</mi>   </msub>   </mrow>   </semantics></math></disp-formula><p>J T I and J F I represent the mobile threat cost and the fuel cost, respectively, for each ith sub path from Wi to Wi+1. The mobile threat cost of a sub path is approximated in Fig 2 by utilizing blue circles along the sub path to estimate the mobile threat cost. The threat cost is determined as follows if the ith sub path (Wi, Wi+1) is within the effect range:</p>

<disp-formula id="FD9"><label>(9)</label><math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mi>T</mi>   </msub>   <mrow><mo>(</mo>    <mi>i</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>L</mi>    <mi>i</mi>   </msub>   <mstyle displaystyle='true'>    <munderover>     <mo>&#x2211;</mo>     <mrow>      <mi>k</mi><mo>=</mo><mn>1</mn></mrow>     <mrow>      <msub>       <mstyle mathsize='140%' displaystyle='true'><mi>N</mi></mstyle>       <mi>t</mi>      </msub>      </mrow>    </munderover>    <mrow>     <msub>      <mi>T</mi>      <mi>K</mi>     </msub>     </mrow>   </mstyle><mo>&#x00B7;</mo><msub>    <mi>C</mi>    <mi>K</mi>   </msub>   </mrow>   </semantics></math></disp-formula><p>The number of mobile threats encountered is denoted by Nt, the length of the ith sub route is denoted by L, and the weight of each mobile threat encountered is denoted by TK. The cost of each mobile threat [
<xref ref-type="bibr" rid="R12">12</xref>,<xref ref-type="bibr" rid="R13">13</xref>], which is estimated using the technique, is denoted by CK (5). Furthermore, because WF stands for fuel weight, the following is the fuel cost for the ith sub route.</p>
<title>2.3.2. (b) ABC and (PSN) Particle Swarm Network combined</title><p>When the distance between the two risks is short, the drones in a swarm communicate with one another using a neural network. The first drone uses neural networks to provide data to other drones about how many degrees you arrive in which pattern and how many altitudes you arrive in [
<xref ref-type="bibr" rid="R14">14</xref>,<xref ref-type="bibr" rid="R15">15</xref>]. This program keeps the drones from colliding and chooses their path on their own. The suggested swarm UCAV neural network is shown inFigure <xref ref-type="fig" rid="fig4"> 4</xref>, while the limited path modeling is shown inFigure <xref ref-type="fig" rid="fig3"> 3</xref>.</p>
<fig id="fig3">
<label>Figure 3</label>
<caption>
<p>Narrow path modelling diagram</p>
</caption>
<graphic xlink:href="267.fig.003" />
</fig><fig id="fig4">
<label>Figure 4</label>
<caption>
<p>UCAV Swarm Artificial Neural Network</p>
</caption>
<graphic xlink:href="267.fig.004" />
</fig><p>The massage is transmitted in via UAVC, which is based on the Particle Swarm Algorithm, as a neural network from layer to layer. The drones are flying forward, looking for the track and sending signals to the other drones, telling them to organize their positions in line with the course, relay the location, and select which angles new drones should approach from. The forward position drone does this task by transmitting a message to the layer, following which the drone positions itself to avoid collision [
<xref ref-type="bibr" rid="R16">16</xref>].Figure <xref ref-type="fig" rid="fig5"> 5</xref> depicts the movement of the drone pattern.</p>
<fig id="fig5">
<label>Figure 5</label>
<caption>
<p>Movement of Drone pattern</p>
</caption>
<graphic xlink:href="267.fig.005" />
</fig><fig id="fig6">
<label>Figure 6</label>
<caption>
<p>3D modeling of UACV</p>
</caption>
<graphic xlink:href="267.fig.006" />
</fig></sec><sec id="sec3">
<title>Results of Proposed Model</title><p>To train elevation angel, PS position, and direction, the UCAV has a separate parameter. These characteristics are under our control, and they are utilized to plan the swarm's course. We have taken one input and output the sigmoid of that input to the output. The activation function is sigmoid, and the input is passed to the output. The neural network's performance is shown inFigure <xref ref-type="fig" rid="fig7"> 7</xref> andFigure <xref ref-type="fig" rid="fig8"> 8</xref> below. The train data graph regression is shown inFigure <xref ref-type="fig" rid="fig9"> 9</xref> below.</p>
<fig id="fig7">
<label>Figure 7</label>
<caption>
<p>Neural network Training state</p>
</caption>
<graphic xlink:href="267.fig.007" />
</fig><fig id="fig8">
<label>Figure 8</label>
<caption>
<p><b> </b>Neural network performance</p>
</caption>
<graphic xlink:href="267.fig.008" />
</fig><fig id="fig9">
<label>Figure 9</label>
<caption>
<p><b> </b>Neural network regression of trained data</p>
</caption>
<graphic xlink:href="267.fig.009" />
</fig></sec><sec id="sec4">
<title>Conclusions</title><p>First, we have an enhanced ABC algorithm, but the key issue with it is that if there is a location for one drone to pass another down, the algorithm does not have a method for passing through between two hazard regions. We employed the particle swarm technique to prevent colliding. Particle Swarm Network Algorithm is the term we came up with for it. The first drone communicates with others using an artificial neural network to warn them of a barrier in their route as well as the angle and altitude at which they should proceed in a line. The PSO algorithm generates ANN. The built intelligent route planning system solved the present system's path planning difficulty.</p>
<p></p>
<p><bold>Author Contributions:</bold> &#x26;#x0201c;Conceptualization, Sheharyar Khan; methodology; software; validation,; formal analysis; investigation; resources; data curation, Sheharyar Khan.; writing&#x26;#x02014;original draft preparation; writing&#x26;#x02014;review and editing, Sohrab. Khan; visualization, Sohrab Khan; supervision, Sheharyar Khan; project administration, Sheharyar Khan; funding acquisition. All authors have read and agreed to the published version of the manuscript.&#x26;#x0201d; Please turn to the Credit taxonomy for the term explanation. Authorship must be limited to those who have contributed substantially to the work reported.</p>
<p><bold>Data Availability Statement: </bold></p>
<p>Data can be provided on demand through the email:shksherry@gmail.com</p>
</sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      
<ref id="R1">
<label>[1]</label>
<mixed-citation publication-type="other">Air Vice Marshal R.A. Mason, "War in the Third Dimension" in Air Marshal Sir Michael Armitage, ed., Manned and Un-manned Aircraft (London: Brassey's Defence Publishers, 1986) p. 193.
</mixed-citation>
</ref>
<ref id="R2">
<label>[2]</label>
<mixed-citation publication-type="other">Application of Unmanned Combat Aerial Vehicles in Future Battles of the Subcontinent by C.N. Ghosh, Strategic Analysis: A Journal of the IDSA, July 2001 (Vol. XXV No. 4).
</mixed-citation>
</ref>
<ref id="R3">
<label>[3]</label>
<mixed-citation publication-type="other">Chenxi Huang, Yisha Lan, Yuchen Liu, Wen Zhou, Hongbin Pei, Longzhi Yang, Yongqiang Cheng, Yongtao Hao, and Yonghong Peng, A new dynamic path planning approach for unmanned aerial vehicles. Complexity, 2018.
</mixed-citation>
</ref>
<ref id="R4">
<label>[4]</label>
<mixed-citation publication-type="other">X. Peng and D. Xu, "Intelligent Online Path Planning for UAVs in Adversarial Environments," International Journal of Ad-vanced Robotic Systems, vol. 9, no. 1, p. 3, 2012.
</mixed-citation>
</ref>
<ref id="R5">
<label>[5]</label>
<mixed-citation publication-type="other">Melingui, R. Merzouki, J. B. Mbede, and T. Chettibi, "A novel approach to integrate artificial potential Feld and fuzzy logic into a common framework for robots autonomous navigation," Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, vol. 228, no. 10, pp. 787-801, 2014.
</mixed-citation>
</ref>
<ref id="R6">
<label>[6]</label>
<mixed-citation publication-type="other">H. Duan, Y. Zhang, and S. Liu, "Multiple UAVs/UGVs heterogeneous coordinated technique based on Receding Horizon Control (RHC) and velocity vector control," Science China Technological Sciences, vol. 54, no. 4, pp. 869-876, 2011.
</mixed-citation>
</ref>
<ref id="R7">
<label>[7]</label>
<mixed-citation publication-type="other">S. Zhai and T. Jiang, "A new sense-through-foliage target recognition method based on hybrid differential evolution and self-adaptive particle swarm optimization-based support vector machine," Neuro computing, vol. 149, pp. 573-584, 2015.
</mixed-citation>
</ref>
<ref id="R8">
<label>[8]</label>
<mixed-citation publication-type="other">B. Song, Z. Wang, and L. Zou, "On Global Smooth Path Planning for Mobile Robots using a Novel Multimodal Delayed PSO Algorithm," Cognitive Computation, vol. 9, no. 1, pp. 5-17, 2017.
</mixed-citation>
</ref>
<ref id="R9">
<label>[9]</label>
<mixed-citation publication-type="other">E. G. Tsardoulias, A. Iliakopoulou, A. Kargakos, and L. Petrou, "A Review of Global Path Planning Methods for Occupancy Grid Maps Regardless of Obstacle Density," Journal of Intelligent &#x00026; Robotic Systems, vol. 84, no. 1-4, pp. 829-858, 2016.
</mixed-citation>
</ref>
<ref id="R10">
<label>[10]</label>
<mixed-citation publication-type="other">Y. Liu, X. Zhang, X. Guan, and D. Delahaye, "Potential Odor Intensity Grid Based UAV Path Planning Algorithm with Parti-cle Swarm Optimization Approach," Mathematical Problems in Engineering, vol. 2016, 2016.
</mixed-citation>
</ref>
<ref id="R11">
<label>[11]</label>
<mixed-citation publication-type="other">M. Yao and M. Zhao, "Unmanned aerial vehicle dynamic path planning in an uncertain environment," Robotica, vol. 33, no. 3, pp. 611-621, 2015.
</mixed-citation>
</ref>
<ref id="R12">
<label>[12]</label>
<mixed-citation publication-type="other">M. G. Park and M. C. Lee, "A new technique to escape local minimum in artificial potential Feld based path planning," KSME International Journal, vol. 17, no. 12, pp. 1876-1885, 2003.
</mixed-citation>
</ref>
<ref id="R13">
<label>[13]</label>
<mixed-citation publication-type="other">N. Zeng, H. Zhang, W. Liu, J. Liang, and F. E. Alsaadi, "A switching delayed PSO optimized extreme learning machine for short-term load forecasting," Neuro computing, vol. 240, pp. 175- 182, 2017.
</mixed-citation>
</ref>
<ref id="R14">
<label>[14]</label>
<mixed-citation publication-type="other">J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan, USA, 2nd edition, 1975.
</mixed-citation>
</ref>
<ref id="R15">
<label>[15]</label>
<mixed-citation publication-type="other">X. Yuan, M. Elhoseny, H. K. El-Minir, and A. M. Raid, "A Genetic Algorithm-Based, Dynamic Clustering Method Towards Improved WSN Longevity," Journal of Network and Systems Management, vol. 25, no. 1, pp. 21-46, 2017.
</mixed-citation>
</ref>
<ref id="R16">
<label>[16]</label>
<mixed-citation publication-type="other">R. J. Szczerba, P. Galkowski, I. S. Glickstein, and N. Ternullo, "Robust algorithm for real-time route planning," IEEE Transac-tions on Aerospace and Electronic Systems, vol. 36, no. 3, pp. 869-878, 2000.
</mixed-citation>
</ref>
    </ref-list>
  </back>
</article>