IP Library › Granted Patent US 12,231,298
Granted Patent B2
US 12,231,298 · App. 18/215,805 · Granted Feb 18, 2025

Systems and methods for full history dynamic network analysis

Inventors: Henrik Ohlsson (Palo Alto, CA); Umashankar Sandilya (Palo Alto, CA); Mehdi Maasoumy Haghighi (Redwood City, CA)
Assignee: C3.ai, Inc.
H04L41/14G06F16/9024H04L41/12
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,231,298
App. No.
18/215,805
Granted
Feb 18, 2025
Kind
B2
Abstract

Provided herein are methods and systems for determining a historical state of a dynamic network. The methods may comprise continuously obtaining data associated with a system from a plurality of different data sources; constructing a full history dynamic network (FHDN) of the system using the data; and providing a state of the system for a historical time instance in response to a query of the FHDN for the historical time instance.

Claims (31)

1. A method comprising:

extracting, by one or more processors, information from a full history dynamic network (FHDN) based on one or more parameters, wherein the FHDN comprises a representation of a dynamic system over a period of time, wherein the representation comprises a plurality of elements of the dynamic system during the period of time and connections between pairs of elements of the plurality of elements over the period of time, and wherein the FHDN comprises time series data associated with each of the plurality of elements and the connections, wherein the time series data comprises data that indicates changes in a state of the plurality of elements over the period of time and changes in a state of the connections over the period of time;

determining, by the one or more processors, one or more operational states of the FHDN at one or more historical time instances based on the information extracted from the FHDN, wherein the one or more historical time instances are within the period of time; and

determining, by the one or more processors, a dynamic behavior of the FHDN based on the one or more operational states of the FHDN.

2. The method of claim 1 , wherein the FHDN is a power grid and the dynamic behavior comprises changes to a flow of electricity through assets of the power grid.

3. The method of claim 1 , wherein the FHDN is a communication network and the dynamic behavior comprises changes to a flow of information through assets of the communication network.

4. The method of claim 1 , wherein the FHDN is a transportation network and the dynamic behavior comprises changes to traffic patterns of the transportation network.

5. The method of claim 4 , wherein the FHDN associates weights to connections, and wherein the weights represent attributes associated with the elements of the transportation network.

6. The method of claim 5 , wherein the attributes comprise travel times, distances, or both.

7. The method of claim 4 , further comprising determining an optimized route through the transportation network based on the FHDN.

8. The method of claim 1 , wherein the FHDN is a supply chain network and the dynamic behavior comprises changes to movement of goods through the supply chain network.

9. The method of claim 2 , further comprising generating a prediction based on analysis of the FHDN.

10. The method of claim 9 , wherein the prediction is a failure of at least one element of the FHDN.

11. A system comprising:

a memory; and

one or more processors communicatively coupled to the memory and configured to:

extract information from a full history dynamic network (FHDN) based on one or more parameters, wherein the FHDN comprises a representation of a dynamic system over a period of time, wherein the representation comprises a plurality of elements of the dynamic system during the period of time and connections between pairs of elements of the plurality of elements over the period of time, and wherein the FHDN comprises time series data associated with each of the plurality of elements and the connections, wherein the time series data comprises data that indicates changes in a state of the plurality of elements over the period of time and changes in a state of the connections over the period of time;

determine one or more operational states of the FHDN at one or more historical time instances based on the information extracted from the FHDN, wherein the one or more historical time instances are within the period of time; and

determine a dynamic behavior of the FHDN based on the one or more operational states of the FHDN.

12. The system of claim 11 , wherein the FHDN is a power grid and the dynamic behavior comprises changes to a flow of electricity through assets of the power grid.

13. The system of claim 11 , wherein the FHDN is a communication network and the dynamic behavior comprises changes to a flow of information through assets of the communication network.

14. The system of claim 11 , wherein the FHDN is a transportation network and the dynamic behavior comprises changes to traffic patterns of the transportation network, wherein the FHDN associates weights to connections, and wherein the weights represent attributes associated with the elements of the transportation network.

15. The system of claim 14 , wherein the attributes comprise travel times, distances, or both.

16. The system of claim 14 , wherein the one or more processors are configured to determine an optimized route through the transportation network based on the FHDN.

17. The system of claim 11 , wherein the FHDN is a supply chain network and the dynamic behavior comprises changes to movement of goods through the supply chain network.

18. The system of claim 11 , wherein the one or more processors are configured to generate a prediction based on analysis of the FHDN.

19. The system of claim 18 , wherein the prediction is a failure of at least one element of the FHDN.

20. A non-transitory computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

extracting information from a full history dynamic network (FHDN) based on one or more parameters, wherein the FHDN comprises a representation of a dynamic system over a period of time, wherein the representation comprises a plurality of elements of the dynamic system during the period of time and connections between pairs of elements of the plurality of elements over the period of time, and wherein the FHDN comprises time series data associated with each of the plurality of elements and the connections, wherein the time series data comprises data that indicates changes in a state of the plurality of elements over the period of time and changes in a state of the connections over the period of time;

determining one or more operational states of the FHDN at one or more historical time instances based on the information extracted from the FHDN, wherein the one or more historical time instances are within the period of time; and

determining a dynamic behavior of the FHDN based on the one or more operational states of the FHDN.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 30, 2023
From: OHLSSON, HENRIK; SANDILYA, UMASHANKAR; HAGHIGHI, MEHDI MAASOUMY
To: C3.AI, INC.
Reel/Frame 064131/0400 →
Continuity (4)
Continuation 17245383 · Apr 30, 2021
Continuation PCTUS2019058951 · Oct 30, 2019
Provisional Application 62754786 · Nov 2, 2018
Related Publication 20230344724A1 · Oct 26, 2023
References Cited (54)
US 6061609A · Kanoi et al. · 2000 [cited by applicant]
US 8191002B2 · Lauridsen · 2012 [cited by applicant]
US 8583659B1 · Alexandrescu et al. · 2013 [cited by applicant]
US 9317567B1 · Lu et al. · 2016 [cited by applicant]
US 9792434B1 · Li et al. · 2017 [cited by applicant]
US 11729066B2 · Ohlsson · 2023 [cited by examiner]
US 20040167903A1 · Margolus et al. · 2004 [cited by applicant]
US 20040268331A1 · Mitchell et al. · 2004 [cited by applicant]
US 20050041026A1 · Haynes · 2005 [cited by applicant]
US 20070185825A1 · Ito · 2007 [cited by examiner]
US 20070198679A1 · Duyanovich · 2007 [cited by applicant]
US 20090100372A1 · Lauridsen · 2009 [cited by applicant]
US 20090138577A1 · Casado et al. · 2009 [cited by applicant]
US 20100172269A1 · Hariharan · 2010 [cited by applicant]
US 20130066819A1 · Nice · 2013 [cited by applicant]
US 20130097180A1 · Tseng · 2013 [cited by applicant]
US 20140075005A1 · Tung et al. · 2014 [cited by applicant]
US 20150051940A1 · Bhowmik et al. · 2015 [cited by applicant]
US 20150064713A1 · Bastiaens · 2015 [cited by examiner]
US 20150112998A1 · Shankar et al. · 2015 [cited by applicant]
US 20150215245A1 · Carlson · 2015 [cited by applicant]
US 20150254553A1 · Arsovski · 2015 [cited by applicant]
US 20150339373A1 · Carlson · 2015 [cited by applicant]
US 20160050589A1 · Safavi · 2016 [cited by examiner]
US 20160063590A1 · Subramanya · 2016 [cited by applicant]
US 20160239336A1 · Bingham et al. · 2016 [cited by applicant]
US 20160350487A1 · Plunkett · 2016 [cited by applicant]
US 20170123701A1 · Lee · 2017 [cited by applicant]
US 20170139961A1 · Baum et al. · 2017 [cited by applicant]
US 20170155557A1 · Desai et al. · 2017 [cited by applicant]
US 20180191867A1 · Siebel et al. · 2018 [cited by applicant]
US 20180100041A1 · Tilikin et al. · 2018 [cited by applicant]
US 20180302306A1 · Carroll · 2018 [cited by applicant]
US 20180302807A1 · Chen · 2018 [cited by examiner]
CN 104885077A · 2015 [cited by applicant]
CN 108540327A · 2018 [cited by applicant]
JP 2008027315A · 2008 [cited by applicant]
JP 2010541426A · 2010 [cited by applicant]
JP 2014230041A · 2014 [cited by applicant]
JP 2015184704A · 2015 [cited by applicant]
JP 2017005891A · 2017 [cited by applicant]
JP 2017162450A · 2017 [cited by applicant]
KR 20170096133A · 2017 [cited by applicant]
WO WO2020092637A1 · 2020 [cited by applicant]
Japanese Office Action issued for Japanese Patent Application No. 2021-523899, dated Oct. 27, 2023, 15 pages with English language translation. [cited by applicant]
China National Intellectual Property Administration, Office Action issued for Chinese Patent Application No. 201980087711.8, dated Mar. 28, 2024, 26 pages with English language translation. [cited by applicant]
EP19877797.1 Extended European Search Report dated Jun. 14, 2022. [cited by applicant]
Li et al., “Graph Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting,” arXiv:1707.01926v1, Submitted on Jul. 6, 2017, Retrieved Jul. 12, 2022 at URL: https://arxiv.org/pdf/1707.01926v1, 12 pages. [cited by applicant]
Mateos et al., “Dynamic Network Catography,” IEEE Signal Processing Magazine, Nov. 29, 2012, Retrieved Mar. 4, 2020 from URL: https://arxiv.org/pdf/1211.6950.pdf, 21 pages. [cited by applicant]
PCT/US2019/058951 International Preliminary Report on Patentability dated Apr. 27, 2021. [cited by applicant]
PCT/US2019/058951 International Search Report and Written Opinon dated Feb. 7, 2020. [cited by applicant]
Talukdar et al., “Exact Topology Reconstruction of Radial Dynamical Systems with Applications to Distribution System of the Power Grid,” arXiv:1703.00847v1, Submitted on Mar. 2, 2017, Retrieved Jul. 12, 2022 at URL: htt… [cited by applicant]
Korean Intellectual Property Office, Official Action issued for Korean Patent Application No. 10-2021-7016431, dated Jul. 23, 2024, 20 pages with English language translation. [cited by applicant]
China National Intellectual Property Administration, Office Action issued for Chinese Patent Application No. 201980087711.8, dated Oct. 25, 2024, 10 pages with English language translation. [cited by applicant]