FLIGHT PATH SEARCH DEVICE AND FLIGHT PATH SEARCH PROGRAM

• US 20160210865A1
• Filed: 12/15/2015
• Published: 07/21/2016
• Est. Priority Date: 01/16/2015
• Status: Active Grant

• Current Assignee: Subaru Corp.
• Original Assignee: Fuji Heavy Industries Limited (Subaru Corp.)
• Inventors: MIZUTANI, Takuma, YANASE, Yasuhiko
• Granted Patent: US 9,711,052 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/20 Instruments for performing navigational calculations G01C21/24, G01C21/26 take precedence
• CPC Class Codes: G01C 21/3881 Tile-based structures
• CPC Class Codes: G08G 5/0034 Assembly of a flight plan

Abstract

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.

Claims

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, and

the updating of the first cell by the updater,

are repeated until the optimal cell found by the searcher agrees with the second cell.

2. The flight path search device according to claim 1, wherein

the score calculator calculates the score for each of the adjacent cells adjacent to the first cell, each time the updater updates the first cell, and

the searcher searches for the optimal cell based on the scores of each of the adjacent cells calculated by the score calculator.

3. The flight path search device according to claim 1, wherein

the score calculator calculates the score relating to attack avoidance degree of the each of the cells, based on both a score relating to distance between the first cell and the each of cells, and a score relating to a degree of threat of enemy forces present at the enemy forces point, and

the score relating to the degree of threat of enemy forces is calculated based on both a score relating to distance between the enemy forces and the each of the cells, and a score relating to geographical features of the each of the cells from the perspective of avoiding attack.

4. The flight path search device according to claim 2, wherein

the score calculator calculates the score relating to attack avoidance degree of the each of the cells, based on both a score relating to distance between the first cell and the each of cells, and a score relating to a degree of threat of enemy forces present at the enemy forces point, and

the score relating to the degree of threat of enemy forces is calculated based on both a score relating to distance between the enemy forces and the each of the cells, and a score relating to geographical features of the each of the cells from the perspective of avoiding attack.

5. A flight path search program 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 program causing a computer, including storage that stores map information of a predetermined range and enemy force range information, to perform:

a grid dividing function of dividing the map information stored in the storage, into cells in grid form on a horizontal plane;

a score calculating function of calculating 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 calculating function of calculating 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 searching function of searching 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 calculating function; and

an updating function of updating the first cell by setting the optimal cell as a new first cell, in a case where the optimal cell found by the searching function does not agree with the second cell,

wherein the cell where the predetermined point is situated is set as the first point, and

the calculating of the second cell by the cell calculating function,

the searching for the optimal cell by the searching function using the second cell, and

the updating of the first cell by the updating function,

are repeated until the optimal cell found by the searching function agrees with the second cell.