Method, device, medium and equipment for determining positions and number of drilling centers based on oil reservoir target division

Abstract

The invention relates to a method and device for determining the position and number of drilling centers based on oil reservoir target division, a medium and equipment. The method comprises the steps that geological data of oil reservoir targets are obtained; coordinates and connection constraint conditions of m oil reservoir target spots are input into the calculation model; initializing data, giving position coordinates of m oil reservoir target spots, dividing the oil reservoir target spots into m groups, selecting k groups from the existing k + 1 groups, and calculating geometric centers of the groups; only one target point closest to the geometric center of each group is reserved, the geometric center of each group is updated, then the remaining target points are distributed to the group closest to the geometric center of each group, and the geometric center of the group is updated at the same time; judging whether each group of target point number meets a connection constraint condition or not; if k groups fail to be divided, all grouping results with the grouping number ranging from m to k + 1 and the positions, the number and the specifications of the corresponding manifolds are returned, and a selectable scheme is provided for optimization of the underwater layout.

Description

Technical Field

[0001] The invention relates to a method, a device, a medium and equipment for determining the position and number of drilling centers based on reservoir target point division, and belongs to the technical field of liquefied natural gas. Background Art

[0002] The underwater wellheads associated with the reservoir targets are usually connected to the floating platform through the manifold (drilling center), PLEM, underwater connection facilities and other gathering and transportation equipment, as well as submarine transmission pipelines. When the coordinates of the reservoir targets are known, the reservoir targets are divided into groups. Under the premise of satisfying the constraints of the connection between the targets and the manifold, the sum of the distances from each target to the manifold is minimized, thereby determining the manifold position, number and well slot type, and obtaining the layout plan of the manifold.

[0003] Deepwater oil and gas field development mostly adopts underwater production systems, and the rationality of their layout directly affects the development cost and feasibility of the oil field. Cluster manifolds are key facilities for the layout of underwater production systems. The optimal number and position of cluster manifolds are taken as the core of the research on the optimization of underwater production system layout. The research results form a mathematical model of underwater production system layout with cluster manifolds as the core, which can provide an optimization plan for the layout of underwater production systems.

[0004] The method of Xu Xiaoxuan et al. selects the number and diameter of risers according to the obtained crude oil production of the deepwater oil field, selects the mooring point of the FPSO according to the obtained distribution of underwater wellheads, obtains the feasible layout points of the FPSO based on the mooring points of the FPSO, groups the wellheads according to the feasible layout points of the FPSO and the obtained number of cluster well manifolds to obtain grouping data, layouts the obtained cluster well manifolds, obtains the connection relationship between the FPSO and the cluster well manifold based on the grouping data and the laid out slave well manifolds, and optimizes the mooring position of the FPSO, the diameter and number of risers, the diameter of the submarine pipeline, the wellhead grouping, the cluster well manifold layout, and the connection relationship between the cluster well manifold and the FPSO.

[0005] The above method has the following disadvantages: Disadvantage 1: The process of manifold layout is complicated. The FPSO's mooring point is selected according to the distribution of the underwater wellheads obtained. The FPSO's feasible layout point is obtained based on the FPSO's mooring point. Then the wellheads are grouped according to the FPSO's feasible layout point and the obtained number of cluster well manifolds, and finally the manifold layout is obtained. This method needs to obtain many conditions to calculate the manifold layout, and the process is complicated. Disadvantage 2: The manifold layout cannot be calculated from the original data. The data relied on by this method include the distribution of underwater wellheads, the FPSO's mooring point, the FPSO's feasible layout point and the number of cluster well manifolds. These data are not the original data in the underwater production layout system engineering. They are all obtained through secondary calculation and analysis by other methods. If there is a deviation in a certain step, the deviation will be amplified in the subsequent processing steps, resulting in the final manifold layout plan to be wrong or have a large error. Summary of the invention

[0006] In view of the above technical problems, the present invention provides a method, device, medium and equipment for determining the position and number of drilling centers based on reservoir target point division. The method can be used to optimize the position and number of manifolds in the underwater production system layout optimization problem, lay the foundation for the subsequent finding of the optimal floating platform and pipeline backconnection, and provide a reference for solving the underwater production system layout plan with the minimum investment.

[0007] To achieve the above object, the present invention adopts the following technical solutions:

[0008] A method for determining the location and number of drilling centers based on reservoir target point division, comprising:

[0009] S1: Obtain geological data of reservoir targets;

[0010] S2: Input the coordinates and connection constraints of m reservoir targets into the computational model;

[0011] S3: Initialize data. Given the position coordinates of m reservoir targets, divide the reservoir targets into m groups, with 1 point in each group, and set k = m;

[0012] S4: Let k = k-1, select k groups from the existing k+1 groups, and calculate the geometric center of each group;

[0013] S5: Each group only retains one target point that is closest to its geometric center and updates the geometric center of each group. Then, the remaining targets are assigned to the group that is closest to the center of each group and the geometric center of the group is updated at the same time.

[0014] S6: Determine whether the number of target points in each group meets the connection constraint condition of step S2. If so, select two groups from each group and divide the targets therein into two groups again. If not, the division into k groups fails, and all grouping results with grouping numbers from m to k+1 and the position, quantity and specification of the corresponding manifolds are returned.

[0015] S7: If the distance between the reservoir target points of each group and the geometric center of the group does not exceed the maximum distance between the target point and the center, the reservoir target points can be divided into k groups under the connection condition, and the process goes to step S4; otherwise, the process goes to step S8;

[0016] S8: If the division into k groups fails, all grouping results from m to k+1 and the corresponding positions, quantities and specifications of the manifolds are returned to provide optional solutions for optimizing the underwater layout.

[0017] In the above method for determining the location and number of drilling centers based on reservoir target point division, preferably, the connection constraint condition of step S2 is:

[0018] One reservoir target corresponds to one wellhead, which is connected to one manifold;

[0019] The distance from the reservoir target to the drilling center is recorded as L, and the maximum distance of L does not exceed Lmax;

[0020] The maximum number of wellheads that can be connected to each manifold is Wmax, that is, each group contains no more than Wmax reservoir targets.

[0021] In the method for determining the location and number of drilling centers based on reservoir target point division, preferably, in step S4, k groups are selected from the existing k+1 groups, and the targets are allocated to the k groups so that the total loss Loss is as small as possible:

[0022]

[0023] Among them, P i，j is the coordinate of the jth target point of the i-th group, μ i is the geometric center of the i-th group, k i is the number of targets included in the i-th group.

[0024] In the method for determining the location and number of drilling centers based on reservoir target point division, preferably, the specific steps of step S4 are as follows:

[0025] For the above k groups, determine the initial geometric center μ of each group according to the original target of each group i , the coordinates of the initial geometric center are calculated as follows:

[0026]

[0027] Initial geometric center μ i The coordinates are k of the i-th group i The average value of the target coordinates;

[0028] All targets are redistributed into k groups. To ensure that all targets are distributed into k groups, firstly, each initial geometric center μ i , the distance μ between the reservoir target points i The nearest target is assigned to the i-th group, ensuring that each group has at least one target, and updating the coordinates μ of the geometric center according to the target coordinates of each group. i , assign the remaining targets to the geometric center μ under the premise of satisfying the connection conditions i The nearest group and update the geometric center coordinates μ of the group i .

[0029] In the method for determining the location and number of drilling centers based on reservoir target point division, preferably, in step S6, if the connection constraint condition of step S2 is satisfied, two groups are selected from each group, and the target points therein are redivided into two groups, and the specific steps are as follows:

[0030] Find the two reservoir target points with the farthest distance between the two groups and use them as the geometric centers of the two groups obtained by regrouping;

[0031] Divide the other targets in the two groups into two groups under the connection constraint conditions, ensuring that the targets are divided into the group closer to the geometric center, thus obtaining a feasible solution x0;

[0032] According to the feasible solution x0, the function intlinprog in MATLAB for solving mixed integer linear programming is called to obtain the solution x, thereby obtaining the optimal grouping scheme for re-dividing the original two groups of targets.

[0033] A second aspect of the present invention provides a device for determining the location and number of drilling centers based on reservoir target point division, comprising:

[0034] A first processing unit, for obtaining geological data of a target reservoir;

[0035] A second processing unit is used to input the coordinates and connection constraints of m reservoir target points into the calculation model;

[0036] The third processing unit is used to initialize data, given the position coordinates of m reservoir target points, divide the reservoir target points into m groups, each group has 1 point, and set k = m;

[0037] The fourth processing unit is used to set k=k-1, select k groups from the existing k+1 groups, and calculate the geometric center of each group;

[0038] A fifth processing unit is used for retaining only one target point closest to the geometric center of each group and updating the geometric center of each group, and then allocating the remaining target points to the group closest to the center of each group, and updating the geometric center of the group at the same time;

[0039] The sixth processing unit is used to determine whether the number of target points in each group meets the connection constraint condition of the second processing unit. If the connection constraint condition of the second processing unit is met, two groups are selected from each group, and the targets therein are divided into two groups again. If the connection constraint condition of the second processing unit is not met, the division into k groups fails, and all grouping results with grouping numbers from m to k+1 and the position, quantity and specification of the corresponding manifold are returned;

[0040] The seventh processing unit is used to determine if the distance between each group of reservoir target points and the geometric center of the group does not exceed the maximum distance from the target point to the center, then the reservoir target points can be divided into k groups under the connection condition, and then the fourth processing unit is turned, otherwise, the eighth processing unit is turned;

[0041] The eighth processing unit is used to return all grouping results from m to k+1 and the positions, quantities and specifications of the corresponding manifolds if the grouping into k groups fails, so as to provide an optional solution for optimizing the underwater layout.

[0042] A third aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any one of the above-mentioned methods for determining the location and number of drilling centers based on reservoir target point division.

[0043] A fourth aspect of the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the steps of any one of the above-mentioned methods for determining the location and number of drilling centers based on reservoir target point division are implemented.

[0044] The present invention adopts the above technical solution, which has the following advantages:

[0045] 1. The present invention groups reservoir targets according to the connection requirements of the underwater production system layout, thereby determining the drilling center position (manifold position), quantity, and required manifold quantity and specifications.

[0046] 2. The present invention aims to provide a method for grouping reservoir targets and determining the manifold position (drilling center position), the number of manifolds and the type of manifolds, so as to form a layout plan for the manifolds. The method groups the reservoir targets under the following connection conditions so that the sum of the distances from each group of reservoir targets to the geometric center of the group to which it belongs is minimized. Accordingly, the position of the geometric center of each group is taken as the position of the drilling center (i.e., the position of the manifold), and the number of drilling centers is the number of groups. At the same time, the number of well slots of the manifold can be determined according to the number of reservoir targets contained in each group. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 A diagram showing the coordinates and initial grouping of 41 reservoir target points provided in one embodiment of the present invention;

[0048] Figure 2 A result diagram showing that the reservoir targets provided in this embodiment of the present invention are divided into 6 groups;

[0049] Figure 3 The result diagram of the reservoir target points provided in this embodiment of the present invention being divided into 7 groups;

[0050] Figure 4 The result diagram of the reservoir target points provided in this embodiment of the present invention being divided into 8 groups;

[0051] Figure 5 This is a flow chart of the reservoir target point grouping algorithm provided in this embodiment of the present invention. DETAILED DESCRIPTION

[0052] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention is described clearly and completely below. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary persons in the art without creative work are within the scope of protection of the present invention.

[0053] Unless otherwise defined, the technical or scientific terms used in the present invention shall have the usual meanings understood by persons with ordinary skills in the field to which the present invention belongs. The words "first", "second", "third", "fourth" and similar terms used in the present invention do not indicate any order, quantity or importance, but are only used to distinguish different components. Words such as "include" or "comprise" and the like mean that the elements or objects appearing before the word include the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Words such as "connect" or "connected" and the like are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect.

[0054] For ease of description, spatially relative terms may be used herein to describe the relationship of one element or feature relative to another element or feature as shown in the figures, such as "inside", "outside", "inner side", "outer side", "below", "above", etc. Such spatially relative terms are intended to include different orientations of the device in use or operation in addition to the orientation depicted in the figures.

[0055] The existing manifold determination method has the following disadvantages: Disadvantage 1: The process of manifold layout is complicated. The FPSO's mooring point is selected according to the distribution of the underwater wellheads obtained. The FPSO's feasible layout point is obtained based on the FPSO's mooring point. Then the wellheads are grouped according to the FPSO's feasible layout point and the obtained number of cluster well manifolds, and finally the manifold layout is obtained. This method needs to obtain many types of conditions to calculate the manifold layout, and the process is complicated. Disadvantage 2: The manifold layout cannot be calculated from the original data. The data relied on by this method include the distribution of underwater wellheads, the FPSO's mooring point, the FPSO's feasible layout point and the number of cluster well manifolds. These data are not the original data in the underwater production layout system engineering. They are all obtained through secondary calculation and analysis by other methods. If there is a deviation in a certain step, the deviation will be amplified in the subsequent processing steps, resulting in the final manifold layout plan to be wrong or have a large error.

[0056] Based on the above technical problems, the present invention provides a method, device, medium and equipment for determining the position and number of drilling centers based on reservoir target point division. The method can be used to optimize the position and number of manifolds in the underwater production system layout optimization problem, lay the foundation for the subsequent finding of the optimal floating platform and pipeline backconnection, and provide a reference for solving the underwater production system layout plan with the minimum investment.

[0057] like Figure 1 As shown, the method for determining the location and number of drilling centers based on reservoir target point division provided by the present invention includes the following specific steps:

[0058] Step 1: Obtain geological data of the reservoir target (coordinates of the reservoir target);

[0059] Step 2: Input the coordinates and connection constraints of m reservoir targets into the computational model;

[0060] The connection constraints are as follows: (1) One reservoir target corresponds to one wellhead and is connected to one manifold; (2) The distance from the reservoir target to the drilling center is L, and the maximum distance of L does not exceed Lma x ; (3) The maximum number of wellheads that can be connected to each manifold is Wma x , that is, each group contains no more than Wma reservoir targets x indivual.

[0061] Step 3: Data initialization

[0062] Initialize the data, give the position coordinates of m reservoir target points, divide the reservoir target points into m groups, each group has 1 point, let k = m. At this time, the 1 point contained in each group is the geometric center point of the group, satisfying that the sum of the distances between the points in each group and their geometric center deviations is minimized. Figure 1 The coordinates and initial grouping of 41 reservoir targets are given.

[0063] Step 4: Let k:=k-1;

[0064] Step 5: Assign reservoir targets into k groups

[0065] Select k groups from the existing k+1 groups (here we select the first k groups), and assign the targets to these k groups so that the total loss is as small as possible.

[0066]

[0067] Among them, P i，j is the coordinate of the jth target point of the i-th group, μ i is the geometric center of the i-th group, k i is the number of targets included in the i-th group. The specific steps are as follows:

[0068] 1. For the above k groups, determine the initial geometric center μ of each group according to the original target of each group i , the initial geometric center coordinates are calculated as follows:

[0069]

[0070] Initial geometric center μ i The coordinates are k of the i-th group i The average value of the target coordinates.

[0071] 2. Reassign all targets into k groups. To ensure that all targets are assigned to k groups, first assign each initial geometric center μ i , the distance μ between the reservoir target points i The nearest target is assigned to the i-th group, ensuring that each group has at least one target, and updating the coordinates μ of the geometric center according to the target coordinates of each group. i . Assign the remaining targets to the geometric center μ under the premise of meeting the connection conditions. i The nearest group and update the geometric center coordinates μ of the group iIf the reservoir target cannot be assigned to one of the k groups under the premise of meeting the connection conditions, the algorithm cannot divide the target into k groups, and the output is a grouping scheme that divides the reservoir target into k+1 groups. Otherwise, select 2 groups from the k groups and redivide the targets into 2 groups using the integer linear programming method, so as to continuously improve the grouping scheme of the reservoir target until the preset accuracy requirements are met.

[0072] The method of re-dividing a total of n targets in two groups (which means that the targets in the two groups meet the connection conditions and there must be a feasible solution for re-dividing into two groups) is as follows:

[0073] 1. Find the two reservoir target points with the farthest distance between the two groups and use them as the geometric centers of the two groups obtained by regrouping;

[0074] 2. Divide the other targets in the two groups into two groups while satisfying the connection conditions, ensuring that the targets are assigned to the group that is closer to the geometric center. This gives a feasible solution x0 for the following integer programming problem.

[0075]

[0076] stAx≤b

[0077] Bx=c

[0078] x(i)∈{0,1}

[0079] Where, f = [f 1，1 , f 2，1 , ..., f n，1 , f 1，2 , f 2，2 , ..., f n，2 ]′∈R 2n , f i，j is the distance between the i-th target point and the j-th group geometric center, x = [x 1，1 , x 2，1 , ..., x n，1 , x 1，2 , x 2，2 , ..., x n，2 ]′∈R 2n , the objective function represents the sum of the distances from the target point to the geometric center of the group.

[0080]

[0081] The elements of the first n columns of the first row and the last n columns of the second row of the matrix A are all 1, and the other elements are all 0. b0 is the maximum number of wellheads that can be connected to the manifold, Wmax. The constraint condition Ax≤b means that after the n reservoir targets are divided into two groups, the number of reservoir targets in each group does not exceed b0, that is, does not exceed Wmax.

[0082]

[0083] The first n columns and the last n columns of the matrix B are n-order identity matrices. The constraint condition Bx=c means that each reservoir target point can only be assigned to one of the two groups.

[0084] According to the initial feasible solution x0 of the above optimization problem, the function intlinprog for solving mixed integer linear programming in MATLAB is called to obtain the solution x of the above integer programming problem, thereby obtaining the optimal grouping scheme for re-dividing the original two groups of targets.

[0085] Step 6: Check whether the distance from the reservoir target to the center satisfies the connection constraint

[0086] If the distance between each group of reservoir targets and the geometric center of the group does not exceed Lmax, the reservoir targets can be divided into k groups under the connection condition, and go to step 2. Otherwise, go to step 5.

[0087] Step 7: Output the reservoir target grouping results

[0088] Steps 1 to 6 divide the reservoir targets into m groups, m-1 groups, ..., under given connection conditions, until they cannot be further divided into groups with fewer groups. All grouping schemes, as well as the corresponding manifold positions (drilling center positions), manifold quantity and specifications are output to provide optional schemes for optimizing underwater layout.

[0089] According to the above algorithm, 41 targets are divided into groups, where each group contains no more than 10 targets, that is, Wma x = 10, the distance from the target to the center of the group does not exceed 6 units, that is, Lma x =6. Since the constraint condition cannot be satisfied when there are less than 6 groups, the grouping result is divided into at least 6 groups, and the maximum number of groups is 41 groups (i.e., m groups). The triangles in the figure are reservoir targets, and the black dots are the geometric center of each group, that is, the drilling center. The following are the results of dividing 41 reservoir targets into 6 groups, 7 groups, and 8 groups, as shown in Figure 2-4 As shown ( Figure 1 The coordinates and initial grouping of 41 reservoir targets. Figure 5 Flowchart of the algorithm for grouping reservoir targets).

[0090] The present invention realizes grouping of reservoir targets according to optimization objectives under the grouping constraint conditions that the number of reservoir targets in each group does not exceed a specified number and the distance from the target to the geometric center of the group does not exceed a specified length. For the possible number of groups, the algorithm gives a grouping scheme for the reservoir targets and establishes an integer programming model for optimizing the grouping scheme.

[0091] The present invention groups the reservoir targets under the connection termination condition so that the sum of the distances from each group of reservoir targets to the geometric center of the group to which they belong is minimized. Accordingly, the position of the geometric center of each group is taken as the position of the drilling center (i.e., the position of the manifold), and the number of drilling centers is the number of groups. At the same time, the number of well slots of the manifold can be determined according to the number of reservoir targets included in each group.

[0092] A second aspect of the present invention provides a device for determining the location and number of drilling centers based on reservoir target point division, comprising:

[0093] A first processing unit, for obtaining geological data of a target oil reservoir;

[0094] A second processing unit is used to input the coordinates and connection constraints of m reservoir target points into the calculation model;

[0095] The third processing unit is used to initialize data, given the position coordinates of m reservoir target points, divide the reservoir target points into m groups, each group has 1 point, and set k = m;

[0096] The fourth processing unit is used to set k=k-1, select k groups from the existing k+1 groups, and calculate the geometric center of each group;

[0097] A fifth processing unit is used for retaining only one target point closest to the geometric center of each group and updating the geometric center of each group, and then allocating the remaining target points to the group closest to the center of each group, and updating the geometric center of the group at the same time;

[0098] The sixth processing unit is used to determine whether the number of target points in each group meets the connection constraint condition of the second processing unit. If the connection constraint condition of the second processing unit is met, two groups are selected from each group, and the targets therein are divided into two groups again. If the connection constraint condition of the second processing unit is not met, the division into k groups fails, and all grouping results with grouping numbers from m to k+1 and the position, quantity and specification of the corresponding manifold are returned;

[0099] The seventh processing unit is used to determine if the distance between each group of reservoir target points and the geometric center of the group does not exceed the maximum distance from the target point to the center, then the reservoir target points can be divided into k groups under the connection condition, and then the fourth processing unit is turned, otherwise, the eighth processing unit is turned;

[0100] The eighth processing unit is used to return all grouping results from m to k+1 and the positions, quantities and specifications of the corresponding manifolds if the grouping into k groups fails, so as to provide an optional solution for optimizing the underwater layout.

[0101] A third aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any one of the above-mentioned methods for determining the location and number of drilling centers based on reservoir target point division.

[0102] A fourth aspect of the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the steps of any one of the above-mentioned methods for determining the location and number of drilling centers based on reservoir target point division are implemented.

[0103] The present invention is described in terms of flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to specific embodiments. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0104] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0105] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0106] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for determining the location and number of drilling centers based on reservoir target point division, characterized in that: include: S1: Obtain geological data of reservoir targets; S2: Input the coordinates and connection constraints of m reservoir targets into the computational model; S3: Initialize data. Given the position coordinates of m reservoir targets, divide the reservoir targets into m groups, with 1 point in each group, and set k = m; S4: Let k = k-1, select k groups from the existing k+1 groups, and calculate the geometric center of each group; S5: Each group only retains one target point that is closest to its geometric center and updates the geometric center of each group. Then, the remaining targets are assigned to the group that is closest to the center of each group and the geometric center of the group is updated at the same time. S6: Determine whether the number of target points in each group meets the connection constraint condition of step S2. If so, select two groups from each group and divide the targets therein into two groups again. If not, the division into k groups fails, and all grouping results with grouping numbers from m to k+1 and the position, quantity and specification of the corresponding manifolds are returned. S7: If the distance between the reservoir target points of each group and the geometric center of the group does not exceed the maximum distance between the target point and the center, the reservoir target points can be divided into k groups under the connection condition, and the process goes to step S4; otherwise, the process goes to step S8; S8: If the division into k groups fails, all grouping results from m to k+1 and the corresponding positions, quantities and specifications of the manifolds are returned to provide optional solutions for optimizing the underwater layout.

2. The method for determining the location and number of drilling centers based on reservoir target point division according to claim 1, characterized in that: The connection constraints of step S2 are: One reservoir target corresponds to one wellhead, which is connected to one manifold; The distance from the reservoir target to the drilling center is recorded as L, and the maximum distance of L does not exceed Lmax; The maximum number of wellheads that can be connected to each manifold is Wmax, that is, each group contains no more than Wmax reservoir targets.

3. The method for determining the location and number of drilling centers based on reservoir target point division according to claim 1, characterized in that: In step S4, k groups are selected from the existing k+1 groups, and the targets are assigned to these k groups so that the total loss Loss is as small as possible: Among them, P i,j is the coordinate of the jth target point of the i-th group, μ i is the geometric center of the i-th group, k i is the number of targets included in the i-th group.

4. The method for determining the location and number of drilling centers based on reservoir target point division according to claim 3, characterized in that: The specific steps of step S4 are as follows: For the above k groups, determine the initial geometric center μ of each group according to the original target of each group i , the coordinates of the initial geometric center are calculated as follows: Initial geometric center μ i The coordinates are k of the i-th group i The average value of the target coordinates; All targets are redistributed into k groups. To ensure that all targets are distributed into k groups, firstly, each initial geometric center μ i , the distance μ between the reservoir target points i The nearest target is assigned to the i-th group, ensuring that each group has at least one target, and updating the coordinates μ of the geometric center according to the target coordinates of each group. i , assign the remaining targets to the geometric center μ under the premise of satisfying the connection conditions i The nearest group and update the geometric center coordinates μ of the group i .

5. The method for determining the location and number of drilling centers based on reservoir target point division according to claim 4, characterized in that: In step S6, if the connection constraint condition of step S2 is met, two groups are selected from each group, and the targets therein are divided into two groups again. The specific steps are as follows: Find the two reservoir target points with the farthest distance between the two groups and use them as the geometric centers of the two groups obtained by regrouping; Divide the other targets in the two groups into two groups under the connection constraint conditions, ensuring that the targets are divided into the group closer to the geometric center, thus obtaining a feasible solution x0; According to the feasible solution x0, the function intlinprog in MATLAB for solving mixed integer linear programming is called to obtain the solution x, thereby obtaining the optimal grouping scheme for re-dividing the original two groups of targets.

6. A device for determining the location and number of drilling centers based on reservoir target point division, characterized in that: include: A first processing unit, for obtaining geological data of a target reservoir; A second processing unit is used to input the coordinates and connection constraints of m reservoir target points into the calculation model; The third processing unit is used to initialize data, given the position coordinates of m reservoir target points, divide the reservoir target points into m groups, each group has 1 point, and set k = m; The fourth processing unit is used to set k=k-1, select k groups from the existing k+1 groups, and calculate the geometric center of each group; A fifth processing unit is used for retaining only one target point closest to the geometric center of each group and updating the geometric center of each group, and then allocating the remaining target points to the group closest to the center of each group, and updating the geometric center of the group at the same time; The sixth processing unit is used to determine whether the number of target points in each group meets the connection constraint condition of the second processing unit. If the connection constraint condition of the second processing unit is met, two groups are selected from each group, and the targets therein are divided into two groups again. If the connection constraint condition of the second processing unit is not met, the division into k groups fails, and all grouping results with grouping numbers from m to k+1 and the position, quantity and specification of the corresponding manifold are returned; The seventh processing unit is used to determine if the distance between each group of reservoir target points and the geometric center of the group does not exceed the maximum distance from the target point to the center, then the reservoir target points can be divided into k groups under the connection condition, and then the fourth processing unit is turned, otherwise, the eighth processing unit is turned; The eighth processing unit is used to return all grouping results from m to k+1 and the positions, quantities and specifications of the corresponding manifolds if the grouping into k groups fails, so as to provide an optional solution for optimizing the underwater layout.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for determining the location and number of drilling centers based on reservoir target point division as described in any one of claims 1 to 5 are implemented.

8. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method for determining the location and number of drilling centers based on reservoir target point division as described in any one of claims 1 to 5 are implemented.

Images