Systems Engineering and Electronics

• CONTROL THEORY AND APPLICATION • Previous Articles     Next Articles

Random step maneuver algorithm with normally distributed starting times

Liguang Wang1 ,* and Lingling Wang2   

  1. 1. Information and Navigation College, Air Force Engineering University, Xi’an 710077, China; 2. Xi’an North Opto-electronic Science and Technology Defense Co. Ltd, Xi’an 710043, China
  • Online:2016-08-24 Published:2010-01-03


The random step maneuver with uniformly distri- buted starting times has the disadvantage that it cannot focus the starting time on the more ef ciency 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 lters 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.