Random step maneuver algorithm with normally distributed starting times

The random step maneuver with uniformly distributed starting times has the disadvantage that it cannot focus the starting time on the more efficiency time. It decreases the penetration probability. To resolve this problem, a random step penetration algorithm with normal distribution starting time is proposed. Using the shaping filters and adjoint system method, the miss distance with different starting times can be acquired. According to the penetration standard, the time window ensuring successful penetration can be calculated and it is used as the 3σ bound of the normally distributed random maneuver. Simulation results indicate that the normally distributed random maneuver has higher penetration probability than the uniformly distributed random maneuver.