| 摘要 |
PROBLEM TO BE SOLVED: To search for the optimum flight route for fighter aircraft.SOLUTION: In a fighter aircraft 10, a memory unit 15 stores map data 155 in a prescribed range and information on the enemy's sphere of influence, a control unit 18 divides the map data 155 into a plurality of grids M and so forth on within a horizontal plane, figures out a point count P concerning the attack avoiding degree of each of the plurality of grids M and so forth on the basis of the map data 155 and the information on the enemy's sphere of influence, and searches for the optimum flight route Rfrom a task starting position FARP to a fighting position FP on the basis of the calculated point counts P of the plurality of grids M and so forth. |
