Abstract: Based on A^* heuristics search algorithms, two efficacious real-time methods for combat mission were presented. By instead of direct distance with fold distance, the expanded number could decrease and the searching rate could speed up. Adding virtual threats, the limits of minimize turning radius and entering direction could satisfy. Form flight speed and arriving time of the plane could get the largest distance to the target. In the process of expanding, cutting branch with the largest distance could meet the needs of the flight speed and arriving time. The presented algorithms ensure the survivability of penetrate threat reach the maximization. The simulation results show that the efficiency of the algorithms is rationality.