A method, system, device, and medium for arranging excitation points along a path

Abstract

The present invention belongs to the field of oil and gas geophysical exploration, and discloses a method, a system, a device and a medium for arranging excitation points along a path. The method includes constructing an excitation point grid according to the boundary of excitation points in the work area, the excitation point spacing, and the excitation line spacing; traversing each excitation point grid to obtain the path data within the grid; removing the invalid paths within the grid according to the limitation of the minimum excitation point spacing; and selecting the point closest to the center point of the grid from the path data within the grid as the excitation point position of the current grid. The excitation points arranged by the present invention are more evenly distributed as a whole. There is only one excitation point in each grid, which is not affected by the richness of the path data, and avoids the situation of over-dense arrangement of excitation points when the paths increase. Therefore, the arranged excitation points are more general and stable.

Description

Technical Field

[0001] The present invention relates to the field of oil and gas geophysical exploration, mainly to the optimal design of seismic acquisition excitation points, and specifically to a method, system, device and medium for arranging excitation points along a path. Background Art

[0002] During the seismic acquisition construction process, affected by the actual terrain and surface obstacles, the theoretical excitation point positions cannot be staked out and need to be adjusted according to the surface conditions. When there are roads in the work area, in order to facilitate construction, excitation points can be preferentially arranged on the roads. According to the staking rules of excitation points, reasonably arranging the excitation points on the roads and making the distribution of excitation points as uniform as possible is a difficult problem.

[0003] In actual construction, usually in the Kron software, the excitation points are evenly arranged along the road according to the designed excitation point spacing, and the duplicate excitation points with a relatively short distance are removed. This approach will result in the inconsistency between the direction of the work area path and the direction of the excitation line, and the overall arrangement of the excitation points is not uniform enough; when there are relatively rich paths in the work area, the number of arranged excitation points will increase. At this time, redundant excitation points need to be deleted. If the operation is improper, it will also affect the overall uniformity of the excitation points. Summary of the Invention

[0004] To solve the above deficiencies in the prior art, the present invention aims to provide a method, system, device and medium for arranging excitation points along a path, which can make the positions of the arranged excitation points more uniform, not affected by the richness of path data, and the arranged excitation points are more general and stable.

[0005] To achieve the above object, the technical solution adopted by the present invention is as follows: A method for arranging excitation points along a path, including the following steps carried out in sequence: S1. Construct an excitation point grid according to the excitation point boundary, excitation point spacing, and excitation line spacing of the work area; S2. Traverse each excitation point grid and obtain the path data within the grid; S3. Remove the invalid paths within the grid according to the limitation of the minimum excitation point spacing; S4. Select the point closest to the center point of the grid from the path data within the grid as the excitation point position of the current grid.

[0006] As a limitation of the present invention: Step S1 specifically includes: S11. Calculate the outer bounding box of the excitation points according to the excitation point boundary, determine the starting point of the arranged grid, and the range of the arranged grid, the width of the range is Ws, and the height is Hs; S12. Along the excitation line direction, use the excitation point spacing as the grid step size, and perpendicular to the excitation line direction, use the excitation line spacing as the step size to form a grid covering the entire range of the outer bounding box of the excitation points.

[0007] As a definition of the present invention: Step S12 specifically includes obtaining the maximum number of grids in the x-direction and y-direction respectively by using the formulas Nx = ROUND(Ws / SLI) and Ny = ROUND(Hs / SI), where Nx is the maximum number of grids in the x-direction, Ny is the maximum number of grids in the y-direction, ROUND is the rounding function, SLI is the excitation line distance, and SI is the excitation point distance.

[0008] As a definition of the present invention: In step S12, if the grids formed to cover the entire outer bounding box range of the excitation points are irregular or their boundaries have holes, remove the grid points outside the excitation boundary range to obtain the final grid set.

[0009] As a definition of the present invention: Step S2 specifically includes traversing each excitation point grid and obtaining the path set within the grid by performing superposition intersection calculation on the outer bounding rectangle of the grid and the paths in the work area.

[0010] As a definition of the present invention: Step S3 specifically includes: S31. When arranging an excitation point in the current grid, if there are already arranged excitation points around, perform the judgment of the minimum point distance to ensure that the excitation point distance between the newly arranged excitation point and the surrounding excitation points is greater than the set value; S32. Set the minimum excitation point distance as d, take the current grid as the center, search for the adjacent 8 grids. If there are already arranged excitation points in the adjacent grids, draw a circle with the already arranged excitation points as the center and the minimum excitation point distance d as the radius to form a circular set; S33. Take the circular set as the superposition element and perform superposition subtraction operation on the path set within the current grid and the circular set within the adjacent grids to obtain the path data within the grid.

[0011] As a definition of the present invention: Step S4 specifically includes traversing the line segment set, obtaining the minimum distance from the grid center point to each line segment, and finding the point closest to the grid center point on the line segment with the minimum distance as the excitation point position of the current grid.

[0012] As a definition of the present invention: A system for arranging excitation points along a path includes an excitation point grid construction module for constructing an excitation point grid according to the excitation point boundary, excitation point distance, and excitation line distance in the work area; a path data obtaining module for traversing each excitation point grid to obtain the path data within the grid; an invalid path removal module for removing the invalid paths within the grid according to the limitation of the minimum excitation point distance; and an excitation point position determination module for selecting the point closest to the grid center point from the path data within the grid as the excitation point position of the current grid.

[0013] As a definition of the present invention: An electronic device includes a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the method of arranging excitation points along a path is implemented.

[0014] As a definition of the present invention: A computer-readable storage medium stores a computer program for executing the method of arranging excitation points along a path.

[0015] Due to the adoption of the above technical solution, compared with the prior art, the beneficial effects achieved by the present invention are as follows: By performing grid processing on the work area and calculating the path data within the grid, according to the principle of minimum distance, redundant path information within the grid is removed, and the path point information closest to the midpoint of the grid is obtained, thereby completing the work of arranging excitation points based on the path. The excitation points arranged by the foregoing method are more evenly distributed as a whole. There is only one excitation point in each grid, and it is not affected by the richness of path data, avoiding the situation of over-dense arrangement of excitation points when the number of paths increases. Therefore, the arranged excitation points are more general and stable. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0017] Figure 1 It is a flowchart of a method for arranging excitation points along a path according to Embodiment 1 of the present invention;

[0018] Figure 2 It is a schematic diagram of grid processing of the work area according to Embodiment 1 of the present invention;

[0019] Figure 3 It is a distribution diagram of the boundary of the work area and the paths within the work area according to Embodiment 1 of the present invention;

[0020] Figure 4 It is a schematic diagram of a partial work area after grid processing according to Embodiment 1 of the present invention;

[0021] Figure 5 It is a path distribution diagram of Grid A according to Embodiment 1 of the present invention;

[0022] Figure 6 It is a path distribution diagram after the superposition and intersection of Grid A and the surrounding rectangle outside the grid according to Embodiment 1 of the present invention;

[0023] Figure 7 It is a path distribution diagram after the difference operation of the superposition of Grid A and the set of circles according to Embodiment 1 of the present invention;

[0024] Figure 8 It is a diagram of the arrangement position of excitation points in Grid A according to Embodiment 1 of the present invention;

[0025] Figure 9It is an effect diagram of arranging excitation points along a path in the traditional way;

[0026] Figure 10 It is an effect diagram of arranging excitation points along a path based on a grid in Embodiment 1 of the present invention;

[0027] Figure 11 It is a system structure block diagram of arranging excitation points along a path in Embodiment 2 of the present invention;

[0028] Figure 12 It is a schematic structural diagram of an electronic device in Embodiment 3 of the present invention. Specific embodiments

[0029] The following describes the preferred embodiments of the present invention with reference to the accompanying drawings. It should be understood that a method, system, device, and medium for arranging excitation points along a path described herein are all preferred embodiments, and are only used to illustrate and explain the present invention, and do not constitute a limitation to the present invention.

[0030] Embodiment 1

[0031] A method for arranging excitation points along a path, taking a certain work area in the western region as an example, as Figure 1 shown, includes the following steps carried out in sequence:

[0032] S1. According to the excitation point boundary (SB), excitation point distance (SI), and excitation line distance (SLI) of the work area, construct an excitation point grid;

[0033] S1 specifically includes the following steps:

[0034] S11. As Figure 2 shown, calculate the outer bounding box of the excitation points according to the excitation point boundary (SB), determine the starting point (x0, y0) of the grid to be arranged, and the range of the grid to be arranged, the width of the range is Ws, and the height is Hs;

[0035] S12. Along the excitation line direction, use the excitation point distance (SI) as the grid step size, and perpendicular to the excitation line direction, use the excitation line distance (SLI) as the step size to form a grid covering the entire range of the outer bounding box of the excitation points. As Figure 3 and Figure 4 shown, in this embodiment, the excitation point distance SI is preferably 40 m, and the excitation line distance SLI is preferably 200 m. The work area is divided into uniform grids with sizes of 40 m and 200 m along the excitation line direction and perpendicular to the excitation line direction respectively.

[0036] The maximum number of grids in the x - direction and y - direction are obtained using the formulas Nx = ROUND(Ws / SLI) and Ny = ROUND(Hs / SI) respectively, where Nx is the maximum number of grids in the x - direction, Ny is the maximum number of grids in the y - direction, and ROUND is the rounding function. If the grids forming the outer bounding box of the entire excitation point are irregular or have holes in their boundaries, remove the grid points not within the excitation boundary (SB) range to obtain the final grid set {Cell(i,j)∈CellCollection|i≤Nx,j≤Ny,Center(i,j)∈SB}, where Cell(i,j) is the grid in the i - th row and j - th column, and Center(i,j) is the center point of the grid.

[0037] S2. Traverse each excitation - point grid and obtain the path data within the grid;

[0038] Specifically, the paths in the work area are a linear set of graphics {Path(k)∈PathCollection|k≤Np}, where Np is the total number of paths in the work area. As Figure 5 and Figure 6 shown, for grid A, the paths within the grid are calculated by Path(i,j)=Box(i,j)∩PathCollection. The set of paths within the grid is {Path(i,j,m)∈Path(i,j)|i≤Nx,j≤Ny,m≤N(i,j)}, where Path(i,j) is the set of paths within grid Cell(i,j), N(i,j) is the number of paths calculated within grid Cell(i,j), and Box(i,j) is the outer bounding rectangle of grid Cell(i,j). By superimposing and intersecting Box(i,j) with each path Path(k), the paths Path(i,j,m) within the grid are obtained, forming the path set Path(i,j). In addition, to improve the efficiency of obtaining path data within the grid, the topological relationship can be judged first. If Box(i,j) intersects with Path(k), then the superimposing and intersecting calculation is performed.

[0039] S3. Remove the invalid paths within the grid according to the limit of the minimum excitation - point distance;

[0040] S3 specifically includes the following steps:

[0041] S31. When arranging excitation points in the current grid, if there are already arranged excitation points around, perform the judgment of the minimum point distance to ensure that the excitation - point distance between the newly arranged excitation point and the surrounding excitation points is greater than the set value;

[0042] S32. As Figure 7As shown, in practical applications, if the distance between two excitation points is too close, the information of the two excitation points will be repeated. Therefore, according to the complexity of the terrain, the minimum excitation point distance d needs to be set. The minimum excitation point distance d is less than the grid width, that is, the excitation point distance SI, so as to avoid that the circle drawn with the minimum excitation point distance as the center completely covers one side of the grid in the subsequent superposition and subtraction operations. In this embodiment, d is preferably 30m. Taking the current grid as the center, search for the adjacent 8 grids. If there are already arranged excitation points in the adjacent grids, draw circles with the arranged excitation points as the center and the minimum excitation point distance d as the radius to obtain up to 8 circles, and form a circle set {Circle(r) ∈ CircleCollection|r ≤ R}, where Circle(r) represents the circle formed by the arranged excitation points in the neighborhood of the current grid, and the maximum value of R is 8;

[0043] S33. As Figure 8 shown, taking the circle set as the superposition element, according to Path_edit(i,j) = Difference(Path(i,j), CircleCollection), calculate the difference set of the path in the current grid, and obtain the path data in the grid {Path_edit(i,j,n) ∈ Path_edit(i,j)|i ≤ Nx, j ≤ Ny, n ≤ N_eidt(i,j)}. Among them, Difference is the superposition and subtraction operation on the original path set and the circle set in the neighborhood, Path_edit(i,j) is the path set in the grid Cell(i,j) after superposition and subtraction, N_eidt(i,j) is the number of paths in the grid Cell(i,j), and N_eidt(i,j) may be greater than or less than N(i,j).

[0044] S4. Select the point closest to the grid center point Center(i,j) from the path data in the grid as the excitation point position of the current grid;

[0045] Specifically, as Figure 8As shown in the figure, traverse the set of line segments, that is, the path set in the grid after superposition and subtraction in the previous step, {Segment(i,j,s)∈Segment(i,j)|i≤Nx,j≤Ny,s≤NS(i,j)}. For each line segment Segment(i,j,s), calculate the minimum distance from the center point Center(i,j) of the grid to this line segment. On the line segment with the minimum distance, find the point closest to the center point Center(i,j) of the grid as the excitation point position of the current grid, thus completing the layout of the excitation points. Where Segment(i,j) is the set of line segments in the grid Cell(i,j), NS(i,j) is the total number of line segments in the grid Cell(i,j), and NS(i,j) is equal to the sum of the number of line segments in each element of the Path_edit(i,j) set. By continuously repeating the above steps, the excitation points are laid out for all grids, and the result is as shown in Figure 10 The layout effect diagram of the grid-based excitation points shown.

[0046] Figure 9 The traditional layout effect diagram of the excitation points is shown. Compare Figure 10 with Figure 9 It can be seen that compared with the traditional method of laying out excitation points along the path, the excitation points laid out in this embodiment are more evenly distributed as a whole. There is only one excitation point in each grid, which is not affected by the richness of the path data, and it avoids the situation of over-dense layout of excitation points when the number of paths increases. Therefore, the excitation points laid out according to the method of this embodiment are more general and stable. It should be noted that since the method of this embodiment is to lay out the excitation points along the path, if there is no path in a certain grid, no excitation point will be laid out.

[0047] Embodiment 2

[0048] A system for laying out excitation points along the path, as shown in Figure 11 the figure, includes:

[0049] An excitation point grid construction module, used to construct an excitation point grid according to the boundary of the excitation points in the work area, the excitation point distance, and the excitation line distance. Specifically:

[0050] Calculate the outer bounding box of the excitation points according to the boundary of the excitation points, determine the starting point of the layout grid and the range of the layout grid. The width of the range is Ws and the height is Hs; along the excitation line direction, use the excitation point distance as the grid step size, and perpendicular to the excitation line direction, use the excitation line distance as the step size to form a grid covering the entire range of the outer bounding box of the excitation points.

[0051] A path data acquisition module, used to traverse each excitation point grid and acquire the path data in the grid. Specifically:

[0052] Traverse each excitation point grid, and calculate the intersection by superimposing the outer bounding rectangle of the grid and the paths in the work area to obtain the path set within the grid.

[0053] The invalid path removal module is used to remove the invalid paths within the grid according to the limit of the minimum excitation point distance. Specifically:

[0054] When arranging excitation points in the current grid, if there are already arranged excitation points around, perform the judgment of the minimum point distance to ensure that the excitation point distance between the newly arranged excitation point and the surrounding excitation points is greater than the set value; set the minimum excitation point distance as d, take the current grid as the center, search for the adjacent 8 grids, if there are already arranged excitation points in the adjacent grids, draw a circle with the already arranged excitation points as the center and the minimum excitation point distance d as the radius to form a circular set; use the circular set as the superimposed element, and perform the superimposed subtraction operation on the path set within the current grid and the circular set within the adjacent grids to obtain the path data within the grid.

[0055] The excitation point position determination module is used to select the point closest to the center point of the grid from the path data within the grid as the excitation point position of the current grid. Specifically:

[0056] Traverse the line segment set, calculate the minimum distance from the center point of the grid to each line segment, and find the point closest to the center point of the grid on the line segment with the minimum distance as the excitation point position of the current grid.

[0057] Embodiment 3

[0058] The electronic device of this embodiment includes a memory and a processor. The memory stores a computer program, and the processor calls the computer program in the memory to execute the method for arranging excitation points along a path in Embodiment 1. Figure 12 FIG. is a schematic structural diagram of the electronic device provided in this embodiment. The electronic device can be a terminal device or a server. Among them, the terminal device can include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, personal digital assistants (Personal Digital Assistant, abbreviated as PDA), tablet computers (Portable Android Device, abbreviated as PAD), portable multimedia players (Portable Media Player, abbreviated as PMP), in-vehicle terminals (such as in-vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 12 The electronic device shown is only an example and should not bring any limitations to the functions and usage scope of this embodiment.

[0059] Such as Figure 12As shown, the electronic device may include a processing device, such as a central processing unit, a graphics processing unit, etc., which may perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) or the program loaded from the storage device into the random access memory (RAM). In the RAM, various programs and data required for the operation of the electronic device are also stored. The processing device, ROM, and RAM are connected to each other through a bus. The input device, output device, communication device, and storage device are also connected to the bus through the I / O interface.

[0060] Generally, the following devices may be connected to the I / O interface: input devices including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices including, for example, magnetic tape, a hard disk, etc.; and a communication device. The communication device may allow the electronic device to communicate with other devices wirelessly or wiredly to exchange data. Although Figure 12 an electronic device with various devices is shown, it should be understood that it is not required to implement or have all the shown devices. Instead, more or fewer devices may be implemented or had.

[0061] Embodiment 4

[0062] A computer program is stored in the computer-readable storage medium of this embodiment, and when the computer program is executed by a processor, it is used to implement the method of arranging excitation points along a path in Embodiment 1. The computer-readable storage medium of this embodiment may be included in the electronic device; or it may exist alone without being assembled into the electronic device.

[0063] The computer-readable storage medium of this embodiment may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0064] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present disclosure, rather than to limit them; although the present disclosure has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements on some or all of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A method for arranging excitation points along a path, characterized in that, It includes the following steps carried out in sequence: S1. Construct a shooting point grid according to the boundary of shooting points in the work area, the shot interval, and the line interval; S2. Traverse each shooting point grid and obtain the path data within the grid; S3. Remove the invalid paths within the grid according to the limitation of the minimum shot interval; Step S3 specifically includes: S31. When arranging shooting points in the current grid, if there are already arranged shooting points around, perform the judgment of the minimum point interval to ensure that the shot interval between the newly arranged shooting point and the surrounding shooting points is greater than the set value; S32. Set the minimum shot interval as d. Taking the current grid as the center, search for the adjacent 8 grids. If there are already arranged shooting points in the adjacent grids, draw a circle with the already arranged shooting points as the center and the minimum shot interval d as the radius to form a circular set; S33. Taking the circular set as the overlay element, perform the overlay difference operation on the path set within the current grid and the circular set within the adjacent grids to obtain the path data within the grid; S4. Select the point closest to the center point of the grid from the path data within the grid as the position of the shooting point of the current grid.

2. The method for arranging excitation points along a path according to claim 1, wherein Step S1 specifically includes: S11. Calculate the outer bounding box of the shooting points according to the boundary of the shooting points to determine the starting point of arranging the grid and the range of arranging the grid. The width of the range is Ws and the height is Hs; S12. Along the shooting line direction, use the shot interval as the grid step size, and perpendicular to the shooting line direction, use the line interval as the step size to form a grid covering the entire range of the outer bounding box of the shooting points.

3. The method for arranging excitation points along a path according to claim 2, wherein Step S12 specifically includes: using the formulas Nx = ROUND(Ws ⁄ SLI) and Ny = ROUND(Hs ⁄ SI) to obtain the maximum number of grids in the x direction and the y direction respectively, where Nx is the maximum number of grids in the x direction, Ny is the maximum number of grids in the y direction, ROUND is the rounding function, SLI is the line interval, and SI is the shot interval.

4. The method for arranging excitation points along a path according to claim 3, characterized in that In step S12, if the grid formed to cover the entire range of the outer bounding box of the shooting points is irregular or its boundary has holes, remove the grid points not within the shooting boundary range to obtain the final grid set.

5. The method for arranging excitation points along a path according to claim 4, characterized in that, Step S2 specifically includes: traversing each shooting point grid and obtaining the path set within the grid through the overlay intersection calculation of the outer bounding rectangle of the grid and the paths in the work area.

6. The method for arranging excitation points along a path according to claim 5, wherein Step S4 specifically includes: traversing the line segment set, calculating the minimum distance from the center point of the grid to each line segment, and finding the point closest to the center point of the grid on the line segment with the minimum distance as the position of the shooting point of the current grid.

7. A system for arranging excitation points along a path, characterized in that, It includes: A shooting point grid construction module for constructing a shooting point grid according to the boundary of shooting points in the work area, the shot interval, and the line interval; A path data obtaining module for traversing each shooting point grid and obtaining the path data within the grid; An invalid path removal module is used to remove invalid paths within a grid according to the limitation of the minimum excitation point distance; when arranging excitation points in the current grid, if there are already arranged excitation points around, perform the judgment of the minimum point distance to ensure that the excitation point distance between the newly arranged excitation point and the surrounding excitation points is greater than the set value; set the minimum excitation point distance as d, and search for the adjacent 8 grids with the current grid as the center. If there are already arranged excitation points in the adjacent grids, draw a circle with the already arranged excitation points as the center and the minimum excitation point distance d as the radius to form a circular set; Using the circular set as the overlay element, perform an overlay subtraction operation on the path set within the current grid and the circular set within the adjacent grids to obtain the path data within the grid; An excitation point position determination module is used to select the point closest to the center point of the grid from the path data within the grid as the excitation point position of the current grid.

8. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method for arranging excitation points along a path according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program for executing the method for arranging excitation points along a path according to any one of claims 1 to 6.

Images