-
公开(公告)号：US07460957B2
公开(公告)日：2008-12-02
申请号：US11300496
申请日：2005-12-14
CPC分类号： E21B47/022 , E21B7/04 , E21B43/305
摘要： A novel method is presented to automatically design a multi-well development plan given a set of previously interpreted subsurface targets. This method identifies the optimal plan by minimizing the total cost as a function of existing and required new platforms, the number of wells, and the drilling cost of each of the wells. The cost of each well is a function of the well path and the overall complexity of the well.
摘要翻译： 提出了一种新颖的方法来自动设计一个以前解释的地下目标集合的多井开发计划。 该方法通过将总成本最小化为现有和所需的新平台，井数以及每个井的钻井成本的函数来确定最优计划。 每个井的成本是井的路径和井的整体复杂度的函数。
-
公开(公告)号：US20090056935A1
公开(公告)日：2009-03-05
申请号：US12263668
申请日：2008-11-03
IPC分类号： E21B43/30
CPC分类号： E21B47/022 , E21B7/04 , E21B43/305
摘要： A novel method is presented to automatically design a multi-well development plan given a set of previously interpreted subsurface targets. This method identifies the optimal plan by minimizing the total cost as a function of existing and required new platforms, the number of wells, and the drilling cost of each of the wells. The cost of each well is a function of the well path and the overall complexity of the well.
摘要翻译： 提出了一种新颖的方法来自动设计一个以前解释的地下目标集合的多井开发计划。 该方法通过将总成本最小化为现有和所需的新平台，井数以及每个井的钻井成本的函数来确定最优计划。 每个井的成本是井的路径和井的整体复杂度的函数。
-
公开(公告)号：US07684929B2
公开(公告)日：2010-03-23
申请号：US12263668
申请日：2008-11-03
CPC分类号： E21B47/022 , E21B7/04 , E21B43/305
摘要： A novel method is presented to automatically design a multi-well development plan given a set of previously interpreted subsurface targets. This method identifies the optimal plan by minimizing the total cost as a function of existing and required new platforms, the number of wells, and the drilling cost of each of the wells. The cost of each well is a function of the well path and the overall complexity of the well.
摘要翻译： 提出了一种新颖的方法来自动设计一个以前解释的地下目标集合的多井开发计划。 该方法通过将总成本最小化为现有和所需的新平台，井数以及每个井的钻井成本的函数来确定最优计划。 每个井的成本是井的路径和井的整体复杂度的函数。
-
-
搜索结果
3 条记录 (耗时 0.025 秒)
