IP Library › Granted Patent US 12,524,716
Granted Patent B2
US 12,524,716 · App. 16/412,479 · Granted Jan 13, 2026

Operations management network system and method

Inventors: Ivan Alaniz (McAllen, TX); Jan Dolejsi (Gatwick, GB); Jonathan Wun Shiung Chong (Richmond, TX); Dhananjay Raju (Anupuram, IN); Vladimir Lifschitz (Austin, TX)
Assignee: SCHLUMBERGER TECHNOLOGY CORPORATION
G06Q10/06313G06Q10/063114G06Q10/063118G06Q10/06316E21B43/2607
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,524,716
App. No.
16/412,479
Granted
Jan 13, 2026
Kind
B2
Abstract

Methods for operating wellsites utilized supplies from supply sites. For each wellsite, wellsite inputs for wellsite status, wellsite goals, and rate of consumption of supplies to attain the wellsite goals can be provided. For each supply site, supply site inputs for inventory of supplies, logistics of supply chain, and logistics of re-supply can be provided. Based on the inputs, an efficient detailed plan can be generated to include actions to be taken and corresponding times. The detailed plan can be provided as a schedule to permit stewarding or accomplishment of each action at each corresponding time. Also disclosed are non-transitory, computer readable media, computer systems, and systems for implementing the methods.

Claims (32)

1 . A method comprising:

operating a plurality of wellsites that utilize supplies from a plurality of supply sites remote from the plurality of wellsites, including:

for each wellsite, providing wellsite inputs relating to operational status of equipment of the wellsite, maintenance status of the equipment of the wellsite, goals for the wellsite, and rate of consumption of supplies utilized to attain the goals for the wellsite, wherein the goals for the wellsite comprise a list of equipment to be utilized to attain the goals for the wellsite, a list of personnel to be utilized to attain the goals for the wellsite, and a list of tasks to be completed, and an order in which the tasks are to be completed, to attain the goals for the wellsite;

for each supply site, providing supply site inputs relating to inventory of supplies, logistics of supply chain between the supply site and each wellsite, and logistics of re-supply of supplies to the supply site;

based on the wellsite inputs and the supply site inputs, generating a current detailed plan comprising a plurality of actions to be taken and a corresponding time for each action to be taken, wherein the current detailed plan minimizes aggregate non-productive time (NPT) for the plurality of wellsites, within constraints of the wellsite inputs and the supply site inputs; and

providing the current detailed plan as a schedule to permit stewarding or accomplishment of each action at each corresponding time;

delivering supplies to the wellsites utilizing the current detailed plan;

performing a fracturing operation with the delivered supplies at the wellsites, the fracturing operation performed by operational equipment of at least one wellsite and controlled by a wellsite controller;

using information obtained and transmitted by a plurality of sensors associated with the operational equipment of the at least one wellsite to determine and update, if applicable, the operational status and the maintenance status of the operational equipment as at least part of the wellsite inputs; and

after generation of an initial detailed plan, analyzing each wellsite input and/or each supply site input, utilizing a cyclic regressive method, to either validate the current detailed plan without changes or cause one or more changes to replace the current detailed plan with an updated plan if a wellsite input is updated, the cyclic regressive method utilizing a slow optimization loop, wherein the decisions from the slow optimization loop are cascaded to a medium planning/scheduling loop, and to a fast operational control loop; and

automatically controlling, via the wellsite controller, the operational equipment of the at least one wellsite to move, mix, separate, pressurize, or measure fluids, materials, or mixtures and to inject the fluids, the materials, or the mixtures into a wellbore at the wellsite to perform the fracturing operation in conjunction with the current detailed plan or the updated plan, wherein automatically controlling, via the wellsite controller, the operational equipment of the at least one wellsite comprises providing as an input a type of proppant of a plurality of types of proppant to be used as the materials as well as a rate of the proppant to be used as selected to correspond to the fracturing operation at the at least one wellsite to facilitate resource production at the at least one wellsite.

2 . The method of claim 1 wherein at least some of the goals comprising or associated with the list of equipment, the list of personnel, or the list of tasks are based on historical information pertaining to operation, goals, or logistics involving the plurality of wellsites.

3 . The method of claim 1 wherein the current detailed plan:

minimizes aggregate operating costs for the wellsites and the supply sites within constraints of the wellsite inputs and the supply site inputs; and

maximizes aggregate resource production at the wellsites within constraints of the wellsite inputs and the supply site inputs.

4 . The method of claim 1 wherein the wellsite inputs are stored in and provided by one or more wellsite module communication devices that are physically separate from one or more supply site module communication devices in which the supply site inputs are stored or input and from which the supply site inputs are provided.

5 . The method of claim 4 wherein the current detailed plan is generated via at least one planning center module communication device, such that the actions and corresponding times are itemized for being stewarded and/or accomplished by a planning center user via the at least one planning center module communication device.

6 . The method of claim 5 wherein each planning center module communication device is physically separate from the wellsites and the supply sites.

7 . The method of claim 1 wherein the wellsite inputs and supply site inputs comprise historical information about operation, goals, and logistics involving the wellsites and the supply sites, and wherein generating the current detailed plan includes dynamic prioritization of certain actions to attain certain goals without allocation of weighting amongst inputs being entered by a user.

8 . The method of claim 1 wherein the actions comprise a schedule of dispatch actions and corresponding times at which a specific transportation equipment is to be sent to a specific wellsite or supply site to unload or load, respectively, a specific one of the materials.

9 . The method of claim 1 wherein the actions comprises a schedule of dispatch actions and corresponding times at which a specific transportation equipment is to be held at a specific wellsite or supply site or to be returned to a neutral site, awaiting instruction to load, unload, or move to another wellsite, supply site, or neutral site.

10 . The method of claim 1 wherein at least one of the wellsite inputs and supply site inputs utilized for generating the current detailed plan is remotely sensed and automatically provided.

11 . The method of claim 10 wherein at least one of the wellsite inputs and supply site inputs utilized for generating the current detailed plan is provided by a user based on observation.

12 . The method of claim 1 wherein the wellsite inputs for each wellsite comprise an estimation of time, manpower, and parts for converting a non-operational piece of equipment having no operational status or a failure condition in maintenance status into an operational piece of equipment having an operational status or a non-failure condition in maintenance status.

13 . The method of claim 1 wherein the wellsite inputs for each wellsite comprise:

a list of pieces of available equipment that are involved in attaining the goals for that wellsite and of supplies available at each supply site, or otherwise attainable through a distributor, that are involved in attaining the goals for that wellsite; or

a current location for each piece of available equipment and each supply in the list of pieces of available equipment.

14 . The method of claim 1 wherein the wellsite inputs for each wellsite comprise an intended length of time over which the current detailed plan is to be implemented and across which aggregate NPT for the plurality of wellsites is to be minimized.

15 . The method of claim 1 wherein the wellsite inputs comprise an input based on planning, execution, and/or completion of various tasks of the fracturing operation and/or other operations performed by the operational equipment of the at least one wellsite.

16 . The method of claim 1 wherein generating the current detailed plan comprises utilizing a PDDL (Planning Domain Definition Language)-based model.

17 . The method of claim 1 wherein generating the current detailed plan comprises utilizing an answer set programming (ASP)-based model.

18 . The method of claim 1 wherein the information obtained and transmitted by a plurality of sensors is aggregated and analyzed in a state inference stage prior to determining and updating, if applicable, the operational status and the maintenance status of the operational equipment.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 24, 2020
From: ALANIZ, IVAN; DOLEJSI, JAN; CHONG, JONATHAN WUN SHIUNG; RAJU, DHANANJAY; LIFSCHITZ, VLADIMIR
To: SCHLUMBERGER TECHNOLOGY CORPORATION
Reel/Frame 053570/0865 →
Continuity (2)
Provisional Application 62671760 · May 15, 2018
Related Publication 20190354911A1 · Nov 21, 2019
References Cited (168)
US 4642782A · Kemper et al. · 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 et al. · 2014 [cited by applicant]
US 8914300B2 · Sustaeta · 2014 [cited by applicant]
US 9015093B1 · Commons · 2015 [cited by applicant]
US 9396181B1 · Sripada et al. · 2016 [cited by applicant]
US 9665090B2 · Loganathan et al. · 2017 [cited by applicant]
US 9805316B2 · Nettleton · 2017 [cited by applicant]
US 10268453B1 · Ong et al. · 2019 [cited by applicant]
US 10740730B2 · Altamirano · 2020 [cited by examiner]
US 11423493B2 · Fox · 2022 [cited by examiner]
US 20020049575A1 · Jalali · 2002 [cited by examiner]
US 20020062156A1 · Yamakawa et al. · 2002 [cited by applicant]
US 20030208392A1 · Shekar · 2003 [cited by examiner]
US 20040078778A1 · Leymann et al. · 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 et al. · 2008 [cited by applicant]
US 20080300708A1 · Ruml et al. · 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 et al. · 2009 [cited by applicant]
US 20100100409A1 · Rahi · 2010 [cited by examiner]
US 20100299172A1 · Nottoli · 2010 [cited by examiner]
US 20100306149A1 · Baum · 2010 [cited by applicant]
US 20110082717A1 · Saad · 2011 [cited by applicant]
US 20110155463A1 · Khromov et al. · 2011 [cited by applicant]
US 20110238458A1 · Purcell et al. · 2011 [cited by applicant]
US 20110251932A1 · Early et al. · 2011 [cited by applicant]
US 20120054246A1 · Fischer · 2012 [cited by applicant]
US 20120096463A1 · Agarwal et al. · 2012 [cited by applicant]
US 20120166967A1 · Deimbacher et al. · 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 et al. · 2014 [cited by applicant]
US 20140208253A1 · Pettus et al. · 2014 [cited by applicant]
US 20140214469A1 · Callow et al. · 2014 [cited by applicant]
US 20140237487A1 · Prasanna et al. · 2014 [cited by applicant]
US 20140246238A1 · Abbassian et al. · 2014 [cited by applicant]
US 20150073715A1 · Aarre · 2015 [cited by applicant]
US 20150193711A1 · Lavrov et al. · 2015 [cited by applicant]
US 20150278734A1 · Grant et al. · 2015 [cited by applicant]
US 20160026940A1 · Johnson · 2016 [cited by applicant]
US 20160075019A1 · Tabuchi et al. · 2016 [cited by applicant]
US 20160189318A1 · Hein et al. · 2016 [cited by applicant]
US 20160252897A1 · Ashok et al. · 2016 [cited by applicant]
US 20160253634A1 · Thomeer · 2016 [cited by examiner]
US 20160326846A1 · Rashid et al. · 2016 [cited by applicant]
US 20160356125A1 · Bello et al. · 2016 [cited by applicant]
US 20160358120A1 · Moore · 2016 [cited by examiner]
US 20170152728A1 · Abou-Sayed et al. · 2017 [cited by applicant]
US 20170249574A1 · Knijnik et al. · 2017 [cited by applicant]
US 20170277203A1 · Castillo-Effen et al. · 2017 [cited by applicant]
US 20170293994A1 · Li et al. · 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 et al. · 2018 [cited by applicant]
US 20180075544A1 · Passolt · 2018 [cited by examiner]
US 20180100392A1 · Kleinguetl et al. · 2018 [cited by applicant]
US 20180299849A1 · Martin et al. · 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 et al. · 2019 [cited by applicant]
US 20190302310A1 · Fox et al. · 2019 [cited by applicant]
US 20190325534A1 · Perry · 2019 [cited by examiner]
US 20190330968A1 · Boone et al. · 2019 [cited by applicant]
US 20190333164A1 · Fox et al. · 2019 [cited by applicant]
US 20200080412A1 · Johnsen et al. · 2020 [cited by applicant]
US 20200081882A1 · Cheriton · 2020 [cited by applicant]
US 20200174455A1 · Fox et al. · 2020 [cited by applicant]
US 20200175443A1 · Fox et al. · 2020 [cited by applicant]
US 20200291764A1 · Chahine et al. · 2020 [cited by applicant]
US 20200355059A1 · Zhang et al. · 2020 [cited by applicant]
US 20200410622A1 · Bhat · 2020 [cited by examiner]
US 20210140294A1 · Mollatt · 2021 [cited by applicant]
CN 101809538 · 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 WO2019209947A1 · 2019 [cited by examiner]
WO 2019222033A1 · 2019 [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/keps 13-proceedings.pdf#page=62… [cited by examiner]
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]
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]
Office Action issued in U.S. Appl. No. 16/208,625 dated Oct. 26, 2021, 34 pages. [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 Hangi 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]
Balasubramanian, 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]
Office Action issued in U.S. Appl. No. 16/208,644 dated Dec. 15, 2021, 44 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,644 dated Aug. 20, 2021, 35 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,625 dated Sep. 9, 2022, 49 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,644 dated Jul. 22, 2022, 34 pages. [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]
“Overlay”, Merriam-Webster.com: https://www.merriam-webster.com, Mar. 7, 2023, 1 page. [cited by applicant]
“Lock”, Merriam-Webster.com: https://www.merriam-webster.com, Mar. 7, 2023, 4 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,625 dated Mar. 17, 2023, 48 pages. [cited by applicant]
1 Office Action issued in U.S. Appl. No. 16/208,644 dated Feb. 15, 2023, 45 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”,Mar. 26, 2018, pp. 1-8. Retrieved from the internet: [URL:https://en.wikipedia.org/w/index.php?title=Planning_Domain_Definition_Language&oldid=832433831] retrie… [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,644 dated May 8, 2023, 46 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,625 dated Aug. 31, 2023, 65 pages. [cited by applicant]
Office Action and Search Report issued in Norway Patent Application No. 20201174 dated Aug. 23, 2023, 4 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,644 dated Oct. 11, 2023, 53 pages. [cited by applicant]
First Office Action and Search Report issued in China Patent Application No. 2019800385749 dated Oct. 11, 2023, 12 pages with English translation. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,644 dated Feb. 12, 2024, 52 pages. [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]
First Office Action and Search Report issued in China Patent Application No. 201980045491.2 dated Nov. 8, 2023, 14 pages with English translation. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,625 dated Jan. 17, 2024, 74 pages. [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]
Office Action issued in U.S. Appl. No. 16/208,625 dated May 9, 2024, 88 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 16/208,644 dated Jun. 21, 2024, 53 pages. [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]
Office Action issued in U.S. Appl. No. 16/208,625 dated May 5, 2024, 88 pages. [cited by applicant]
Notice of Allowance issued in U.S. Appl. No. 16/208,625 dated Sep. 24, 2024, 25 pages. [cited by applicant]
Article 94(3) issued in European Patent Appl. No. 19802620.5 on Oct. 8, 2024. 10 pages. [cited by applicant]
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]