Sequence and Direction Planning of Multiobjective Attack in Virtual Navigation Based on Variable Granularity Optimization Method

Algorithm 1

Input: () Targets’ attributes, including the targets’ number , the coordinate , the velocity and the attack area

; () Our flight fighters’ attributes, including the number of our fighters , the angle to decide the number of tactical

navigation points, the coordinate , and the results space ; () A result space expanding policy to optimize

the result.

Suppose Condition: () The targets stay flying in a stable velocity and an unchanged direction; () The tactical points’

formation should obey the constraints .

Output: () The global optimal fitness result ; () Best tactical points formation .

Initialize: random , set the initial state

Begin

 For each iteration   // is the iteration number.

  Cross // executing the cross process towards the setting codes.

   If   do not obey the constraints

    While  ( obey the constraints )

     Random   // make sure that all the elements in obey the constraints.

    end

     Update  ()

   end

     Calculating  ()

      If    Then

      // executing the variation process towards the setting codes.

   Cycling the process as  Cross  method.

   Executing  () // the saving policy is used to expand the result space to optimize the final result.

 End

      Return  , ,

End