IP Library › Granted Patent US 12,535,605
Granted Patent B2
US 12,535,605 · App. 18/483,982 · Granted Jan 27, 2026

Seismic data interpretation system

Inventors: Michael Beam (Spring, TX); Gilles Besançon (Houston, TX); Cyril Lagrange (Gatwick, GB); Jan Dolejší (Gatwick, GB)
Assignee: SCHLUMBERGER TECHNOLOGY CORPORATION
G01V1/28G06F9/50G06F9/5027G06F9/54G01V1/282G01V1/284G01V2210/70G06Q10/0631
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,535,605
App. No.
18/483,982
Granted
Jan 27, 2026
Kind
B2
Abstract

A method can include receiving a digital operational plan that specifies computational tasks for seismic workflows, that specifies computational resources and that specifies execution information; dispatching instructions that provision the computational resources for one of the computational tasks for one of the seismic workflows; issuing a request for the execution information; receiving the requested execution information during execution of the one of the computational tasks using the provisioned computational resources; and, based on the received execution information indicating that the execution of the one of the computational tasks deviates from the digital operational plan, dispatching at least one additional instruction that provisions at least one additional computational resource for the one of the computational tasks for the one of the seismic workflows.

Claims (40)

1 . A method comprising:

executing a digital operational plan comprising a plurality of computational tasks, wherein the digital operational plan includes a plurality of constraints associated with the plurality of computational tasks;

provisioning one or more resources to perform a computational task of the plurality of computational tasks;

based on the provisioning of the one or more resources, monitoring operation of the computational task of the plurality of computational tasks for a plurality of monitoring conditions, wherein the plurality of monitoring conditions includes a change to a processing algorithm of at least one of the plurality of computational tasks;

based on the plurality of monitoring conditions identifying that a constraint has been exceeded, determining that performance of the computational task is not according to the digital operational plan;

based on the performance, adjusting the digital operational plan to an adjusted digital operational plan;

based on the adjusted digital operational plan, adjusting the one or more resources to generate one or more adjusted resources;

determining to maintain the digital operational plan based on the one or more adjusted resources; and

maintaining the digital operational plan.

2 . The method of claim 1 , wherein executing the digital operational plan comprises performing the plurality of computational tasks in series.

3 . The method of claim 1 , wherein executing the digital operational plan comprises performing the plurality of computational tasks in parallel.

4 . The method of claim 1 , further comprising utilizing the one or more resources to perform the computational task.

5 . The method of claim 1 , further comprising monitoring the performance of the computational task.

6 . The method of claim 1 , further comprising de-provisioning the one or more adjusted resources based on monitoring the performance of the computational task.

7 . The method of claim 1 , wherein the plurality of computational tasks is associated with a seismic workflow.

8 . The method of claim 7 , wherein the seismic workflow comprises a seismic survey task.

9 . The method of claim 8 , wherein the seismic survey task comprises distributing sensors in an environment according to an acquisition geometry.

10 . The method of claim 1 , wherein the plurality of monitoring conditions further includes data-related conditions and human-related conditions.

11 . A system comprising:

one or more processors; and

memory coupled to the one or more processors, the memory storing instructions configured to cause the one or more processors to:

execute a digital operational plan comprising a plurality of computational tasks, wherein the digital operational plan includes a plurality of constraints associated with the plurality of computational tasks;

provision one or more resources to perform a computational task of the plurality of computational tasks;

based on the provision of the one or more resources, monitor operation of the computational task of the plurality of computational tasks for a plurality of monitoring conditions, wherein the plurality of monitoring conditions includes a change to a processing algorithm of at least one of the plurality of computational tasks;

adjust the one or more resources to generate one or more adjusted resources based on determining that performance of the computational task is not according to the digital operational plan; and

maintain the digital operational plan based on the one or more adjusted resources.

12 . The system of claim 11 , wherein the instructions are configured to cause the one or more processors to determine whether the one or more adjusted resources maintain a schedule of the digital operational plan.

13 . The system of claim 12 , wherein the instructions are configured to cause the one or more processors to maintain the digital operational plan based on determining that the one or more adjusted resources maintain the schedule of the digital operational plan.

14 . The system of claim 11 , further comprising a display, wherein the instructions are configured to cause the one or more processors to render a computational trend indicator for the computational task on the display.

15 . The system of claim 14 , wherein the computational trend indicator indicates whether the performance of the computational task is slowing down or speeding up.

16 . The system of claim 11 , wherein the digital operational plan comprises execution information.

17 . The system of claim 16 , further comprising a display, wherein the instructions are configured to cause the one or more processors to render a portion of the execution information to the display based on actuation of a graphical control for the computational task of the plurality of computational tasks.

18 . One or more non-transitory, tangible, computer-readable media storing instructions that cause one or more processors to:

execute a digital operational plan comprising a plurality of computational tasks, wherein the digital operational plan includes a plurality of constraints associated with the plurality of computational tasks;

provision one or more resources to perform a computational task of the plurality of computational tasks;

based on the provision of the one or more resources, monitor operation of the computational task of the plurality of computational tasks for a plurality of monitoring conditions, wherein the plurality of monitoring conditions includes a change to a processing algorithm of at least one of the plurality of computational tasks;

adjust the one or more resources to generate one or more adjusted resources based on determining that performance of the computational task is not according to the digital operational plan; and

maintain the digital operational plan based on the one or more adjusted resources.

19 . The one or more non-transitory, tangible, computer-readable media of claim 18 , wherein the instructions further cause the one or more processors to render a timeline on a display that comprises timings for at least a portion of the plurality of computational tasks.

20 . The one or more non-transitory, tangible, computer-readable media of claim 18 , wherein the instructions further cause the one or more processors to schedule provisioning of the one or more resources.

Continuity (4)
Continuation 17052695
Provisional Application 62670803 · May 13, 2018
Provisional Application 62670737 · May 12, 2018
Related Publication 20240053500A1 · Feb 15, 2024
References Cited (151)
US 4642782A · Kemper · 1987 [cited by applicant]
US 6516891B1 · Dallas · 2003 [cited by applicant]
US 8738414B1 · Nagar et al. · 2014 [cited by applicant]
US 8775347B2 · Goel et al. · 2014 [cited by applicant]
US 8914268B2 · Dale · 2014 [cited by applicant]
US 8914300B2 · Sustaeta · 2014 [cited by applicant]
US 8990383B1 · Ghidireac · 2015 [cited by examiner]
US 9015093B1 · Commons · 2015 [cited by applicant]
US 9396181B1 · Sripada · 2016 [cited by applicant]
US 9665090B2 · Loganathan · 2017 [cited by applicant]
US 9805316B2 · Nettleton · 2017 [cited by applicant]
US 10268453B1 · Ong · 2019 [cited by applicant]
US 10740730B2 · Altamirano · 2020 [cited by applicant]
US 11423493B2 · Fox · 2022 [cited by applicant]
US 20020049575A1 · Jalali et al. · 2002 [cited by applicant]
US 20020062156A1 · Yamakawa et al. · 2002 [cited by applicant]
US 20030208392A1 · Shekar · 2003 [cited by applicant]
US 20040078778A1 · Leymann · 2004 [cited by applicant]
US 20040088115A1 · Guggari et al. · 2004 [cited by applicant]
US 20050209836A1 · Klumpen et al. · 2005 [cited by applicant]
US 20050209912A1 · Veeningen et al. · 2005 [cited by applicant]
US 20050278303A1 · Ruml · 2005 [cited by applicant]
US 20070043607A1 · Howard · 2007 [cited by applicant]
US 20070198223A1 · Ella et al. · 2007 [cited by applicant]
US 20070299711A1 · Lundberg · 2007 [cited by applicant]
US 20080275594A1 · de Guzman · 2008 [cited by applicant]
US 20080281525A1 · Boone · 2008 [cited by applicant]
US 20080294387A1 · Anderson · 2008 [cited by applicant]
US 20080306803A1 · Vaal et al. · 2008 [cited by applicant]
US 20090132458A1 · Edwards et al. · 2009 [cited by applicant]
US 20090152005A1 · Chapman et al. · 2009 [cited by applicant]
US 20090265110A1 · Narayanan · 2009 [cited by applicant]
US 20100100409A1 · Rahi · 2010 [cited by applicant]
US 20100299172A1 · Nottoli · 2010 [cited by applicant]
US 20100306149A1 · Baum · 2010 [cited by applicant]
US 20110082717A1 · Saad · 2011 [cited by applicant]
US 20110155463A1 · Khromov · 2011 [cited by applicant]
US 20110238458A1 · Purcell · 2011 [cited by applicant]
US 20110251932A1 · Early · 2011 [cited by applicant]
US 20120054246A1 · Fischer · 2012 [cited by applicant]
US 20120096463A1 · Agarwal · 2012 [cited by applicant]
US 20120166967A1 · Deimbacher · 2012 [cited by applicant]
US 20120185286A1 · Do · 2012 [cited by applicant]
US 20130124249A1 · de Leon · 2013 [cited by applicant]
US 20130231787A1 · Chapman et al. · 2013 [cited by applicant]
US 20140007097A1 · Chin · 2014 [cited by applicant]
US 20140208253A1 · Pettus · 2014 [cited by applicant]
US 20140214469A1 · Callow et al. · 2014 [cited by applicant]
US 20140237487A1 · Prasanna · 2014 [cited by applicant]
US 20140246238A1 · Abbassian et al. · 2014 [cited by applicant]
US 20150073715A1 · Aarre · 2015 [cited by applicant]
US 20150193711A1 · Lavrov · 2015 [cited by applicant]
US 20150278734A1 · Grant · 2015 [cited by applicant]
US 20160026940A1 · Johnson · 2016 [cited by applicant]
US 20160075019A1 · Tabuchi · 2016 [cited by applicant]
US 20160189318A1 · Hein · 2016 [cited by applicant]
US 20160252897A1 · Ashok et al. · 2016 [cited by applicant]
US 20160253634A1 · Thomeer · 2016 [cited by applicant]
US 20160326846A1 · Rashid · 2016 [cited by applicant]
US 20160356125A1 · Bello · 2016 [cited by applicant]
US 20160358120A1 · Moore · 2016 [cited by applicant]
US 20170152728A1 · Abou-Sayed · 2017 [cited by applicant]
US 20170249574A1 · Knijnik · 2017 [cited by applicant]
US 20170293994A1 · Li · 2017 [cited by applicant]
US 20170370191A1 · Fox et al. · 2017 [cited by applicant]
US 20180012310A1 · Fox et al. · 2018 [cited by applicant]
US 20180032928A1 · Li · 2018 [cited by applicant]
US 20180075544A1 · Passolt et al. · 2018 [cited by applicant]
US 20180100392A1 · Kleinguetl · 2018 [cited by applicant]
US 20180143858A1 · Sanjabi · 2018 [cited by examiner]
US 20180299849A1 · Martin · 2018 [cited by applicant]
US 20180341252A1 · Lu · 2018 [cited by applicant]
US 20190153701A1 · Gates · 2019 [cited by applicant]
US 20190205484A1 · Morkos et al. · 2019 [cited by applicant]
US 20190213040A1 · Ohba · 2019 [cited by applicant]
US 20190226314A1 · Dasys · 2019 [cited by applicant]
US 20190302310A1 · Fox · 2019 [cited by applicant]
US 20190325534A1 · Perry · 2019 [cited by applicant]
US 20190330968A1 · Boone · 2019 [cited by applicant]
US 20190333164A1 · Fox · 2019 [cited by applicant]
US 20190354911A1 · Alaniz · 2019 [cited by applicant]
US 20200080412A1 · Johnsen · 2020 [cited by applicant]
US 20200081882A1 · Cheriton · 2020 [cited by applicant]
US 20200174455A1 · Fox · 2020 [cited by applicant]
US 20200175443A1 · Fox · 2020 [cited by applicant]
US 20200175444A1 · Fox · 2020 [cited by applicant]
US 20200291764A1 · Chahine · 2020 [cited by applicant]
US 20200355059A1 · Zhang · 2020 [cited by applicant]
US 20200410622A1 · Bhat · 2020 [cited by applicant]
US 20210140294A1 · Mollatt · 2021 [cited by applicant]
CN 101809538A · 2010 [cited by applicant]
CN 102289347A · 2011 [cited by applicant]
CN 102484619A · 2012 [cited by applicant]
WO 2016172031A1 · 2016 [cited by applicant]
WO 2017070025A1 · 2017 [cited by applicant]
WO 2017079178A1 · 2017 [cited by applicant]
WO 2019209947A1 · 2019 [cited by applicant]
WO 2019222033A1 · 2019 [cited by applicant]
Calheiros et al., “Virtual Machine Provisioning Based on Analytical Performance and QoS in Cloud Computing Environments” 2011 IEEE (Year: 2011). [cited by examiner]
Fox, M., and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. J. Artif. Int. Res. 20(1):61{124. [cited by applicant]
Firby, Adaptive Execution in Complex Dynamic Worlds. Ph.D. Thesis, Yale University Department of Comuter Science, 1989. [cited by applicant]
Simmons et al., “A Task Description Language for Robot Control”, Proceedings of the Conference on Intelligent Robotics and Systems, Vancouver, Canada, Oct. 1998, pp. 1931-1937. [cited by applicant]
Gat, E., “ESL: A Language for Supporting Robust Plan Execution in Embedded Autonomous Agents”, Proceedings of the AAAI Fall Symposium on Plan Execution, 1996, pp. 319-324. [cited by applicant]
Berry, G., The esterel v5 Language Primer, version 5.21 release 2.0, Centre de Mathematiques Appliquees, Ecole des Mines and INRIA, Apr. 6, 1999, 140 pgs. [cited by applicant]
Ingham et al., 2001: A Reactive Model-Based Programming Language for Robotic Space Explorers, Proceedings of ISAIRAS-01, 8 pages. [cited by applicant]
Berry et al., “The ESTEREL synchronous programming language: design, semantics, implementation”, Science of Computer Programming, 19(2): 87-152, 1992. [cited by applicant]
Coles et al., “Forward-chaining partial-order planning”, In Proceedings of the 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, Toronto, Ontario, Canada, May 12-16, 2010, pp. 42-49, 2010. [cited by applicant]
Henzinger, “The Theory of Hybrid Automata”, in Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278-292, 1996. [cited by applicant]
Lamport, “Time, clocks, and the ordering of events in a distributed system”, Communications of the ACM, 21(7): 558-565, 1978. [cited by applicant]
Williams et al., “Model-based programming: Controlling embedded systems by reasoning about hidden state”, in Principles and Practice of Constrant Programming—CP 2002, 8th International Conference, CP 2002, Ithaca, NY, U… [cited by applicant]
Apt et al., “Towards a theory of declarative knowledge”, in Foundations of Deductive Databases and Logic Programming, pp. 89-148, 1988. [cited by applicant]
Bacchus et al., “Downward Refinement and the Efficiency of Hierarchical Problems-Solving”, Artificial Intelligence, vol. 71, pp. 43-100, 1994. [cited by applicant]
Bernardini et al., “Leveraging Probabilistic Reasoning in Deterministic Planning for Large-Scale Autonomous Search-and-Tracking”, in Proc. 26th International Conference on Automated Planning and Scheduling (ICAPS), pp. … [cited by applicant]
Bonasso et al., “Experiences with an Architecture for Intelligent Reactive Agent”, Journal of Experimental and Theoretical Artificial Intelligence (JETAI), 9, 1997, 24 pages. [cited by applicant]
Coddington et al., “Madbot: A motivated and goal directed robot”, in Proc. Of National conference on AI (AAAI), vol. 20, pp. 1680, 2005. [cited by applicant]
Fox et al., “Exploration of the Robustness of Plans”, in Proc. 21st National Conference on Artificial Intelligence (AAAI), pp. 834-839, 2006. [cited by applicant]
Gat, “On Three-Layer Architecutes”, Artificial Intelligence and Mobile Robots, 195, 11 pages, 1998. [cited by applicant]
Gregory et la., “Planning Modulo Theories: Extending the Planning Paradigm”, in Proc. 22nd International Conference on Automated Planning and Scheduling (ICAPS), 2012, 9 pages. [cited by applicant]
Hoffmann et al., “The FF Planning Systems: Fast Plan Generation Through Heuristic Search”, J. Artif. Intell. Res. (JAIR), 14:253-302, 2001. [cited by applicant]
Howey et al., “VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL”, in Proc. 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 294-301, 2004. [cited by applicant]
Koymans et al., “Specifying Real-Time Properties with Metric Temporal Logic”, Real-Time Systems, 2(4): 255-299, 1990. [cited by applicant]
McGann et la., “A Deliberative architecture for AUV Control”, in Proc. IEEE International Conference on Robotics and Automation (ICRA), pp. 1049-1054, 2008. [cited by applicant]
Nieuwenhuis, “SAT modulo theories: Enhancing SAT with special-purpose algorithms”, in Proc. 12th International Conference on Theory and Applications of Satisfiability Testing (SAT), p. 1, 2009. [cited by applicant]
Williams et al., “Model-based Programming of Intelligent Embedded Systems and Robotic Space Explorers”, Proceedings of the IEEE, 91(1): 212-237, 2003. [cited by applicant]
Yoon et al., “FF-Replan: A Baseline for Probabilistic Planning”, in Proc. 17th International Conference on Automated Planning and Scheduling (ICAPS), 2007, 8 pages. [cited by applicant]
Bajada, J. et al., “Load Modelling and Simulation of Household Electricity Consumption for the Evaluation of Demand-Side Management Strategies,” 4th IEEE PES Innovative Smart Grid Technologies Europe, Oct. 6-9, 2013, Co… [cited by applicant]
Coles, A. et al., “Managing concurrency in temporal planning using planner-scheduler interaction”, Artificial Intelligence 173, 2009, pp. 1-44. [cited by applicant]
Erol, K. et al., “UMCP: A Sound and Complete Procedure for Hierarchical Task-Network Planning”, AIPS 1994 Proceedings, pp. 249-254. [cited by applicant]
Fox, M. et al., “Explainable Planning”, IJCAI-17 Workshop on Explainable AI, Melbourne, Aug. 2017, 7 pages. [cited by applicant]
International Search Report and Written Opinion issued in International Patent Application No. PCT/US2019/031645, dated Aug. 20, 2019, 17 pages. [cited by applicant]
International Preliminary Report on Patentability issued in International Patent Application No. PCT/US2019/031645, dated Nov. 26, 2020, 12 pages. [cited by applicant]
Johnsen, S.O. O. et al., “Proactive Indicators To Control Risks in Operations of Oil and Gas Fields”, SPE-126560, Spe Economics & Management, 2012, 4(2), pp. 90-105. [cited by applicant]
Awasthi, A. et al., “Closign the Gap Between Reservoir modeling and Production Optimization”, SPE-107463, presented at the Digital Energy Conference and Exhibition, Houston, Texas, U.S.A., 2007. [cited by applicant]
“Overlay”, Apr. 8, 2015, Merriam Webster. [cited by applicant]
Naghdy, Fazel, and Naeem Anjum, “Discrete-event modelling, simulation and control of a distributed manipulation environment”, 1997, Robotica 15(2), pp. 181-198. [cited by applicant]
Xu, Yingzhuo, and Hanqi Hu, “Research of cooperative system for drilling design based on Smart Client”, 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, vol. 3, IEEE, 2010. [cited by applicant]
Balssubramanian, Sivaram, and Douglas H. Norrie, “A multiagent architecture for concurrent design, process planning, routing, and scheduling”, 1996 Concurrent Engineering 4 (1), pp. 7-16. [cited by applicant]
Marier, A., A. El Mhamedi, and Z. Binder, “Analysis of a computer-aided teleoperation process by means of generalized stochastic Petri nets”, 1997, Control Engineering Practice 5 (7), pp. 931-942. [cited by applicant]
Verfaillie, A timeline, event, and constraint-based modeling framework for planning and scheduling problems, Jun. 10, 2013, https://icaps13.icaps-conference.org/wp-content/uploads/2013/05/keps13-proceedings.pdf#page=62,… [cited by applicant]
David, R. M. et al., “Managing and Orchestrating Multi-Vendor Intelligent Oil Field Technology Environment to Enable Efficient Next Generation Production and Reservoir Management Workflows”, SPE-176773-MS, presented at … [cited by applicant]
“Lock”, Merriam-Webster.com: https://www.merriam-webster.com, Mar. 7, 2023, 4 pages. [cited by applicant]
International Search Report and Written Opinion issued in the PCT Application PCT/US2019/031641, dated Jul. 17, 2019 (11 pages). [cited by applicant]
International Preliminary Report on Patentability issued in the PCT Application PCT/US2019/031641, dated Nov. 26, 2020 (8 pages). [cited by applicant]
Extended Search Report issued in European Patent Application 19802620.5 dated Jan. 3, 2022, 12 pages. [cited by applicant]
Anonymous: “Planning Domain Definition Language—Wikipedia”, 26, Mar. 2018, pp. 1-8. Retrieved from the internet: [URL:https://en.wikipedia.org/w/index.php?title=Planning_Domain_Definition_Language&oldid=832433831] retri… [cited by applicant]
Nogueira, T. et al., “Autonomously Controlling Flexible Timelines: From Domain-independent Planning to Robust Execution”, 2017, 2017 IEEE Aerospace Conference, 15 pages. [cited by applicant]
Dvorak, F. et al., “Planning and Acting with Temporal and Hierarchical Decomposition Models”, 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence. [cited by applicant]
Ingrand, Felix et al., “Deliberation for autonomous robots: A Survey”, Artificial Intelligence, 2017 (247), pp. 10-44. [cited by applicant]
Talcott, C. et al., “Soft Agents: Exploring Soft Constraints to Model Robust Adaptive Distributed Cyber-Physical Agent Systems”, Software, Services, and Systems, Cham: Springer Interntional Puslishing, 2015, pp. 273-290. [cited by applicant]
Pardo, P. et al., “Cooperative Dialogues for Defeasible Argumentation-based Planning”, in Argumentation in Multi-Agent Systems, Berlin, Heidelberg: Springer, 2011, pp. 174-193. [cited by applicant]
Hertle, A. et al., “Efficient Audition Based Coordination for Distributed Multi-agent Planning in Temporal Domains Using Resource Abstraction”, in KI 2018: Advances in Artificial Intelligence, Springer, 2018, pp. 86-98. [cited by applicant]