# US 2017/0254664 A1 · 4d temporal data structures for visualization of alternative mission plans over time

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0254664 A1
- Document ID: US20170254664A1
- Status: Published application
- Kind: A1
- Application number: 15/059,953
- Filed: 2016-03-03
- Published: 2017-09-07
- Earliest claimed: 2016-03-03
- Assignees: Northrop Grumman Systems Corporation
- Inventors: DEVANG R. PAREKH; FENG CAO; HENRY H. FUNG; LOUIS ODDO; WILLIAM PARSONS; MITESHKUMAR K. PATEL
- Web page: https://patentgrep.com/patent/US20170254664A1

## CPC

- G01C 21/20: Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence)
- G08G 5/21: located onboard the aircraft
- G08G 5/34: for flight plan modification
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

A non-transitory computer readable medium having computer executable instructions stored thereon is provided. The computer executable instructions include a mission definition file (MDF) that includes mission data that describes alternative routes generated by at least one mission planner for a vehicle. An MDF parser extracts the mission data for the alternative routes from the MDF and maps the mission data into a temporal data structure describing the alternative routes. The temporal data includes a route list to describe the alternative routes for the vehicle and a route segment list to describe an estimated time between each of the waypoints for each segment of the route list. A waypoint list describes a latitude, a longitude, and an altitude for each of the waypoints and a mission plan constructor generates a network topology of a mission plan depicting the alternative routes for the vehicle over time.

## Claims

### Claim 1

A non-transitory computer readable medium having computer executable instructions stored thereon, the computer executable instructions comprising:
a mission definition file (MDF) that includes mission data that describes alternative routes generated by at least one mission planner for a vehicle;
an MDF parser to extract the mission data for the alternative routes from the mission definition file, the MDF parser maps the mission data into a temporal data structure describing the alternative routes;
the temporal data structure comprising:
a route list to describe the alternative routes for the vehicle, each alternative route defined by at least one segment to connect between waypoints;
a route segment list to describe an estimated time between each of the waypoints for each segment of the route list; and
a waypoint list to describe a latitude, a longitude, and an altitude for each of the waypoints for each segment of the route list; and
a mission plan constructor to generate a network topology of a mission plan depicting the alternative routes for the vehicle over time by graphing list data from the temporal data structure for the alternative routes.

### Claim 2 (depends on 1)

The computer readable medium of claim 1, the alternative routes include at least one alternative route identified as a primary route for a manned or unmanned vehicle.

### Claim 3 (depends on 1)

The computer readable medium of claim 1, wherein the route segment list further comprises a list of segments with each segment defined as two waypoints, each of the two waypoints having an estimated time of arrival field to denote the estimated time elapsed to travel between the two waypoints.

### Claim 4 (depends on 1)

The computer readable medium of claim 1, the temporal data structure further comprising a route leg list to specify portions of the network topology that represent specific activities of a mission plan that an operator wants to place additional attention toward or to perform additional analysis thereof.

### Claim 5 (depends on 1)

The computer readable medium of claim 1, the temporal data structure further comprising a route activities list that specifies vehicle actions that are planned to take place along each segment of the respective alternative route.

### Claim 6 (depends on 1)

The computer readable medium of claim 1, the temporal data structure further comprising a route action point list that specifies a delta time (DT), a time constraint (TC), a time specification (TS), an action command (CMD), or data (DATA) needed to execute a command (CMD) for a vehicle operating according to the network topology.

### Claim 7 (depends on 6)

The computer readable medium of claim 6, the temporal data structure further comprising an action point data list to specify additional data required to describe a specified activity in the action point list.

### Claim 8 (depends on 6)

The computer readable medium of claim 6, further comprising a state aggregator to update data feeds supplying at least one vehicle model and at least one environmental model to update data in the temporal data structure in real time, the data feeds include at least one of a tasking feed, a mission plan feed, a weather feed, a threat feed, a sensor feed, a tracks feed, and a communications feed.

### Claim 9 (depends on 8)

The computer readable medium of claim 8, further comprising a prediction engine to project the data feeds from the state aggregator and temporal data structure into a future visualization of the alternative routes.

### Claim 10 (depends on 1)

The computer readable medium of claim 1, further comprising a graphical user interface (GUI) to display a visualization of the network topology.

### Claim 11 (depends on 1)

The computer readable medium of claim 1, the GUI further comprising a time input to adjust the temporal data structure to specify time projections of the alternative routes over time.

### Claim 12

A system, comprising:
a memory to store computer-executable instructions; and
a processor to execute the computer-executable instructions from the memory, the computer-executable instructions comprising:
a mission definition file (MDF) that includes mission data that describes alternative routes generated by at least one mission planner for a vehicle;
an MDF parser to extract the mission data for the alternative routes from the mission definition file, the MDF parser maps the mission data into a temporal data structure describing the alternative routes;
the temporal data structure comprising:
a route list to describe the alternative routes for the vehicle, each alternative route defined by at least one segment to connect between waypoints;
a route segment list to describe an estimated time between each of the waypoints for each segment of the route list; and
a waypoint list to describe a latitude, a longitude, and an altitude for each of the waypoints for each segment of the route list; and
a mission plan constructor to generate a network topology of a mission plan depicting the alternative routes for the vehicle over time by graphing list data from the temporal data structure for the alternative routes.
a graphical user interface (GUI) to display a visualization of the network topology generated by the mission plan constructor from the temporal data structure, wherein the alternative routes can be viewed concurrently in the visualization to enable determination of what-if alternative mission plan scenarios for the one or more vehicles.

### Claim 13 (depends on 12)

The system of claim 12, the GUI further comprising a time input to adjust the temporal data structure to specify time projections of the alternative routes over time.

### Claim 14 (depends on 12)

The system of claim 12, further comprising a replay analyzer to replay missions from saved temporal data structures after completion of a given mission, wherein the replay analyzer generates visualizations from the saved temporal data structures to enable simulated analysis of alternative routes that were not executed during the given mission.

### Claim 15 (depends on 12)

The system of claim 12, wherein the route segment list further comprises a list of segments with each segment defined as two waypoints, each of the two waypoints having an estimated time of arrival field to denote the estimated time elapsed to travel between the two waypoints.

### Claim 16 (depends on 12)

The system of claim 12, the temporal data structure further comprising a route leg list to specify portions of the network topology that represent specific activities of a mission plan that an operator wants to place additional attention toward or to perform additional analysis thereof.

### Claim 17 (depends on 12)

The system of claim 12, the temporal data structure further comprising a route activities list that specifies vehicle actions that are planned to take place along each segment of the respective alternative route.

### Claim 18 (depends on 12)

The system of claim 12, the temporal data structure further comprising a route action point list that specifies a delta time (DT), a time constraint (TC), a time specification (TS), an action command (CMD), or data (DATA) needed to execute a command (CMD) for a vehicle operating according to the network topology.

### Claim 19

A method, comprising:
parsing a mission data file into an initial temporal data structure establishing a mission network structure;
extrapolating estimated segment transition times for each segment of the mission network structure;
extracting task timing constraints from input tasking to populate an action list;
extracting specified task constraints to populate an action point data list; and
outputting the temporal data structure after populating the lists, the temporal data structure comprising:
the action list and the action data point list;
a route list to describe alternative routes for the vehicle, each alternative route defined by at least one segment to connect between waypoints;
a route segment list to describe an estimated time between each of the waypoints for each segment of the route list; and
a waypoint list to describe a latitude, a longitude, and an altitude for each of the waypoints for each segment of the route list.

### Claim 20 (depends on 19)

The method of claim 19, further comprising updating the route segment list to include a list of segments with each segment defined as two waypoints, each of the two waypoints having an estimated time of arrival field to denote the estimated time elapsed to travel between the two waypoints.
