IP Library Granted Patent US 12,443,999
Granted Patent B2
US 12,443,999 · App. 17/360,007 · Granted Oct 14, 2025

System and method for model-based prediction using a distributed computational graph workflow

Inventors: Jason Crabtree (Vienna, VA); Andrew Sellers (Monument, CO)
Assignee: QOMPLX LLC
G06Q40/08G06N7/01G06Q30/0201G06Q50/01
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,443,999
App. No.
17/360,007
Granted
Oct 14, 2025
Kind
B2
Abstract

A system and method for crowdsensing-based determination of risk management and contract validation, comprising at least a heterogeneous mixture of sensors and data-gathering techniques, a sensor fusion suite, and a business operating system, which ingests, transforms if necessary, and analyzes received data and develops and applies models of prediction of consequences of the sensor data and future events based on such data for purposes such as insurance liability and risk assessment, emergency services planning, and financial market predictions, and comparing historical models and data with current data and models to attempt to refine and utilize a more precise predictive model for these purposes.

Claims (44)

1. A system for model-based prediction using a distributed computational graph workflow, comprising:

a computing system comprising at least one memory, at least one processor, and at least one non-volatile data storage device; and

a plurality of network-connected physical sensors;

wherein the at least one memory comprises a first plurality of programming instructions stored in the at least one memory and operating on the at least one processor, wherein the first plurality of programming instructions, when operating on the at least one processor, causes the computing system to:

automatically gather telematics data from the plurality of network-connected physical sensors;

record the telematics data and time of receipt in a multidimensional time-series database stored on the at least one non-volatile data storage device;

retrieve a prediction model from the non-volatile data storage device for prediction of a probability of a future event from the received data;

send the telematics data and the prediction model to a distributed computational graph for processing;

receive processed data from the distributed computational graph;

predict the probability of a future event from the processed data;

determine a premium for an insurance product based on at least the predicted probability of the future event;

generate a specific remedial action based on the predicted probability of the future event, wherein the specific remedial action comprises a recommended operational adjustment for communication to an insured party to reduce the probability of the future event;

transmit the specific remedial action to a notification device associated with the insured party;

after transmission of the specific remedial action to the notification device:

automatically gather updated telematics data from the plurality of network-connected physical sensors;

analyze the updated telematics data to determine whether the recommended operational adjustment was implemented by the insured party; and

determine a new premium for an insurance product based on whether the recommended operational adjustment was implemented, as indicated by the updated telematics data; and

wherein the at least one memory further comprises a second plurality of programming instructions stored in the at least one memory and operating on the at least one processor, wherein the second plurality of programming instructions, when operating on the at least one processor, causes the computing system to:

receive the prediction model for processing;

construct the distributed computational graph from the prediction model using the at least one processor, the distributed computational graph representing a data processing workflow and comprising a directed graph with nodes representing data transformations and edges representing messaging between the nodes;

receive the telematics data; and

process the telematics data according to the data processing workflow represented by the distributed computational graph.

2. The system of claim 1 , wherein the first plurality of programming instructions further causes the computing system to further ingest data from a network-enabled financial market crawler that automatically gathers data from financial markets including stock prices and trades.

3. The system of claim 1 , wherein the first plurality of programming instructions further causes the computing system to further ingest data from manual data entry, including human observers during a natural disaster entering data over a network.

4. The system of claim 1 , wherein the first plurality of programming instructions further causes the computing system to further ingest data from network connected cameras, including either or all of video, audio, and image data.

5. The system of claim 1 , wherein the first plurality of programming instructions further causes the computing system to use machine learning techniques to construct one or more predictive models of received data.

6. A method for model-based prediction using a distributed computational graph workflow, comprising the steps of:

automatically gathering telematics data from a network-connected physical sensor;

recording the telematics data and time of receipt in a multidimensional time-series database stored on a non-volatile data storage device;

retrieving a prediction model from the non-volatile data storage device for prediction of a probability of a future event from the received data;

constructing a distributed computational graph from the retrieved prediction model, the distributed computational graph representing a data processing workflow and comprising a directed graph with nodes representing data transformations and edges representing messaging between the nodes;

processing the telematics data according to the data processing workflow represented by the distributed computational graph;

predicting the probability of a future event from the processed data;

determining a premium for an insurance product based on at least the predicted probability of the future event;

generating a specific remedial action based on the predicted probability of the future event, wherein the specific remedial action comprises a recommended operational adjustment for communication to an insured party to reduce the probability of the future event;

transmitting the specific remedial action to a notification device associated with the insured party; and

after transmission of the specific remedial action to the notification device:

automatically gathering updated telematics data from the plurality of network-connected physical sensors;

analyzing the updated telematics data to determine whether the recommended operational adjustment was implemented by the insured party; and

determining a new premium for an insurance product based on whether the recommended operational adjustment was implemented, as indicated by the updated telematics data.

7. The method of claim 6 , further comprising the step of ingesting data from a network-enabled financial market crawler that automatically gathers data from financial markets including stock prices and trades.

8. The method of claim 6 , further comprising the step of ingesting data from manual data entry, including human observers during a natural disaster entering data over a network.

9. The method of claim 6 , further comprising the step of ingesting data from network connected cameras, including either or all of video, audio, and image data.

10. The method of claim 6 , further comprising the step of using machine learning techniques to construct one or more predictive models of received data.

Assignments (5)
CHANGE OF ADDRESS Recorded Oct 1, 2024
From: QOMPLX LLC
To: QOMPLX LLC
Reel/Frame 069083/0279 →
CHANGE OF NAME Recorded Sep 27, 2023
From: QPX LLC
To: QOMPLX LLC
Reel/Frame 065036/0449 →
CORRECTIVE ASSIGNMENT TO CORRECT THE RECEIVING PARTY PREVIOUSLY RECORDED AT REEL: 064674 FRAME: 0408. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Sep 20, 2023
From: QOMPLX, INC.
To: QPX LLC
Reel/Frame 064966/0863 →
PATENT ASSIGNMENT AGREEMENT TO ASSET PURCHASE AGREEMENT Recorded Aug 23, 2023
From: QOMPLX, INC.
To: QPX, LLC.
Reel/Frame 064674/0407 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2022
From: SELLERS, ANDREW; CRABTREE, JASON
To: QOMPLX, INC.
Reel/Frame 059924/0302 →
Continuity (14)
Continuation In Part 16575929 · Sep 19, 2019
Continuation In Part 16191054 · Nov 14, 2018
Continuation In Part 15655113 · Jul 20, 2017
Continuation In Part 15616427 · Jun 7, 2017
Continuation In Part 14925974 · Oct 28, 2015
Continuation In Part 15237625 · Aug 15, 2016
Continuation In Part 15206195 · Jul 8, 2016
Continuation In Part 15186453 · Jun 18, 2016
Continuation In Part 15166158 · May 26, 2016
Continuation In Part 15141752 · Apr 28, 2016
Continuation In Part 15091563 · Apr 5, 2016
Continuation In Part 14986536 · Dec 31, 2015
Continuation In Part 14925974 · Oct 28, 2015
Related Publication 20220058745A1 · Feb 24, 2022
References Cited (105)
US 5669000A · Jessen et al. · 1997 [cited by applicant]
US 6256544B1 · Weissinger · 2001 [cited by applicant]
US 6477572B1 · Elderton et al. · 2002 [cited by applicant]
US 7072863B1 · Phillips et al. · 2006 [cited by applicant]
US 7657406B2 · Tolone et al. · 2010 [cited by applicant]
US 7698213B2 · Lancaster · 2010 [cited by applicant]
US 7739653B2 · Venolia · 2010 [cited by applicant]
US 8065257B2 · Kuecuekyan · 2011 [cited by applicant]
US 8145761B2 · Liu et al. · 2012 [cited by applicant]
US 8281121B2 · Nath et al. · 2012 [cited by applicant]
US 8615800B2 · Baddour et al. · 2013 [cited by applicant]
US 8788306B2 · Delurgio et al. · 2014 [cited by applicant]
US 8793758B2 · Raleigh et al. · 2014 [cited by applicant]
US 8914878B2 · Burns et al. · 2014 [cited by applicant]
US 8997233B2 · Green et al. · 2015 [cited by applicant]
US 9134966B2 · Brock et al. · 2015 [cited by applicant]
US 9141360B1 · Chen et al. · 2015 [cited by applicant]
US 9231962B1 · Yen et al. · 2016 [cited by applicant]
US 9602530B2 · Ellis et al. · 2017 [cited by applicant]
US 9654495B2 · Hubbard et al. · 2017 [cited by applicant]
US 9672355B2 · Titonis et al. · 2017 [cited by applicant]
US 9686308B1 · Srivastava · 2017 [cited by applicant]
US 9762443B2 · Dickey · 2017 [cited by applicant]
US 9887933B2 · Lawrence, III · 2018 [cited by applicant]
US 9946517B2 · Talby et al. · 2018 [cited by applicant]
US 10061635B2 · Ellwein · 2018 [cited by applicant]
US 10102480B2 · Dirac et al. · 2018 [cited by applicant]
US 10109014B1 · Bischoff · 2018 [cited by examiner]
US 10210246B2 · Stojanovic et al. · 2019 [cited by applicant]
US 10210255B2 · Crabtree et al. · 2019 [cited by applicant]
US 10242406B2 · Kumar et al. · 2019 [cited by applicant]
US 10248910B2 · Crabtree et al. · 2019 [cited by applicant]
US 10318882B2 · Brueckner et al. · 2019 [cited by applicant]
US 10367829B2 · Huang et al. · 2019 [cited by applicant]
US 10511498B1 · Narayan et al. · 2019 [cited by applicant]
US 10878509B1 · Healy · 2020 [cited by examiner]
US 20030041254A1 · Challener et al. · 2003 [cited by applicant]
US 20030145225A1 · Bruton et al. · 2003 [cited by applicant]
US 20050289072A1 · Sabharwal · 2005 [cited by applicant]
US 20060149575A1 · Varadarajan et al. · 2006 [cited by applicant]
US 20070150744A1 · Cheng et al. · 2007 [cited by applicant]
US 20090064088A1 · Barcia et al. · 2009 [cited by applicant]
US 20090089227A1 · Sturrock et al. · 2009 [cited by applicant]
US 20090182672A1 · Doyle · 2009 [cited by applicant]
US 20090222562A1 · Liu et al. · 2009 [cited by applicant]
US 20090293128A1 · Lippmann et al. · 2009 [cited by applicant]
US 20100223226A1 · Alba et al. · 2010 [cited by applicant]
US 20110060821A1 · Loizeaux et al. · 2011 [cited by applicant]
US 20110087888A1 · Rennie · 2011 [cited by applicant]
US 20110154341A1 · Pueyo et al. · 2011 [cited by applicant]
US 20120066667A1 · Mascaro et al. · 2012 [cited by applicant]
US 20120266244A1 · Green et al. · 2012 [cited by applicant]
US 20120296845A1 · Andrews et al. · 2012 [cited by applicant]
US 20130073062A1 · Smith et al. · 2013 [cited by applicant]
US 20130132149A1 · Wei et al. · 2013 [cited by applicant]
US 20130191416A1 · Lee et al. · 2013 [cited by applicant]
US 20130246996A1 · Duggal et al. · 2013 [cited by applicant]
US 20130304623A1 · Kumar et al. · 2013 [cited by applicant]
US 20140156806A1 · Karpistsenko et al. · 2014 [cited by applicant]
US 20140244612A1 · Bhasin et al. · 2014 [cited by applicant]
US 20140279762A1 · Xaypanya et al. · 2014 [cited by applicant]
US 20150112730A1 · Binion · 2015 [cited by examiner]
US 20150149979A1 · Talby et al. · 2015 [cited by applicant]
US 20150163242A1 · Laidlaw et al. · 2015 [cited by applicant]
US 20150169294A1 · Brock et al. · 2015 [cited by applicant]
US 20150195192A1 · Vasseur et al. · 2015 [cited by applicant]
US 20150236935A1 · Bassett · 2015 [cited by applicant]
US 20150281225A1 · Schoen et al. · 2015 [cited by applicant]
US 20150317481A1 · Gardner et al. · 2015 [cited by applicant]
US 20150339263A1 · Ata et al. · 2015 [cited by applicant]
US 20150347414A1 · Xiao et al. · 2015 [cited by applicant]
US 20150379424A1 · Dirac et al. · 2015 [cited by applicant]
US 20160004858A1 · Chen et al. · 2016 [cited by applicant]
US 20160028758A1 · Ellis et al. · 2016 [cited by applicant]
US 20160072845A1 · Chiviendacz et al. · 2016 [cited by applicant]
US 20160078361A1 · Brueckner et al. · 2016 [cited by applicant]
US 20160099960A1 · Gerritz et al. · 2016 [cited by applicant]
US 20160105454A1 · Li et al. · 2016 [cited by applicant]
US 20160119365A1 · Barel · 2016 [cited by applicant]
US 20160140519A1 · Trepca et al. · 2016 [cited by applicant]
US 20160275123A1 · Lin et al. · 2016 [cited by applicant]
US 20160285732A1 · Brech et al. · 2016 [cited by applicant]
US 20160342606A1 · Mouel et al. · 2016 [cited by applicant]
US 20160350442A1 · Crosby · 2016 [cited by applicant]
US 20160364307A1 · Garg et al. · 2016 [cited by applicant]
US 20170019678A1 · Kim et al. · 2017 [cited by applicant]
US 20170063896A1 · Muddu et al. · 2017 [cited by applicant]
US 20170083380A1 · Bishop et al. · 2017 [cited by applicant]
US 20170126712A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170139763A1 · Ellwein · 2017 [cited by applicant]
US 20170149802A1 · Huang et al. · 2017 [cited by applicant]
US 20170193110A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170206360A1 · Brucker et al. · 2017 [cited by applicant]
US 20170322959A1 · Tidwell et al. · 2017 [cited by applicant]
US 20170323089A1 · Duggal et al. · 2017 [cited by applicant]
US 20180197128A1 · Carstens et al. · 2018 [cited by applicant]
US 20180300930A1 · Kennedy et al. · 2018 [cited by applicant]
US 20180336250A1 · Llaves · 2018 [cited by examiner]
US 20190082305A1 · Proctor · 2019 [cited by applicant]
US 20190095533A1 · Evine et al. · 2019 [cited by applicant]
US 20220058745A1 · Crabtree · 2022 [cited by examiner]
CN 105302532B · 2018 [cited by applicant]
WO 2014159150A1 · 2014 [cited by applicant]
WO 2017075543A1 · 2017 [cited by applicant]
Simonian et al., Robust Value-At-Risk: An Information Theoretic Approach Huang, Alex, A Comparison of Value at Risk Approaches and a New Method with Extreme Value Theory and Kernel Estimator. [cited by applicant]