FLIGHT ROUTE RETRIEVAL DEVICE AND FLIGHT ROUTE RETRIEVAL PROGRAM

PROBLEM TO BE SOLVED: To retrieve an optimal flight route upon entering into an enemy effectiveness zone.SOLUTION: In an aircraft 10, a storage section 15 is configured to store map data 155, and enemy force range information, and a control section 18 is configured to: divide the map data 155 into a plurality of cells C; calculate the number of points P about an attack avoidance level of each cell C; calculate a destination cell Cg other than an enemy effective zone ADU on a straight line connecting an attack target point TP to a current point cell Cp; retrieve an optimal cell C to be moved from the current point cell Cp on the basis of the number of points P when heading for the destination cell Cg from the current point Cp of adjacent cells C adjacent to the current point cell Cp; and update the current point cell Cp to the optimal cell C when the optimal cell C does not match the destination cell Cg. Further, the control section 18 is configured to repeat the calculation of the destination cell Cg, retrieval of the optimal cell C, and update of the current point cell Cp until the optimal cell C matches the destination cell Cg in this case, as regarding a flying point HA as an initial current point cell Cp.SELECTED DRAWING: Figure 4 【課題】敵効力圏内へ進入する際の最適な飛行経路を探索する。【解決手段】航空機１０では、記憶部１５が地図データ１５５と敵勢力範囲情報を記憶し、制御部１８が、地図データ１５５を複数のセルＣに分割し、各セルＣの攻撃回避度合いに関する点数Ｐを算出し、攻撃目標地点ＴＰと現在地セルＣｐとを結ぶ直線上で敵効力圏ＡＤＵ外の目的地セルＣｇを算出し、現在地セルＣｐに隣接するセルＣのうち現在地セルＣｐから目的地セルＣｇに向かうときに現在地セルＣｐから移動すべき最適なセルＣを点数Ｐに基づいて探索し、最適なセルＣが目的地セルＣｇと一致しない場合に現在地セルＣｐを最適なセルＣに更新する。また制御部１８は、目的地セルＣｇの算出と、最適なセルＣの探索と、現在地セルＣｐの更新とを、滞空地点ＨＡを最初の現在地セルＣｐとしつつ、最適なセルＣがそのときの目的地セルＣｇと一致するまで繰り返す。【選択図】図４