Method, system and equipment for laying excitation points along path and medium

Abstract

The invention belongs to the field of oil and gas geophysical exploration, and discloses a method, a system, equipment and a medium for laying excitation points along a path, and the method comprises the following steps: constructing an excitation point grid according to a work area excitation point boundary, an excitation point distance and an excitation line distance; traversing each excitation point grid, and calculating path data in the grid; according to the limitation of the minimum excitation point distance, invalid paths in the grids are removed; and selecting a point closest to the central point of the grid from the path data in the grid as the excitation point position of the current grid. According to the method, the distributed excitation points are distributed more uniformly on the whole, only one excitation point exists in each grid and is not influenced by the richness of path data, and the situation that the excitation points are distributed too densely when paths are increased is avoided, so that the distributed excitation points are more universal and stable.

Description

Technical Field

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

[0002] During the seismic acquisition construction process, due to the influence of the actual terrain and surface obstacles, the theoretical excitation point position cannot be staked out and needs to be adjusted according to the surface conditions. When there is a road in the construction area, in order to facilitate construction, the excitation points can be laid out on the road first. According to the rules for staking out the excitation points, it is a difficult problem to reasonably lay out the excitation points on the road and make the distribution of the excitation points as uniform as possible.

[0003] In actual construction, usually in the Clang software, the excitation points are evenly arranged along the road according to the designed distance, and the excitation points with close distance are removed. This practice will cause the direction of the work area path to be inconsistent with the direction of the excitation line, and the arranged excitation points are not uniform as a whole; when the paths in the work area are more abundant, the arranged excitation points will increase, and the 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] In order to solve the above-mentioned 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, will not be affected by the richness of the path data, and the arranged excitation points are more universal and stable.

[0005] To achieve the above-mentioned purpose, the technical solution adopted by the present invention is as follows: a method for arranging excitation points along a path, comprising the following steps performed in sequence: S1, constructing an excitation point grid according to the excitation point boundary, excitation point distance, and excitation line distance of the work area; S2, traversing each excitation point grid to obtain the path data within the grid; S3, removing invalid paths within the grid according to the limit of the minimum excitation point distance; S4, selecting the point closest to the center point of the grid in 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, calculating the outer bounding box of the excitation point according to the boundary of the excitation point, determining the starting point of the grid layout, and the range of the grid layout, the width of the range is Ws, and the height is Hs; S12, using the excitation point distance as the grid step length along the excitation line direction, and the excitation line distance as the step length perpendicular to the excitation line direction, to form a grid covering the entire range of the outer bounding box of the excitation point.

[0007] As a limitation of the present invention: 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, wherein Nx is the maximum number of grids in the x direction, Ny is the maximum number of grids in the y direction, ROUND is a rounding function, SLI is the excitation line distance, and SI is the excitation point distance.

[0008] As a limitation of the present invention: in step S12, if the grid formed to cover the entire excitation point outer bounding box range is irregular or has holes in its boundary, the grid points that are not within the excitation boundary range are removed to obtain the final grid set.

[0009] As a limitation of the present invention: Step S2 specifically includes traversing each excitation point grid, and obtaining a path set in the grid by superimposing and intersecting the outer enclosing rectangle of the grid and the path in the work area.

[0010] As a limitation of the present invention: Step S3 specifically includes: S31. When arranging excitation points in the current grid, if there are already arranged excitation points around, perform a judgment on the minimum point distance to ensure that the excitation point distance between the newly arranged excitation points and the surrounding excitation points is greater than the set value; S32. Set the minimum excitation point distance to d, take the current grid as the center, search 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 circle set; S33. Take the circle set as the superposition element, perform superposition and difference operations on the path set in the current grid and the circle set in the adjacent grid to obtain the path data in the grid.

[0011] As a limitation 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 smallest distance as the excitation point position of the current grid.

[0012] As a limitation of the present invention: a system for arranging excitation points along a path, including an excitation point grid construction module, which is used to construct an excitation point grid according to the excitation point boundary, excitation point distance, and excitation line distance of a work area; a path data acquisition module, which is used to traverse each excitation point grid and obtain the path data within the grid; an invalid path removal module, which is used to remove invalid paths within the grid according to the limit of the minimum excitation point distance; and an excitation point position determination module, which 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.

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

[0014] As a limitation 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, the present invention has the following beneficial effects compared with the prior art: by gridding the work area and calculating the path data in the grid, according to the minimum distance principle, the redundant path information in the grid is eliminated, and the path point information closest to the grid midpoint is obtained, thereby completing the layout of the excitation points based on the path. The excitation points laid out by the above method are more evenly distributed as a whole, and there is only one excitation point in each grid, which will not be affected by the richness of the path data, avoiding the situation where the excitation points are too densely laid out when the number of paths increases, so the laid out excitation points are more universal and stable. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0017] Figure 1 This is a flow chart of a method for arranging excitation points along a path according to Embodiment 1 of the present invention; Figure 2 This is a schematic diagram of the gridding of the work area in Example 1 of the present invention; Figure 3 A distribution diagram of the work area boundary and the paths within the work area according to Embodiment 1 of the present invention; Figure 4 This is a schematic diagram of a local work area after gridding according to Embodiment 1 of the present invention; Figure 5 This is a path distribution diagram of the grid A in Example 1 of the present invention; Figure 6 This is a path distribution diagram after the grid A and the outer enclosing rectangle of the grid are superimposed and intersected in Example 1 of the present invention; Figure 7 This is a path distribution diagram after the grid A and the circle set are superimposed and subtracted in Example 1 of the present invention; Figure 8 This is a diagram showing the locations of the excitation points in the grid A in Example 1 of the present invention; Fig. 9 It is the rendering of the traditional layout of the excitation points along the path; Fig.10 This is a rendering of the layout of the excitation points along the path based on the grid according to the first embodiment of the present invention; Fig.11This is a block diagram of the system structure for arranging excitation points along a path according to Embodiment 2 of the present invention; Fig.12 This is a schematic diagram of the structure of an electronic device according to Embodiment 3 of the present invention. DETAILED DESCRIPTION

[0018] The preferred embodiments of the present invention are described below in conjunction with the accompanying drawings. It should be understood that the method, system, device and medium for arranging excitation points along a path described herein are preferred embodiments, which are only used to illustrate and explain the present invention and do not constitute a limitation on the present invention.

[0019] Example 1 A method for arranging excitation points along the path, taking a work area in the western region as an example, Figure 1 As shown, the following steps are performed in sequence: S1. Construct the excitation point grid according to the excitation point boundary (SB), excitation point distance (SI) and excitation line distance (SLI) of the work area; S1 specifically includes the following steps: S11, such as Figure 2 As shown, the outer bounding box of the excitation point is calculated according to the excitation point boundary (SB), and the starting point (x0, y0) of the grid layout and the range of the grid layout are determined, and the width of the range is Ws and the height is Hs; S12, along the excitation line direction, the excitation point distance (SI) is used as the grid step length, and perpendicular to the excitation line direction, the excitation line distance (SLI) is used as the step length to form a grid covering the entire excitation point outer bounding box range. Figure 3 and Figure 4 As shown, in this embodiment, the excitation point distance SI is preferably 40m, the excitation line distance SLI is preferably 200m, and the working area is divided into uniform grids with sizes of 40m and 200m along the excitation line direction and perpendicular to the excitation line direction respectively.

[0020] The formula Nx=ROUND(Ws / SLI) and Ny=ROUND(Hs / SI) are used to obtain the maximum number of grids in the x direction and 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, and ROUND is a rounding function. If the grid that forms the bounding box covering the entire excitation point is irregular or has holes in its boundary, remove the grid points that are not within the excitation boundary (SB) 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.

[0021] S2, traverse each excitation point grid and obtain the path data within the grid; Specifically, the path in the work area is a linear collection graph {Path(k)∈PathCollection|k≤Np}, where Np is the total number of paths in the work area. Figure 5 and Figure 6 As shown in the figure, for grid A, the path in the grid is calculated by Path(i,j)=Box(i,j)∩PathCollection, and the path set in the grid is {Path(i,j,m)∈Path(i,j)|i≤Nx,j≤Ny,m≤N(i,j)}, where Path(i,j) is the path set in the grid Cell(i,j), N(i,j) is the number of paths in the grid Cell(i,j) obtained by calculation, and Box(i,j) is the outer bounding rectangle of the grid Cell(i,j). By superimposing and intersecting Box(i,j) with each path Path(k), the path Path(i,j,m) in the grid is obtained to form the path set Path(i,j). In addition, in order to improve the efficiency of obtaining path data in the grid, the topological relationship can be judged first. If Box(i,j) intersects with Path(k), the superimposition and intersection calculation is performed.

[0022] S3, according to the minimum excitation point distance limit, remove the invalid path in the grid; S3 specifically includes the following steps: S31, when arranging the 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, such as Figure 7 As shown, in actual 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, it is necessary to set the minimum excitation point distance d. The minimum excitation point distance d is smaller than the grid width, that is, the excitation point distance SI, so as to avoid the circle drawn with the minimum excitation point distance as the center covering all sides of the grid in the subsequent superposition and difference operation. In this embodiment, d is preferably 30m. With the current grid as the center, search the 8 adjacent grids. If there are already deployed excitation points in the adjacent grids, draw a circle with the already deployed 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 deployed excitation points in the neighborhood of the current grid, and the maximum value of R is 8; S33, such as Figure 8As shown in the figure, the circle set is used as the superposition element, and according to Path_edit(i,j)=Difference(Path(i,j), CircleCollection), the difference set of the paths in the current grid is obtained, and the path data in the grid {Path_edit(i,j,n)∈Path_edit(i,j)|i≤Nx,j≤Ny,n≤N_eidt(i,j)} is obtained. Where Difference is the superposition and difference operation of 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 difference, 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).

[0023] S4, selecting the point closest to the grid center point Center(i,j) in the path data within the grid as the excitation point position of the current grid; Specifically, Figure 8 As shown, traverse the line segment set, that is, the path set and {Segment(i,j,s)∈Segment(i,j)|i≤Nx,j≤Ny,s≤NS(i,j)} in the grid after superposition and subtraction in the previous step, and find the minimum distance from the grid center point Center(i,j) to each line segment Segment(i,j,s). On the line segment with the smallest distance, find the point closest to the grid center point Center(i,j) as the excitation point position of the current grid, thereby completing the layout of the excitation points. Among them, Segment(i,j) is the line segment set 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 in the Path_edit(i,j) set. By repeating the above steps, the excitation points are arranged for all grids, and the following is obtained. Fig.10 The grid-based excitation point layout effect is shown.

[0024] Fig. 9 The figure shows the effect of the traditional excitation point layout. Fig.10 and Fig. 9 By comparison, it can be seen that compared with the traditional method of arranging excitation points along the path, the excitation points arranged in this embodiment are more evenly distributed as a whole, and there is only one excitation point in each grid, which will not be affected by the richness of the path data, and avoids the situation where the excitation points are arranged too densely when the number of paths increases. Therefore, the excitation points arranged according to the method of this embodiment are more universal and stable. It should be noted that since the method of this embodiment is to arrange the excitation points along the path, if there is no path in a certain grid, no excitation points will be arranged.

[0025] Example 2 A system of placing excitation points along a path, such as Fig.11 As shown, including: The excitation point grid construction module is used to construct the excitation point grid according to the excitation point boundary, excitation point distance and excitation line distance of the work area, specifically: The outer bounding box of the excitation point is calculated according to the boundary of the excitation point, and the starting point and range of the grid are determined. The width of the range is Ws and the height is Hs. The grid step length is the excitation point distance along the excitation line direction and the excitation line distance perpendicular to the excitation line direction, forming a grid covering the entire outer bounding box range of the excitation point.

[0026] The path data acquisition module is used to traverse each excitation point grid and obtain the path data within the grid, specifically: Each excitation point grid is traversed, and the path set in the grid is obtained by superimposing and intersecting the outer enclosing rectangle of the grid and the path in the work area.

[0027] The invalid path removal module is used to remove invalid paths in the grid according to the minimum excitation point distance limit, specifically: 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 points and the surrounding excitation points is greater than the set value; set the minimum excitation point distance to d, take the current grid as the center, search 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 circle set; use the circle set as the superposition element, perform superposition and difference operations on the path set in the current grid and the circle set in the adjacent grid to obtain the path data in the grid.

[0028] The excitation point position determination module is used to select the point closest to the center point of the grid in the path data within the grid as the excitation point position of the current grid, specifically: Traverse the line segment set, find 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 smallest distance as the excitation point position of the current grid.

[0029] Example 3 The electronic device of this embodiment includes a memory and a processor. The memory stores a computer program. The processor calls the computer program in the memory to execute a method of arranging excitation points along a path in embodiment 1. Fig.12The schematic diagram of the structure of the electronic device provided in this embodiment, the electronic device may be a terminal device or a server. The terminal device may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, personal digital assistants (PDAs), tablet computers (Portable Android Devices, PADs), portable multimedia players (Portable Media Players, PMPs), vehicle terminals (such as vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Fig.12 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the present embodiment.

[0030] like Fig.12 As shown, the electronic device may include a processing device, such as a central processing unit, a graphics processing unit, etc., which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) or a program loaded from a storage device to a 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 an I / O interface.

[0031] Typically, the following devices can be connected to the I / O interface: input devices such as touch screens, touch pads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices such as liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices such as magnetic tapes, hard disks, etc.; and communication devices. Communication devices can allow electronic devices to communicate with other devices wirelessly or by wire to exchange data. Although Fig.12 An electronic device having various devices is shown, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0032] Example 4 The computer readable storage medium of this embodiment stores a computer program, and when the computer program is executed by the processor, it is used to implement a method for 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 independently without being assembled into the electronic device.

[0033] 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, device or component, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with 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 thereof. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, device, or component.

[0034] 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 aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein by equivalents. However, 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: The process includes the following steps: S1. Construct an excitation point grid according to the excitation point boundary, excitation point distance, and excitation line distance of the work area; S2, traverse each excitation point grid and obtain the path data within the grid; S3, according to the minimum excitation point distance limit, remove the invalid path in the grid; S4. Select the point closest to the center point of the grid in the path data within the grid as the excitation point position of the current grid.

2. The method for arranging excitation points along a path according to claim 1, characterized in that: Step S1 specifically includes: S11, calculating the outer bounding box of the excitation point according to the boundary of the excitation point, determining the starting point of the grid layout and the range of the grid layout, where the width of the range is Ws and the height is Hs; S12, forming a grid covering the entire excitation point outer bounding box range by taking the excitation point distance as the grid step length along the excitation line direction and taking the excitation line distance as the step length perpendicular to the excitation line direction.

3. The method for arranging excitation points along a path according to claim 2, characterized in that: 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 a rounding function, SLI is the excitation line distance, and SI is the excitation point distance.

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 excitation point outer bounding box range is irregular or has holes in its boundary, the grid points that are not within the excitation boundary range are removed 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 excitation point grid, and obtaining a path set in the grid by superimposing and intersecting the outer enclosing rectangle of the grid and the path in the work area.

6. The method for arranging excitation points along a path according to claim 5, characterized in that: Step S3 specifically includes: S31, when arranging the 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, setting the minimum excitation point distance to d, taking the current grid as the center, searching the adjacent 8 grids, if there are already deployed excitation points in the adjacent grids, draw a circle with the deployed excitation points as the center and the minimum excitation point distance d as the radius to form a circular set; S33, taking the circle set as the superposition element, performing superposition and difference operations on the path set in the current grid and the circle set in the adjacent grid to obtain the path data in the grid.

7. The method for arranging excitation points along a path according to claim 6, characterized in that: 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 smallest distance as the excitation point position of the current grid.

8. A system for arranging excitation points along a path, characterized in that: include: The excitation point grid construction module is used to construct the excitation point grid according to the excitation point boundary, excitation point distance and excitation line distance of the work area; A path data obtaining module is used to traverse each excitation point grid and obtain the path data within the grid; The invalid path removal module is used to remove invalid paths in the grid according to the minimum excitation point distance limit; The excitation point position determination module is used to select the point closest to the grid center point in the path data within the grid as the excitation point position of the current grid.

9. An electronic 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 method for arranging excitation points along a path as described in any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program for executing the method of arranging excitation points along a path as described in any one of claims 1 to 7.

Images