Application of the Improved Grey Wolf Algorithm in Spacecraft Maneuvering Path Planning

Pseudocode 2

Pseudocode of the cross-mutation grey wolf algorithm.

Initialize the grey wolf population

Initialize a, A and C

Calculate the fitness of each search agent

population[t] = initialize Population (population Size)

evaluate Population(population[t]

=the best search agent

=the second-best search agent

=the third best search agent

while (t < Max number of iterations)

  for each search agent

    Update the position of the current search agent by equation

  end for

  population[t+1] = crossover(population[t])

  population[t+1] = mutate(population[t+1])

  evaluate Population(population[t])

  Update a, A, and C

  Calculate the fitness of all search agents

  Update ,,and

  t=t+1

  end while

  return