# US 11,443,221 B2 · Distributed incorruptible accordant management of nonlocal data fusion, unified scheduling and engage-ability

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

- Number: US 11,443,221 B2
- Document ID: US11443221B2
- Status: Granted
- Kind: B2
- Application number: 16/523,792
- Filed: 2019-07-26
- Published: 2021-01-28
- Granted: 2022-09-13
- Earliest claimed: 2019-07-26
- Assignees: Lockheed Martin Corporation
- Applicants: Lockheed Martin Corporation
- Inventors: Mauro Joseph Sanchirico; Ryan Ceresani
- Web page: https://patentgrep.com/patent/US11443221B2

## CPC

- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06F 18/25: Fusion techniques
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 63/123: {received data contents, e.g. message integrity}
- H04W 4/70: Services for machine-to-machine communication [M2M] or machine type communication [MTC]
- H04W 12/009: {specially adapted for networks, e.g. wireless sensor networks, ad-hoc networks, RFID networks or cloud networks}
- G06N 20/00: Machine learning
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2463/121: Timestamp
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A system and method that uses scheduling problems as proof of work in a blockchain system, and that evaluate schedules based on a physics model and a timeline. The system and method can maintain a secured chain of linked messages that include object states and schedule portions. Processing circuitry can receive a message related to an updated state of an object, determine whether the updated state of the object should be linked into the secured chain of linked messages, determine a portion of a schedule for addressing the object based on the updated state of the object as proof of work, create a new message that links the updated state of the object into the secured chain to form an updated chain of linked object state messages and that includes the determined portion of the schedule, and broadcast the new message as the secured chain of linked messages.

## Claims

### Claim 1

A system comprising:
a computing system, having one or more processors coupled with memory, configured to:
maintain a secured chain of linked messages for an object, each message of the linked messages including: (i) a respective state of a plurality of states for the object, and (ii) and a respective portion of a schedule, the schedule defining a timeline for the plurality of states for the object;
receive a first message to update a state of an object in the secured chain of linked messages;
determine to link the updated state with the secured chain of linked messages;
determine, responsive to the determination to link the updated stated with the secured chain of linked messages, as proof of work, a portion of the schedule for the updated state of the object based on the updated state of the object and the timeline of the schedule for the plurality of states for the object in the linked messages in the secured chain of linked messages;
create a second message including (i) the updated state of the object and (ii) the determined portion of the schedule to link to the secured chain of linked messages;
determine the portion of the schedule by evaluating a cost function beginning at an arbitrary start point;
evaluate the cost function by finding a set of times that result in a cost below a threshold cost;
encode the determined portion of the schedule;
create the second message including the encoded portion of the schedule as the proof of work; and
broadcast the second message as the secured chain of linked messages.

### Claim 2 (depends on 1)

The system of claim 1, wherein the computing system is further configured to:
determine to link the updated state of the object with the secured chain of linked messages by checking a length of a hash of the received first message; and
validate the proof of work by checking the determined portion of the schedule against a physics model of a physical object corresponding to the object using an error metric.

### Claim 3 (depends on 2)

The system of claim 2, wherein the computing system is further configured to:
evaluate a plurality of the validated schedule portions against a predefined activation function of weighted schedule parameters.

### Claim 4 (depends on 1)

The system of claim 1, wherein the computing system is further configured to:
create the second message by determining a hash of the message and a previous message.

### Claim 5 (depends on 1)

The system of claim 1, wherein the computing system is further configured to:
encrypt the second message.

### Claim 6 (depends on 1)

The system of claim 1, wherein the computing system is further configured to:
determine the portion of the schedule beginning at the arbitrary start point by:
obtaining a list of initial schedules;
randomly selecting an initial schedule from the list of initial schedules;
and
perturbing parameters of the selected initial schedule until a local minimum of the cost function is reached.

### Claim 7 (depends on 1)

The system of claim 1, wherein the computing system is further configured to:
evaluate the cost function, which for given target states and engagement platform states, finds laser weapon start and stop times and missile intercept times that result in the cost below the threshold cost.

### Claim 8 (depends on 1)

The system of claim 1, wherein the respective state of the object includes target state measurements and data fusion results from non-collocated sensors, and
wherein the computing system receives the first message that includes a hash of linked previous messages in the secured chain of linked messages containing the target state measurements and the data fusion results and the determined schedule portion.

### Claim 9

A method comprising:
maintaining, by a computing system, a secured chain of linked messages for an object, each message of the linked messages including: (i) a respective state of a plurality of states for the object, and (ii) and a respective portion of a schedule, the schedule defining a timeline for the plurality of states for the object;
receiving, by the computing system, a first message to update a state of an object in the secured chain of linked messages;
determining, by the computing system, to link the updated state of the object should be linked into the secured chain of linked messages;
determining, by the computing system, responsive to determining to link the updated stated with the secured chain of linked messages, as proof of work, a portion of the schedule for the updated state of the object based on the updated state of the object and the timeline of the schedule for the plurality of states for the object in the linked messages in the secured chain of linked messages, wherein the determining the portion of the schedule includes evaluating a cost function beginning at an arbitrary start point, and wherein the evaluating of the cost function includes finding a set of times that result in a cost below a threshold cost;
encoding, by the computing system, the determined portion of the schedule;
creating, by the computing system, a second message including (i) the updated state of the object and (ii) the encoded portion of the schedule as the proof of work to link to the secured chain of linked messages; and
broadcasting, by the computing system, the second message as the secured chain of linked messages.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
determining, by the computing system, to link the updated state of the object with the secured chain of linked messages by checking a length of a hash of the received first message, and
validating, by the computing system, the proof of work by checking the determined portion of the schedule against a physics model of a physical object corresponding to the object using an error metric.

### Claim 11 (depends on 10)

The method of claim 10, further comprising evaluating, by the computing system, a plurality of the validated schedule portions against a predefined activation function of weighted schedule parameters.

### Claim 12 (depends on 9)

The method of claim 9, wherein the creating the second message includes determining a hash of the message and a previous message.

### Claim 13 (depends on 9)

The method of claim 9, further comprising:
encrypting, by the computing system, the second message.

### Claim 14 (depends on 9)

The method of claim 9, wherein the determining the portion of the schedule beginning at the arbitrary start point is by:
obtaining a list of initial schedules;
randomly selecting an initial schedule from the list of initial schedules; and
perturbing parameters of the selected initial schedule until a local minimum of the cost function is reached.

### Claim 15 (depends on 9)

The method of claim 9, further comprising evaluating, by the computing system, the cost function, which for given target states and engagement platform states, finds laser weapon start and stop times and missile intercept times that result in the cost below the threshold cost.

### Claim 16 (depends on 9)

The method of claim 9, wherein the respective state of the object includes target state measurements and data fusion results from non-collocated sensors, and
wherein the receiving the first message related to updated state of the object includes receiving a hash of linked previous messages in the secured chain of linked messages containing the target state measurements and the data fusion results and the determined schedule portion.