Route planning system and method for minimizing exposure to threats

• US 10,288,438 B2
• Filed: 01/12/2016
• Issued: 05/14/2019
• Est. Priority Date: 11/08/2011
• Status: Active Grant

• Current Assignee: Saab AB
• Original Assignee: Saab AB
• Inventors: Andersson, Ingmar, Brege, Magnus
• Primary Examiner(s): Hutchinson, Alan D
• Application Number:
  US14/993,876
• Publication Number:
  US 20160123751A1
• Time in Patent Office: 1,218 Days
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: G01C 21/3415 Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents
• CPC Class Codes: G01C 21/3461 Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries

Abstract

The present invention relates to a system and method for route planning. The system is arranged to be mounted on a moving object. The system comprises a route planning module arranged to plan a route of the object upon request, wherein occasions of being visible from any point in the map within a shooting range during a predetermined time period is minimized. The system is characterized in that the route planning module is arranged to determine areas in the 3D map in which the object will be exposed to a potential threat during a predetermined time period based on line of sight calculations, and determining a re-planned route avoiding said potential threat areas.

Claims

1. System for route planning configured to be mounted on a moving object, said system comprising:

a three-dimensional (3D) map; and

a route planning module configured to;

re-plan at least one route of the moving object upon request;

determine a plurality of available routes based on identified threat areas and for each determined available route;

(a) performing line of sight calculations in the 3D map to find positions or zones from which the moving object is visible during a predetermined time period, the predetermined time period being long enough to perform aiming and firing at the moving object;

(b) determining and identifying one or more potential threat areas in the 3D map based on the line of sight calculations in the 3D map, wherein in each potential threat area the moving object is exposed to a potential threat from any of said positions or zones; and

(c) associating a cost with the route based on the corresponding at least one potential threat; and

automatically or manually select one of the plurality of available routes as the re-planned route based on the cost associated to each of the plurality of available routes.

2. System according to claim 1, wherein each potential threat area is at least one of a point or an area or a volume.

3. System according to claim 1, wherein the route planning module is further configured to:

determine safe areas in the 3D map in which the moving object will be visible from a safe location in the 3D map during the predetermined time while also not being exposed to the at least one potential threat during the predetermined time period from the safe location in the 3D map; and

determine the re-planned route further based on said safe areas.

4. System according to claim 1, wherein the moving object is a ground based object.

5. System according to claim 1, wherein the moving object is a vehicle.

6. System according to claim 1, wherein the route planning module is configured to re-plan the route based on the extent of a firing area and based on the 3D map data.

7. The system of claim 1, wherein to determine a re-planned route, the route planning module is configured to identify a destination for the re-planned route.

8. The system of claim 7, wherein the destination for the re-planned route is different from a planned destination of the planned route.

9. A computer-implemented method for re-route planning for an object moving according to a route to a planned destination, said method comprising the steps of:

retrieving, from one or more databases, data associated with a three-dimensional (3D) map;

determining a plurality of available routes based on identified threat areas and for each determined available route;

(a) performing, via one or more processing units, line of sight calculations in the 3D map to find positions or zones from which the moving object is visible during a predetermined time period, the predetermined time period being long enough to perform aiming and firing at the moving object;

(b) determining and identifying, via the one or more processing units, one or more potential threat areas in the 3D map based on the line of sight calculations in the 3D map, wherein in each potential threat area the moving object is exposed to a potential threat from any of said positions or zones; and

(c) associating a cost with the route based on the corresponding at least one potential threat; and

automatically or manually selecting one of the plurality of available routes as the re-planned route based on the cost associated to each of the plurality of available routes.

10. The computer-implemented method according to claim 9, wherein the calculation of the re-planned route comprises:

determining, via the one or more processing units, safe areas in the 3D map in which the moving object will be visible from a safe location in the 3D map during the predetermined time while also not being exposed to the at least one potential threat during the predetermined time period from the safe location in the 3D map; and

determining, via the one or more processing units, a re-planned route further based on said safe areas.

11. The computer-implemented method according to claim 9, wherein the re-route planning is based on terrain constraints that may prevent the moving object from moving unhindered.

12. The computer-implemented method according to claim 11, wherein the terrain constraints comprise at least one of hills, rivers, forests, or other obstacles.

13. The computer-implemented method according to claim 9, wherein the re-planned route is calculated based on time constraints.

14. A computer program product for re-route planning for an object moving according to a route to a planned destination, the computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising at least one executable portion configured for:

re-planning at least one route of the moving object upon request;

determining a plurality of available routes based on identified threat areas and for each determined available route;

(a) performing, via one or more processing units, line of sight calculations in a three-dimensional (3D) map to find positions or zones from which the moving object is visible during a predetermined time period, the predetermined time period being long enough to perform aiming and firing at the moving object;

(b) determining and identifying, via the one or more processing units, one or more potential threat areas in the 3D map based on the line of sight calculations in the 3D map, wherein in each potential threat area the moving object is exposed to a potential threat from any of said positions or zones; and

(c) associating a cost with the route based on the corresponding at least one potential threat; and

automatically or manually selecting one of the plurality of available routes as the re-planned route based on the cost associated to each of the plurality of available routes.