A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left"> </td><td align="center">Basic CS</td><td align="center">Improved CS</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">Mean</td><td align="center">193.1960</td><td align="center">165.5124</td></tr><tr><td align="left">Std</td><td align="center">34.9554</td><td align="center">25.0811</td></tr><tr><td align="left">Best</td><td align="center">127.1038</td><td align="center">105.1268</td></tr><tr><td align="left">Worst</td><td align="center">282.3626</td><td align="center">207.9992</td></tr><tr><td align="left">Time (sec)</td><td align="center">75.6491</td><td align="center">26.1248</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Shortest length comparison between the basic CS and the improved CS in UCAV three-dimension path planning problem. The numbers shown are the results found after 100 Monte Carlo simulations of each algorithm.

The Scientific World Journal

tab1

Table 1

Table 1: A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning 