Table 12 Results of Wilcoxon rank sum test of path lengths of feasible paths obtained by each algorithm in the three different environments.

From: A UAV path planning method based on the framework of multi-objective jellyfish search algorithm

The number of objective functions

Scenario

Algorithm

    

NSGAII

NSGAIII

MOPSO

MOGNDO

MOJS

M = 2

Scenario 1

6.75E-08 +

6.75E-08 +

1.19E-05 +

1.19E-06 +

6.79E-08 +

Scenario 2

2.79E-02 +

2.45E-05 +

6.03E-06 +

5.70E-03 +

6.03E-06 +

Scenario 3

2.93E-04 +

7.70E-04 +

7.99E-09 +

1.20E-04 +

7.99E-09 +

M = 3

Scenario 1

6.79E-08 +

6.79E-08 +

6.79E-08 +

6.79E-08 +

1.60E-05 +

Scenario 2

7.71E-04 +

2.20E-03 +

2.78E-07 +

6.25E-07 +

7.10E-03 +

Scenario 3

6.79E-08 +

6.79E-08 +

1.60E-04 +

6.79E-08 +

1.60E-04 +

+/-/=

6/0/0

6/0/0

6/0/0

6/0/0

6/0/0