| 摘要 |
In a flight path search device, storage stores map information and enemy force range information. A grid divider divides the map information into cells in grid form. A score calculator calculates, for each cell, a score about an attack avoidance degree. A cell calculator calculates a second cell that is on an extension of a line connecting the enemy forces point and a first cell within the enemy region and is outside the enemy region. A searcher searches for an optimal cell to which to move from the first cell when moving toward the second cell, based on the calculated score. An updater updates the first cell when the optimal cell disagrees with the second cell. The cell of the predetermined point is set as the first cell, and the process is repeated until the optimal cell agrees with the second cell. |
| 主权项 |
1. A flight path search device that searches for a flight path of an aircraft, from outside of an enemy region including an enemy forces point to a predetermined point within the enemy region, the flight path search device comprising:
storage that stores map information of a predetermined range, and enemy force range information; a grid divider that divides the map information stored in the storage, into cells in grid form on a horizontal plane; a score calculator that calculates a score relating to an attack avoidance degree, for each of the cells, based on the map information and enemy force range information stored in the storage; a cell calculator that calculates a second cell that is situated on an extension of a straight line connecting the enemy forces point and a first cell within the enemy region, on the map information, and is situated outside of the enemy region, the extension extending towards the first cell; a searcher that searches for, among adjacent cells adjacent to the first cell on the map information, an optimal cell to which to move from the first cell when moving from the first cell toward the second cell, based on the score calculated by the score calculator; and an updater that updates the first cell by setting the optimal cell as a new first cell, in a case where the optimal cell found by the searcher does not agree with the second cell, wherein the cell where the predetermined point is situated is set as the first cell, and
the calculating of the second cell by the cell calculator,the searching for the optimal cell by the searcher using the second cell, andthe updating of the first cell by the updater, are repeated until the optimal cell found by the searcher agrees with the second cell. |
