IP Library › Granted Patent US 12,462,208
Granted Patent B2
US 12,462,208 · App. 18/236,872 · Granted Nov 4, 2025

Risk probability assessment for cargo shipment operations and methods of use thereof

Inventor: Chris Kalinski (Oxford, MD)
Assignee: Redkik, LLC
G06Q10/0635G06F18/2193G06F18/2415G06N20/00G06Q10/083
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,462,208
App. No.
18/236,872
Filed
Aug 22, 2023
Granted
Nov 4, 2025
Kind
B2
Art Unit
3625
USPC
705/7.28
Abstract

In some embodiments, the present disclosure provides an exemplary method that may include steps of receiving input data for a plurality of identified data records; receiving a plurality of predetermined policy parameters associated with at least one logistics data provider of the plurality of logistics data providers; dynamically enriching the input data by aggregating current data, forecast data, and predictive data; calculating a respective risk probability value associated with each qualifying provider of the plurality of providers; generating a respective dynamic data model associated with each of the qualifying provider of the plurality of providers; dynamically determining a predetermined policy risk threshold in real time for the identified data record; automatically modifying the predetermined policy risk threshold in real time associated with the at least one qualified provider of the plurality of providers; and dynamically selecting a respective data point for each qualified provider of the plurality of providers.

Claims (53)

1 . A computer-implemented method comprising:

receiving, by a processor, a plurality of policy parameters associated with a provider of a plurality of providers from a plurality of pre-generated databases;

dynamically enriching, by the processor, input data associated with the plurality of policy parameters and a plurality of identified data records,

wherein enriched input data is utilized to train a machine learning model associated with the identified data record;

training, by the processor, a machine learning model with at least one data feedback loop by introducing training data as a plurality of variables to generate a first plurality of scenarios in real-time,

dynamically simulating, by the processor, the first plurality of scenarios in real time to optimize a first respective dynamic probability risk value generated by a respective dynamic data model using the trained machine learning model;

automatically updating, by the processor, the at least one feedback loop associated with the trained machine learning model;

dynamically generating, by the processor, a second plurality of scenarios in real-time based on the at least one feedback loop associated with the trained machine learning model;

dynamically determining, by the processor, a predetermined policy risk threshold for the identified data record based on the second plurality of scenarios; and

automatically modifying, by the processor, the predetermined policy risk threshold associated with a qualified provider of the plurality of providers based on a respective model risk probability value to generate a modified policy risk threshold associated with the identified data record.

2 . The method of claim 1 , further comprising dynamically selecting a respective data point for each qualified provider of the plurality of providers based on a second respective model risk probability value and a modified second policy risk threshold in real time for the identified data records.

3 . The method of claim 2 , further comprising automatically engaging into at least two smart contracts between at least one entity and the at least one provider based on the dynamically selected respective data point for each qualified provider of the plurality of providers.

4 . The method of claim 1 , further comprising receiving the input data for a plurality of identified data records by a plurality of logistics data providers.

5 . The method of claim 1 , wherein dynamically enriching the input data comprises aggregating current data, forecast data, and predictive data associated with the identified data record.

6 . The method of claim 1 , wherein training the machine learning model comprises calculating the first respective risk probability value associated with each qualifying provider of the plurality of providers based a comparison of the enriched input data and the plurality of predetermined policy parameters.

7 . The method of claim 1 , wherein dynamically simulating the first set of scenarios comprises generating the respective dynamic data model associated with each of the qualifying provider of the plurality of providers based on the enriched input data and the respective dynamic risk probability value.

8 . The method of claim 1 , wherein the training data is a representation of potential risks associated with the enriched input data represented in forms of data points.

9 . The method of claim 1 , wherein automatically updating the at least one feedback loop comprises storing at least one result of a dynamic simulation of at least one scenario of the first plurality of scenarios in real-time.

10 . The method of claim 1 , wherein automatically modifying the determined policy risk threshold comprises utilizing the respective dynamic data model and the first respective determined risk probability value associated with each qualifying provider of the plurality of providers in real-time.

11 . A computing device comprising:

a non-transient computer memory, storing software instructions;

at least one processor;

wherein, when the at least one processor executes the software instructions, the computing device is programmed to:

receive a plurality of policy parameters associated with a provider of a plurality of providers from a plurality of pre-generated databases;

dynamically enrich input data associated with the plurality of policy parameters and a plurality of identified data records,

wherein enriched input data is utilized to train a machine learning model associated with the identified data record;

train a machine learning model with at least one data feedback loop by introducing training data as a plurality of variables to generate a first plurality of scenarios in real-time,

dynamically simulate the first plurality of scenarios in real time to optimize a first respective dynamic probability risk value generated by a respective dynamic data model using the trained machine learning model;

automatically update the at least one feedback loop associated with the trained machine learning model;

dynamically generate a second plurality of scenarios in real-time based on the at least one feedback loop associated with the trained machine learning model;

dynamically determine a predetermined policy risk threshold for the identified data record based on the second plurality of scenarios; and

automatically modify the predetermined policy risk threshold associated with a qualified provider of the plurality of providers based on a respective model risk probability value to generate a modified policy risk threshold associated with the identified data record.

12 . The computing device of claim 11 , wherein the computing device is further programmed to dynamically select a respective data point for each qualified provider of the plurality of providers based on a second respective model risk probability value and a modified second policy risk threshold in real time for the identified data records.

13 . The computing device of claim 11 , wherein the computing device is further programmed to automatically engage into at least two smart contracts between at least one entity and the at least one provider based on the dynamically selected respective data point for each qualified provider of the plurality of providers.

14 . The computing device of claim 11 , wherein the computing device is further programmed to receive the input data for a plurality of identified data records by a plurality of logistics data providers.

15 . The computing device of claim 11 , wherein a dynamic enrichment of the input data comprises aggregating current data, forecast data, and predictive data associated with the identified data record.

16 . The computing device of claim 11 , wherein the machine learning model comprises calculating the first respective risk probability value associated with each qualifying provider of the plurality of providers based a comparison of the enriched input data and the plurality of predetermined policy parameters.

17 . The computing device of claim 11 , wherein a dynamic simulation of the first set of scenarios comprises generating the respective dynamic data model associated with each of the qualifying provider of the plurality of providers based on the enriched input data and the respective dynamic risk probability value.

18 . The computing device of claim 11 , wherein the training data is a representation of potential risks associated with the enriched input data represented in forms of data points.

19 . A system comprises:

a non-transient computer memory, storing software instructions;

at least one processor of a computing device associated with a user;

wherein, when the processor executes the software instructions, the first computing device is programmed to:

receive a plurality of policy parameters associated with a provider of a plurality of providers from a plurality of pre-generated databases;

dynamically enrich input data associated with the plurality of policy parameters and a plurality of identified data records,

wherein enriched input data is utilized to train a machine learning model associated with the identified data record;

train a machine learning model with at least one data feedback loop by introducing training data as a plurality of variables to generate a first plurality of scenarios in real-time,

dynamically simulate the first plurality of scenarios in real time to optimize a first respective dynamic probability risk value generated by a respective dynamic data model using the trained machine learning model;

automatically update the at least one feedback loop associated with the trained machine learning model;

dynamically generate a second plurality of scenarios in real-time based on the at least one feedback loop associated with the trained machine learning model;

dynamically determine a predetermined policy risk threshold for the identified data record based on the second plurality of scenarios; and

automatically modify the predetermined policy risk threshold associated with a qualified provider of the plurality of providers based on a respective model risk probability value to generate a modified policy risk threshold associated with the identified data record.

20 . The system of claim 19 , the training data is a representation of potential risks associated with the enriched input data represented in forms of data points.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 21, 2024
From: KALINSKI, CHRIS
To: REDKIK, LLC
Reel/Frame 066856/0690 →
Continuity (3)
Continuation 17738396 · May 6, 2022
Provisional Application 63185593 · May 7, 2021
Related Publication 20230394411A1 · Dec 7, 2023
References Cited (266)
US 3519224A · Boyd et al. · 1970 [cited by applicant]
US 5380011A · Jarvis · 1995 [cited by applicant]
US 5610344A · Ueda et al. · 1997 [cited by applicant]
US 5727676A · Tatsu et al. · 1998 [cited by applicant]
US 6050116A · Cole · 2000 [cited by applicant]
US 6630249B2 · Kennedy · 2003 [cited by applicant]
US 6984452B2 · Kennedy · 2006 [cited by applicant]
US 7069252B2 · Ishimi et al. · 2006 [cited by applicant]
US 7587353B2 · Melchior et al. · 2009 [cited by applicant]
US 7610210B2 · Helitzer et al. · 2009 [cited by applicant]
US 7698204B2 · Abendroth · 2010 [cited by applicant]
US 7818812B2 · Kra · 2010 [cited by applicant]
US 8010461B2 · Bohinc, Jr. · 2011 [cited by applicant]
US 8290797B2 · Hargroder · 2012 [cited by applicant]
US 8332241B2 · Harrell et al. · 2012 [cited by applicant]
US 8543490B2 · Lerner · 2013 [cited by applicant]
US 8843410B2 · Blount et al. · 2014 [cited by applicant]
US 9628975B1 · Watkins et al. · 2017 [cited by applicant]
US 9798996B2 · Borgerson et al. · 2017 [cited by applicant]
US 9870392B2 · Xiao · 2018 [cited by applicant]
US 10032224B2 · Helitzer et al. · 2018 [cited by applicant]
US 10410167B2 · Borgerson et al. · 2019 [cited by applicant]
US 10623899B2 · Watkins et al. · 2020 [cited by applicant]
US 10679173B2 · Olsen et al. · 2020 [cited by applicant]
US 11051127B2 · Watkins et al. · 2021 [cited by applicant]
US 11257108B2 · Salloum · 2022 [cited by applicant]
US 11367141B1 · Wang et al. · 2022 [cited by applicant]
US 11367142B1 · Wang et al. · 2022 [cited by applicant]
US 11466997B1 · Williams · 2022 [cited by examiner]
US 11634214B1 · Parchment et al. · 2023 [cited by applicant]
US 11694272B2 · Sharpe · 2023 [cited by applicant]
US 11734634B2 · Kalinski · 2023 [cited by applicant]
US 11770681B2 · Watkins et al. · 2023 [cited by applicant]
US 20020016778A1 · Konno et al. · 2002 [cited by applicant]
US 20020095355A1 · Walker et al. · 2002 [cited by applicant]
US 20020198744A1 · Sagalow et al. · 2002 [cited by applicant]
US 20040034575A1 · Oh · 2004 [cited by applicant]
US 20050102168A1 · Thomas et al. · 2005 [cited by applicant]
US 20050171870A1 · Mizushima et al. · 2005 [cited by applicant]
US 20050171871A1 · Mizushima et al. · 2005 [cited by applicant]
US 20050219037A1 · Huang · 2005 [cited by applicant]
US 20050261986A1 · Haynes et al. · 2005 [cited by applicant]
US 20060033616A1 · Silva et al. · 2006 [cited by applicant]
US 20060089886A1 · Wong · 2006 [cited by applicant]
US 20070011033A1 · Atkinson et al. · 2007 [cited by applicant]
US 20070168125A1 · Petrik · 2007 [cited by applicant]
US 20070282641A1 · Thomas et al. · 2007 [cited by applicant]
US 20070282642A1 · Thomas et al. · 2007 [cited by applicant]
US 20080147516A1 · Rousso et al. · 2008 [cited by applicant]
US 20080228625A1 · Isaf et al. · 2008 [cited by applicant]
US 20090061897A1 · Hamilton et al. · 2009 [cited by applicant]
US 20090089113A1 · Rousso et al. · 2009 [cited by applicant]
US 20090164256A1 · Fisher et al. · 2009 [cited by applicant]
US 20100097208A1 · Rosing et al. · 2010 [cited by applicant]
US 20120107191A1 · Strahle et al. · 2012 [cited by applicant]
US 20130232036A1 · Melchior et al. · 2013 [cited by applicant]
US 20130275466A1 · Xiao · 2013 [cited by applicant]
US 20140040063A1 · Raviv et al. · 2014 [cited by applicant]
US 20140188750A1 · Seiler · 2014 [cited by applicant]
US 20150371182A1 · Lucas · 2015 [cited by examiner]
US 20160189304A1 · Todasco et al. · 2016 [cited by applicant]
US 20170030853A1 · Hodges, Jr. et al. · 2017 [cited by applicant]
US 20170032314A1 · Borgerson et al. · 2017 [cited by applicant]
US 20170069035A1 · Quinlan et al. · 2017 [cited by applicant]
US 20170208375A1 · Hodges, Jr. et al. · 2017 [cited by applicant]
US 20180146341A1 · Watkins et al. · 2018 [cited by applicant]
US 20190082300A1 · Watkins et al. · 2019 [cited by applicant]
US 20190095857A1 · Borgerson et al. · 2019 [cited by applicant]
US 20190114714A1 · Jones et al. · 2019 [cited by applicant]
US 20190251508A1 · Beckwitt · 2019 [cited by applicant]
US 20190258993A1 · Olsen et al. · 2019 [cited by applicant]
US 20200034788A1 · Ynion, Jr. · 2020 [cited by applicant]
US 20200118068A1 · Turetsky et al. · 2020 [cited by applicant]
US 20200202451A1 · Jones et al. · 2020 [cited by applicant]
US 20200234327A1 · Salloum · 2020 [cited by applicant]
US 20200267503A1 · Watkins et al. · 2020 [cited by applicant]
US 20200334762A1 · Carver et al. · 2020 [cited by applicant]
US 20210035224A1 · Crabtree et al. · 2021 [cited by applicant]
US 20210042696A1 · Lahav et al. · 2021 [cited by applicant]
US 20210082055A1 · Sharpe · 2021 [cited by applicant]
US 20210201420A1 · Kaneichi · 2021 [cited by applicant]
US 20210272037A1 · Hanebeck · 2021 [cited by applicant]
US 20210295355A1 · Bostock et al. · 2021 [cited by applicant]
US 20210398045A1 · Hanebeck · 2021 [cited by applicant]
US 20220092530A1 · Newell et al. · 2022 [cited by applicant]
US 20220129804A1 · Dooley et al. · 2022 [cited by applicant]
US 20220129846A1 · Montgomery et al. · 2022 [cited by applicant]
US 20220138888A1 · Wiesenberg et al. · 2022 [cited by applicant]
US 20220230131A1 · Benayoun et al. · 2022 [cited by applicant]
US 20220374797A1 · Kalinski · 2022 [cited by applicant]
US 20230059205A1 · Prupes et al. · 2023 [cited by applicant]
US 20230185942A1 · Hanebeck · 2023 [cited by applicant]
US 20230211757A1 · Allen · 2023 [cited by applicant]
US 20230394411A1 · Kalinski · 2023 [cited by applicant]
AU 2001296069 · 2002 [cited by applicant]
AU 2002231179 · 2002 [cited by applicant]
AU 2005270733 · 2006 [cited by applicant]
AU 2007101215 · 2008 [cited by applicant]
AU 2016300215 · 2021 [cited by applicant]
CA 2316430 · 2002 [cited by applicant]
CA 3022440 · 2020 [cited by applicant]
CN 2480497 · 2002 [cited by applicant]
CN 1175369 · 2004 [cited by applicant]
CN 1559049 · 2004 [cited by applicant]
CN 1213852 · 2005 [cited by applicant]
CN 101551887 · 2009 [cited by applicant]
CN 101782991 · 2010 [cited by applicant]
CN 101828098 · 2010 [cited by applicant]
CN 102567863 · 2012 [cited by applicant]
CN 102592207 · 2012 [cited by applicant]
CN 202486831 · 2012 [cited by applicant]
CN 104035385 · 2014 [cited by applicant]
CN 104376447 · 2015 [cited by applicant]
CN 105512845 · 2016 [cited by applicant]
CN 103218704 · 2016 [cited by applicant]
CN 105930928 · 2016 [cited by applicant]
CN 106845896 · 2017 [cited by applicant]
CN 103229200 · 2017 [cited by applicant]
CN 107248051 · 2017 [cited by applicant]
CN 108367862 · 2018 [cited by applicant]
CN 109670906 · 2019 [cited by applicant]
CN 109740979 · 2019 [cited by applicant]
CN 110009517 · 2019 [cited by applicant]
CN 110223026 · 2019 [cited by applicant]
CN 110447045 · 2019 [cited by applicant]
CN 111523754 · 2020 [cited by applicant]
CN 111639887 · 2020 [cited by applicant]
CN 112883319 · 2021 [cited by applicant]
CN 113056757 · 2021 [cited by applicant]
CN 113591449 · 2021 [cited by applicant]
CN 113762573 · 2021 [cited by applicant]
CN 114059892 · 2022 [cited by applicant]
DE 102005019194 · 2005 [cited by applicant]
DE 102006051248 · 2008 [cited by applicant]
DE 102007007034 · 2008 [cited by applicant]
DE 102008039648 · 2010 [cited by applicant]
EP 1784767 · 2007 [cited by applicant]
EP 3703306 · 2020 [cited by applicant]
EP 3836053 · 2021 [cited by applicant]
ES 269663 · 1984 [cited by applicant]
ES 1004138 · 1988 [cited by applicant]
ES 2204440 · 2004 [cited by applicant]
ES 2158832 · 2005 [cited by applicant]
ES 2300405 · 2008 [cited by applicant]
ES 2311596 · 2009 [cited by applicant]
ES 1071288 · 2010 [cited by applicant]
ES 2355846 · 2011 [cited by applicant]
ES 2365093 · 2011 [cited by applicant]
ES 2369344 · 2011 [cited by applicant]
ES 2381735 · 2012 [cited by applicant]
ES 2425633 · 2013 [cited by applicant]
ES 2430716 · 2013 [cited by applicant]
ES 2508121 · 2014 [cited by applicant]
ES 2714627 · 2019 [cited by applicant]
ES 2715987 · 2019 [cited by applicant]
ES 2767623 · 2020 [cited by applicant]
ES 2846889 · 2021 [cited by applicant]
ES 2893806 · 2022 [cited by applicant]
HR P20200020T1 · 2020 [cited by applicant]
IT TO20121091A1 · 2014 [cited by applicant]
JP 2001325446 · 2001 [cited by applicant]
JP 2002149985 · 2002 [cited by applicant]
JP 2002312446 · 2002 [cited by applicant]
JP 2004510752 · 2004 [cited by applicant]
JP 2004302574 · 2004 [cited by applicant]
JP 2004533294 · 2004 [cited by applicant]
JP 2006244196 · 2006 [cited by applicant]
JP 2007001760 · 2007 [cited by applicant]
JP 4732606 · 2011 [cited by applicant]
JP 2017016456 · 2017 [cited by applicant]
JP 2023053923 · 2023 [cited by applicant]
JP 2023542361 · 2023 [cited by applicant]
KR 20010000912 · 2001 [cited by applicant]
KR 20010097029 · 2001 [cited by applicant]
KR 20010099047 · 2001 [cited by applicant]
KR 20010109596 · 2001 [cited by applicant]
KR 20020003593 · 2002 [cited by applicant]
KR 20020006799 · 2002 [cited by applicant]
KR 20020022417 · 2002 [cited by applicant]
KR 20020025546 · 2002 [cited by applicant]
KR 20020029642 · 2002 [cited by applicant]
KR 20020068814 · 2002 [cited by applicant]
KR 20030065224 · 2003 [cited by applicant]
KR 100407397 · 2003 [cited by applicant]
KR 100418264 · 2004 [cited by applicant]
KR 100443912 · 2004 [cited by applicant]
KR 20050069227 · 2005 [cited by applicant]
KR 20060019930 · 2006 [cited by applicant]
KR 100650225 · 2006 [cited by applicant]
KR 100662675 · 2007 [cited by applicant]
KR 20080004267 · 2008 [cited by applicant]
KR 20080041042 · 2008 [cited by applicant]
KR 100836874 · 2008 [cited by applicant]
KR 20090000173 · 2009 [cited by applicant]
KR 20090001749 · 2009 [cited by applicant]
KR 20090001930 · 2009 [cited by applicant]
KR 20090009359 · 2009 [cited by applicant]
KR 20090009360 · 2009 [cited by applicant]
KR 20090009361 · 2009 [cited by applicant]
KR 20090011042 · 2009 [cited by applicant]
KR 20090013670 · 2009 [cited by applicant]
KR 20090022201 · 2009 [cited by applicant]
KR 20090023437 · 2009 [cited by applicant]
KR 20090023457 · 2009 [cited by applicant]
KR 20090127790 · 2009 [cited by applicant]
KR 20100024907 · 2010 [cited by applicant]
KR 20110097731 · 2011 [cited by applicant]
KR 20150001579 · 2015 [cited by applicant]
KR 101778735 · 2017 [cited by applicant]
KR 101810179 · 2017 [cited by applicant]
KR 101982250 · 2019 [cited by applicant]
KR 20200002714 · 2020 [cited by applicant]
KR 20200137430 · 2020 [cited by applicant]
KR 20200142363 · 2020 [cited by applicant]
KR 20210006723 · 2021 [cited by applicant]
KR 20210027952 · 2021 [cited by applicant]
KR 102232716 · 2021 [cited by applicant]
KR 102251607 · 2021 [cited by applicant]
KR 20210070524 · 2021 [cited by applicant]
KR 20210114782 · 2021 [cited by applicant]
KR 20220013168 · 2022 [cited by applicant]
KR 20220037134 · 2022 [cited by applicant]
KR 102381490 · 2022 [cited by applicant]
KR 102390562 · 2022 [cited by applicant]
KR 102461658 · 2022 [cited by applicant]
KR 102578798 · 2023 [cited by applicant]
KR 20230141085 · 2023 [cited by applicant]
MX 2013000856 · 2013 [cited by applicant]
NZ 739245 · 2021 [cited by applicant]
PT 83228 · 1992 [cited by applicant]
RU 2009978 · 1994 [cited by applicant]
RU 13266 · 2000 [cited by applicant]
RU 99110723 · 2001 [cited by applicant]
RU 2222826 · 2004 [cited by applicant]
RU 2293055 · 2007 [cited by applicant]
RU 2437825 · 2011 [cited by applicant]
RU 2582742 · 2016 [cited by applicant]
RU 2602269 · 2016 [cited by applicant]
RU 2726211 · 2020 [cited by applicant]
SU 639804 · 1978 [cited by applicant]
SU 735549 · 1980 [cited by applicant]
SU 848041 · 1981 [cited by applicant]
SU 1759775 · 1992 [cited by applicant]
TW 440536 · 2001 [cited by applicant]
TW 557431 · 2003 [cited by applicant]
WO 0144994 · 2001 [cited by applicant]
WO 0217032 · 2002 [cited by applicant]
WO 0235319 · 2002 [cited by applicant]
WO 02095626 · 2002 [cited by applicant]
WO 2008017085 · 2008 [cited by applicant]
WO 2009094020 · 2009 [cited by applicant]
WO 2015136324 · 2015 [cited by applicant]
WO 2018147881 · 2018 [cited by applicant]
WO 2019028634 · 2019 [cited by applicant]
WO 2019028635 · 2019 [cited by applicant]
WO 2021021651 · 2021 [cited by applicant]
WO 2021026174 · 2021 [cited by applicant]
WO 2021029029 · 2021 [cited by applicant]
WO 2021186092 · 2021 [cited by applicant]
WO 2022060361 · 2022 [cited by applicant]
WO 2022236059 · 2022 [cited by applicant]
WO 2023101088 · 2023 [cited by applicant]
WO 2023180581 · 2023 [cited by applicant]
European Patent Office; PCT International Search Report, issued in connection to PCT/US2022/028077; Jul. 25, 2022; 3 pages; Europe. [cited by applicant]
European Patent Office; PCT Written Opinion of the International Searching Authority, issued in connection to PCT/US2022/028077; Jul. 25, 2022; 7 pages; Europe. [cited by applicant]
The International Bureau of WIPO; PCT International Preliminary Report on Patentability, issued in connection to PCT/US2022/028077; Oct. 24, 2023; 8 pages; Switzerland. [cited by applicant]