CN113393009B - Path planning method and device for transmission pipeline and computing equipment - Google Patents
Path planning method and device for transmission pipeline and computing equipment Download PDFInfo
- Publication number
- CN113393009B CN113393009B CN202010166828.XA CN202010166828A CN113393009B CN 113393009 B CN113393009 B CN 113393009B CN 202010166828 A CN202010166828 A CN 202010166828A CN 113393009 B CN113393009 B CN 113393009B
- Authority
- CN
- China
- Prior art keywords
- path
- planning
- pipeline
- difficulty
- electronic map
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 77
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000004891 communication Methods 0.000 claims description 23
- 238000004422 calculation algorithm Methods 0.000 claims description 19
- 238000004364 calculation method Methods 0.000 claims description 13
- 238000007726 management method Methods 0.000 claims description 7
- 230000003287 optical effect Effects 0.000 claims description 7
- 230000008859 change Effects 0.000 claims description 5
- 238000012876 topography Methods 0.000 claims description 5
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 5
- 238000009933 burial Methods 0.000 claims description 3
- 239000000835 fiber Substances 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 3
- 238000010276 construction Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 5
- 238000009826 distribution Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 239000002245 particle Substances 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a path planning method, a device and a computing device of a transmission pipeline, wherein the method comprises the following steps: acquiring transmission resource data, and associating the resource points to corresponding position points on the electronic map according to the transmission resource data; responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point; calculating cost values and difficulty values of path segments contained in at least two pipeline planning paths, and generating a weighted graph according to the cost values and the difficulty values of the path segments; selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph; and presenting the target pipeline planning path on the electronic map. Therefore, according to the scheme of the invention, the target pipeline planning path with the lowest sum of the cost and the difficulty can be selected according to the cost and the difficulty, so that the selected target planning path is more reasonable.
Description
Technical Field
The present invention relates to the field of information technologies, and in particular, to a method and an apparatus for path planning of a transmission pipeline, and a computing device.
Background
With the gradual expansion of the construction scale of the transmission pipeline, how to reasonably and effectively make the planning and design of the transmission pipeline is a subject that the current operators need to deeply consider. With the continuous maturity of GIS system, carry out the planning and design of transmission pipeline on electronic map and become reality, have had the help of electronic map, planning and designer can be convenient accomplish planning and design task under the assistance of map.
At present, some optimization schemes for planning have been proposed in the electric power field, for example, an ant colony algorithm and a mahalanobis distance judgment algorithm are adopted to perform optimal calculation during power grid planning, so that an optimal scheme is provided for overall planning of a power grid. Or in other technical schemes, the method for optimizing the line is provided, by constructing a cost function of a line planning scheme of the power communication network to be selected and calculating a looping rate, establishing a fitness function according to the cost function and the looping rate, acquiring global optimal positions which meet preset constraint conditions and have minimum fitness in all particles by using a particle swarm algorithm, acquiring an optimal solution of a line selection parameter, and correspondingly selecting the line as the line planning optimal line of the power communication network. The preset constraint conditions comprise that the position corresponds to the selected line and the established line form a communication graph, the loop forming rate of the node in the communication graph formed by the position corresponds to the selected line and the established line is larger than or equal to a preset threshold value, and the position corresponds to the selected line to meet the service distribution constraint, so that the line selection parameter corresponding to the global optimal position is optimal, the line corresponding to the optimal line selection parameter is constructed, the reliability of the line of the power communication network is improved, and the cost is reduced.
However, the inventors have found that in practicing embodiments of the present invention, there are at least the following problems in the prior art: the current planning method taking the electronic map as an auxiliary is only to simply design a circuit, but has no better control on the quality of the design, and the construction difficulty and the manufacturing cost are greatly prolonged in construction period and out of control in later construction due to the fact that the construction difficulty and the manufacturing cost cannot be accurately estimated in the design; the optimization method of the power grid planning scheme adopting the ant colony algorithm and the mahalanobis algorithm needs to adapt the algorithm to the whole planning scheme and iterate for a plurality of times, and the trend of the power line in the power grid planning process is lower than that of the communication line due to the fact that the trend of the power line is influenced by the actual environment, so that the certainty is higher, but the adopted algorithm is more complex, the calculated amount is larger, the calculated time is longer, and the purpose of carrying out optimal calculation in real time in the design cannot be realized; the main guiding idea is to optimally select the communication diagram, and the method and the system are difficult to rationalize when selecting parameters without referring to actual geographic environments.
Disclosure of Invention
In view of the foregoing, embodiments of the present invention are directed to a method, apparatus, and computing device for path planning of a transmission pipeline that overcomes or at least partially solves the foregoing problems.
According to an aspect of an embodiment of the present invention, there is provided a path planning method of a transmission pipeline, including:
acquiring transmission resource data, and associating the resource points to corresponding position points on an electronic map according to the transmission resource data;
responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point;
calculating cost values and difficulty values of path segments contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost values and the difficulty values of the path segments;
selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph; and presenting the target pipeline planning path on the electronic map.
According to another aspect of an embodiment of the present invention, there is provided a path planning apparatus for a transmission pipeline, including:
the resource management module is suitable for acquiring transmission resource data;
the planning and design module is suitable for associating the resource points to the corresponding position points on the electronic map according to the transmission resource data; responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point; presenting the target planning path on the electronic map;
the real-time calculation module is suitable for calculating the cost value and the difficulty value of the path segment contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost value and the difficulty value of the path segment; and selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph.
According to yet another aspect of an embodiment of the present invention, there is provided a computing device including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation corresponding to the path planning method of the transmission pipeline.
According to still another aspect of the embodiments of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to perform operations corresponding to the path planning method of a transmission pipeline as described above.
According to the path planning method, the path planning device and the computing equipment for the transmission pipeline, which are provided by the embodiment of the invention, the transmission resource data is presented on the electronic map based on the electronic map, the weighted map with the double weights of the cost value and the difficulty value can be constructed by combining the starting point, the ending point and the resource point on the electronic map, and the optimal planning path considering the cost and the difficulty is selected based on the weighted map, so that the selected path for pipeline planning is more reasonable, and effective reference is provided for construction design; the path planning method is simple in algorithm and can carry out path planning in real time and high efficiency; and moreover, the path planning is carried out on the resource points at the corresponding positions on the electronic map, so that the method can be more in line with the actual geography and resource environment, and the rationality of the path planning is further improved.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present invention can be more clearly understood, and the following specific implementation of the embodiments of the present invention will be more apparent.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
fig. 1 shows a flowchart of a path planning method of a transmission pipeline according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for path planning for a transmission pipeline according to another embodiment of the present invention;
fig. 3 is a schematic structural diagram of a path planning device for a transmission pipeline according to an embodiment of the present invention;
FIG. 4 illustrates a schematic diagram of a computing device provided by an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
Fig. 1 shows a flowchart of a path planning method for a transmission pipeline according to an embodiment of the present invention. The method can be used for outputting an optimal pipeline planning path so as to consider construction cost and difficulty. The method may be performed by any computing device having data processing capabilities. As shown in fig. 1, the method comprises the steps of:
step S110: and acquiring transmission resource data, and associating the resource points to corresponding position points on the electronic map according to the transmission resource data.
Wherein the transmission resource data comprises data reflecting location information of the transmission facility, e.g. the transmission resource data comprises location information of the machine room site.
Specifically, based on the acquired transmission resource data, the position of each resource point on the electronic map can be determined, and each resource point is associated to a corresponding position point on the electronic map according to the position of each resource point, so that the distribution of the resource points on the electronic map can be determined, and a reference is provided for path planning.
Step S120: in response to an operation of selecting a pipeline planning start point and an end point on the electronic map, at least two pipeline planning paths are determined from the start point, the end point, and the resource point.
When the pipeline planning is carried out, firstly, a pipeline planning starting point and a pipeline planning ending point are required to be selected, and after the electronic map receives the operation of the selected starting point and the selected ending point, at least two possible pipeline planning paths can be determined according to the positions of the starting point and the ending point in the electronic map and the positions of resource points on the electronic map, wherein the possible pipeline planning paths are formed by a plurality of path segments, and two end points of each path segment are formed by one or two of the starting point, the resource point and the ending point. It should be noted here that any two possible pipeline planning paths may contain the same path segment.
For example, the possible pipeline planning path n1 is formed by connecting a path segment 1, a path segment 2 and a path segment 3 end to end, wherein the path segment 1 and the path segment 2 are connected through an resource point s1, the path segment 2 and the path segment 3 are connected through the resource point s2, the other end point of the path segment 1 is a starting point a, and the other end point of the path segment 3 is an end point z.
Step S130: and calculating the cost value and the difficulty value of the path segment contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost value and the difficulty value of the path segment.
For the determined at least two possible pipeline planning paths, calculating cost values and difficulty values of each path segment constituting the at least two possible pipeline planning paths, and for each path segment, taking the calculated cost values and difficulty values as two weight values of the path segment. The generated weighted graph consists of path segments and double weights (cost value and difficulty value) of the path segments, namely, the double weights of each path segment in the weighted graph are combinations of the cost value and the difficulty value.
Step S140: selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph; and presenting the target pipeline planning path on the electronic map.
After the weighted graph is generated, combining the path segments capable of connecting the starting point and the end point, traversing all the combinations, calculating the sum of cost values of the path segments contained in the combination for each combination, calculating the sum of difficulty values of the path segments contained in the combination, and adding the sum of the cost values and the sum of the difficulty values to obtain the total value of a pipeline planning path from the starting point to the end point, wherein the total value is formed by the combination. And then selecting a pipeline planning path from the starting point to the end point, which is formed by combining the path segments with the lowest total value, as a target pipeline planning path.
And presenting the planning path of the target pipeline on the electronic map so that a user can visually check the planning trend of the pipeline through the electronic map.
According to the path planning method for the transmission pipeline, provided by the embodiment, the transmission resource data is presented on the electronic map based on the electronic map, a weighted map with double weights of a cost value and a difficulty value can be constructed on the electronic map by combining a starting point, a destination point and a resource point, and an optimal planning path considering both the cost and the difficulty is selected based on the weighted map, so that the selected pipeline planning path is more reasonable, and effective reference is provided for construction design; the path planning method is simple in algorithm and can carry out path planning in real time and high efficiency; and moreover, the path planning is carried out on the resource points at the corresponding positions on the electronic map, so that the method can be more in line with the actual geography and resource environment, and the rationality of the path planning is further improved.
Fig. 2 is a flowchart of a path planning method for a transmission pipeline according to another embodiment of the present invention. As shown in fig. 2, the method comprises the steps of:
step S210: and acquiring transmission resource data, and associating the resource points to corresponding position points on the electronic map according to the transmission resource data.
Wherein the transmission resource refers to professional equipment for transmission, optionally the transmission resource comprises a machine room site (space resource), an optical cable network, a pipeline network, a rod network, a direct buried network and/or an optical facility. And, the transmission resource data includes data reflecting location information of the transmission facility, for example, the transmission resource data includes location information of the machine room site.
Specifically, the resource management system may acquire and store transmission resource data, and when performing path planning, the planning and design module associates a resource point with a location point in the electronic map according to the transmission resource data, so that the resource point corresponds to a geographic location, for example, the machine room site is marked on the electronic map according to longitude and latitude of the machine room site. The electronic map is provided by the GIS service module.
In some optional embodiments of the present invention, a planning and designing layer may be drawn on the electronic map, and accordingly, when the correspondence between the resource points and the location points is established, the resource points are drawn according to the corresponding locations in the planning and designing layer on the electronic map of the transmission resource data. By drawing a planning and design layer special for path planning, the resource points can be efficiently associated in the planning and design layer and path design can be performed, and meanwhile, the electronic map is prevented from being changed.
Step S220: in response to an operation of selecting a pipeline planning start point and an end point on the electronic map, at least two pipeline planning paths are determined from the start point, the end point, and the resource point.
After the starting point and the end point of the pipeline planning are selected, triggering the real-time calculation module to select the optimal pipeline planning path. The real-time calculation module designs all possible pipeline planning paths from the starting point to the end point according to the resource point distribution from the starting point to the end point. When determining all possible pipeline planning paths, the starting point and the ending point are taken as the starting point and the ending point of the pipeline planning path, and the resource point is taken as the connection point between adjacent path segments contained in the pipeline planning path.
Step S230: and calculating the cost value and the difficulty value of the path segment contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost value and the difficulty value of the path segment.
Specifically, for all possible pipeline planning paths, cost values and difficulty values for path segments contained in the all possible pipeline planning paths are calculated and a weight map is generated. For any path segment, the product of the length of the path segment and the rated cost coefficient is calculated as the cost value of the path segment, and if the length of the path segment is d, that is, the distance between two endpoints is d, and the rated cost coefficient is c, the cost value r=d×c of the path segment. Wherein the quota cost coefficient c takes a value according to engineering quota standard. And calculating the product of the length of the path segment and the difficulty influence factor as a difficulty value of the path segment for any path segment, and assuming that the length of the path segment is d, namely the distance between two endpoints is d, and the difficulty influence factor is e, then the difficulty value t=d=e of the path segment, wherein the difficulty influence factor e is set according to the building, the road, the water system, the greenbelt and/or the topography.
And after the cost values and the difficulty values of all the path segments contained in all the possible pipeline planning paths are calculated, taking the cost values and the difficulty values of all the path segments as double weights of the path segments, and generating a weighted graph, wherein edges in the weighted graph are the path segments, and the weights of all the edges are the cost values and the difficulty values of the path segments.
Step S240: and selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph.
After the weight map is generated, the path segments with the starting points and the end points communicated in the weight map can be combined, and the sum of the cost values of the path segments contained in each combination is calculatedWherein n is the number of path segments; and calculating the sum of the difficulty values of the path segments comprised by the combination +.>And adding the sum of the cost values and the sum of the difficulty values to obtain a pipeline planning path from the start point to the end pointThe total value of the diameters is P+Q. Then, a combination with the smallest total value, namely, a combination corresponding to min (P+Q), is selected from the plurality of combinations, and a pipeline planning path formed by the path segment combination is determined as a target pipeline planning path.
For example, assume that in the weight map, path segment 1, path segment 2, path segment 3, path segment 4, and path segment 5 are included, and the respective double weights are (R1, T1), (R2, T2), (R3, T3), (R4, T4), and (R5, T5), wherein path segment 1, path segment 2, and path segment 3 may constitute a first line planning path from start point a to end point Z, path segment 4, and path segment 5 may constitute a second line planning path from start point a to end point Z, for the first line planning path, a total value z1= (r1+r2+r3) + (t1+t2+t3) of a sum of cost values and a sum of difficulty values is calculated for the second line planning path, and if Z1Z 2 is < the path segment 1, path segment 2, and path segment 3 constitute a target line planning path of the path.
In some alternative embodiments of the invention, a pipeline planning path formed by a path segment combination with a minimum sum of cost values and a sum of difficulty values is determined as a target pipeline planning path by using Dijkstra algorithm. Specifically, a Di Jie St algorithm is used for expanding from a starting point to an end point by taking the starting point as the center, and path segment combinations with the minimum sum of cost values and difficulty values are searched through permutation and combination, wherein the Di Jie St La algorithm is an algorithm for searching the shortest path from one vertex to the other vertexes, and the problem of the shortest path in a weight graph is solved. In these alternative embodiments, the path length refers to the size of the weight value, and the smaller the weight value, the shorter the corresponding path, and conversely, the longer the corresponding path; and continuously searching the shortest point from the starting point by using a Di Jie St algorithm until the end point is searched as the shortest point, arranging and combining the path segments formed by the searched shortest point set to form a path segment combination connecting the starting point to the end point, searching the path segment combination with the minimum total value of the sum of cost values and the sum of difficulty values from the path segment combination, and determining the pipeline planning path formed by the path segment combination with the minimum total value as a target pipeline planning path.
Step S250: and presenting the target pipeline planning path on the electronic map.
The target pipeline planning path is presented on an electronic map so that a user can be used as a reference in pipeline construction. In an alternative embodiment, where the planning and design layer is drawn on the electronic map, when the target pipeline planning path is presented, the target planning path is presented in the planning and design layer on the electronic map.
Step S260: and when the electronic map data and/or the transmission resource data change, updating the weight map in real time and reselecting the target pipeline planning path.
In the embodiment of the invention, the change of the electronic map data and/or the transmission resource data triggers the real-time calculation module to calculate the cost value and/or the difficulty value again, generate a new weight map and select a new target pipeline planning path so as to adapt to the updated geographic environment, and better utilize the updated transmission resource.
According to the path planning method of the transmission pipeline, provided by the embodiment, the weight graph is generated according to the cost value and the difficulty value of the path segment, and the optimal pipeline planning path is calculated and selected based on the weight graph, so that the selected pipeline planning path can be compatible with cost and difficulty; and calculating and selecting an optimal pipeline planning path in real time according to the changed condition, so that the selected path can be ensured to be optimal for the latest environment.
Fig. 3 is a schematic structural diagram of a path planning apparatus for a transmission pipeline according to an embodiment of the present invention.
As shown in fig. 3, the apparatus includes:
a resource management module 310 adapted to obtain transmission resource data;
the planning and design module 320 is adapted to associate the resource points to the corresponding position points on the electronic map according to the transmission resource data; responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point; presenting the target planning path on the electronic map;
the real-time calculation module 330 is adapted to calculate a cost value and a difficulty value of a path segment included in the at least two pipeline planning paths, and generate a weighted graph according to the cost value and the difficulty value of the path segment; and selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph.
The resource management system is connected with the planning and design module, and provides data support of transmission resources including space resources (machine room stations), optical cable networks, pipeline networks, rod networks, direct buried networks, optical facilities and the like for the planning and design module.
The GIS service module 340 provides functional support for the planning and design module, such as electronic map presentation and layer drawing.
The real-time calculation module is connected with the planning and design module, provides calculation service for optimal path selection for the planning and design module, and when planning and design personnel are carrying out transmission line design, the real-time calculation module automatically calculates cost and construction difficulty according to contents input by a user in an electronic map drawing planning and design layer, and provides design suggestions for the planning and design personnel according to different construction line routing selections. Optionally, the real-time calculation module uses Dijkstra algorithm (Dijkstra) to calculate and select the optimal line.
The planning and design module is connected with the resource management system, the real-time calculation module and the GIS service module and is a core application module of the device. The planning and design module acquires transmission resource data which is already running on the network from the resource management system as a reference value of transmission line planning and design in the newly added engineering. And the planning and designing module uses the electronic map service provided by the GIS service module to provide references in the aspects of building, road, water system, greenbelt, topography and the like for planning and designing staff. And the planning and designing module can call the optimal line computing service provided by the real-time computing module in real time during operation, and present the computing result to a designer for reference in real time.
In an alternative, the real-time computing module is further adapted to:
for any path segment, calculating the product of the length of the path segment and a rated cost coefficient as a cost value of the path segment; and calculating the product of the length of the path segment and the difficulty influence factor as a difficulty value of the path segment.
In an alternative, the difficulty influencing factor is set according to building, road, water system, greenbelt and/or topography.
In an alternative, the real-time computing module is further adapted to:
expanding to an end point by using a Di Jie St algorithm with a starting point as a center, and searching a path segment combination with the minimum total value of the sum of cost values and the sum of difficulty values through permutation and combination;
and determining a pipeline planning path formed by combining the path segments with the minimum total value as a target pipeline planning path.
In an alternative, the planning and design module is further adapted to:
drawing resource points according to the corresponding positions of the transmission resource data in a planning design layer on the electronic map;
and presenting the target planning path in a planning design layer on the electronic map.
In an alternative, the transmission resources include machine room sites, fiber optic cable networks, piping networks, rod networks, direct burial networks, and/or optical facilities.
In an alternative, the real-time computing module is further adapted to: and when the electronic map data and/or the transmission resource data change, updating the weight map in real time and reselecting the target pipeline planning path.
Embodiments of the present invention provide a non-volatile computer storage medium storing at least one executable instruction that may perform the path planning method of the transmission pipeline in any of the above method embodiments.
FIG. 4 illustrates a schematic diagram of a computing device according to an embodiment of the present invention, and the embodiment of the present invention is not limited to a specific implementation of the computing device.
As shown in fig. 4, the computing device may include: a processor 402, a communication interface (Communications Interface) 404, a memory 406, and a communication bus 408.
Wherein: processor 402, communication interface 404, and memory 406 communicate with each other via communication bus 408. A communication interface 404 for communicating with network elements of other devices, such as clients or other servers. The processor 402 is configured to execute the program 410, and may specifically perform relevant steps in the path planning method embodiment of the transmission pipeline for the computing device.
In particular, program 410 may include program code including computer-operating instructions.
The processor 402 may be a central processing unit CPU, or a specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention. The one or more processors included by the computing device may be the same type of processor, such as one or more CPUs; but may also be different types of processors such as one or more CPUs and one or more ASICs.
Memory 406 for storing programs 410. Memory 406 may comprise high-speed RAM memory or may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
Program 410 may be specifically operable to cause processor 402 to:
acquiring transmission resource data, and associating the resource points to corresponding position points on an electronic map according to the transmission resource data;
responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point;
calculating cost values and difficulty values of path segments contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost values and the difficulty values of the path segments;
selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph; and presenting the target pipeline planning path on the electronic map.
In an alternative manner, the program 410 further causes the processor 402 to:
for any path segment, calculating the product of the length of the path segment and a rated cost coefficient as a cost value of the path segment; and calculating the product of the length of the path segment and the difficulty influence factor as a difficulty value of the path segment.
In an alternative, the difficulty influencing factor is set according to building, road, water system, greenbelt and/or topography.
In an alternative manner, the program 410 further causes the processor 402 to:
expanding to an end point by using a Di Jie St algorithm with a starting point as a center, and searching a path segment combination with the minimum total value of the sum of cost values and the sum of difficulty values through permutation and combination;
and determining a pipeline planning path formed by combining the path segments with the minimum total value as a target pipeline planning path.
In an alternative manner, the program 410 further causes the processor 402 to:
drawing resource points according to the corresponding positions of the transmission resource data in a planning design layer on the electronic map;
and presenting the target planning path in a planning design layer on the electronic map.
In an alternative, the transmission resources include machine room sites, fiber optic cable networks, piping networks, rod networks, direct burial networks, and/or optical facilities.
In an alternative manner, the program 410 further causes the processor 402 to: and when the electronic map data and/or the transmission resource data change, updating the weight map in real time and reselecting the target pipeline planning path.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general-purpose systems may also be used with the teachings herein. The required structure for a construction of such a system is apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It will be appreciated that the teachings of embodiments of the present invention described herein may be implemented in a variety of programming languages, and the above description of specific languages is provided for disclosure of enablement and best mode of the embodiments of the present invention.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the above description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be construed as reflecting the intention that: i.e., an embodiment of the invention that is claimed, requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component and, furthermore, they may be divided into a plurality of sub-modules or sub-units or sub-components. Any combination of all features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or units of any method or apparatus so disclosed, may be used in combination, except insofar as at least some of such features and/or processes or units are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings), may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features but not others included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments can be used in any combination.
Various component embodiments of the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that some or all of the functionality of some or all of the components according to embodiments of the present invention may be implemented in practice using a microprocessor or Digital Signal Processor (DSP). Embodiments of the present invention may also be implemented as a device or apparatus program (e.g., a computer program and a computer program product) for performing a portion or all of the methods described herein. Such a program embodying the embodiments of the present invention may be stored on a computer readable medium, or may have the form of one or more signals. Such signals may be downloaded from an internet website, provided on a carrier signal, or provided in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. Embodiments of the invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.
Claims (9)
1. A method of path planning for a transmission pipeline, comprising:
acquiring transmission resource data, and associating the resource points to corresponding position points on the electronic map according to the transmission resource data;
responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point;
calculating cost values and difficulty values of path segments contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost values and the difficulty values of the path segments; wherein, two end points of each path section are composed of one or two of a starting point, an resource point and an end point; for any path segment, calculating the product of the length of the path segment and a rated cost coefficient as a cost value of the path segment, and calculating the product of the length of the path segment and a difficulty influence factor as a difficulty value of the path segment;
selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph; and presenting the target pipeline planning path on the electronic map.
2. The method of claim 1, wherein the difficulty impact factor is set according to building, road, water system, greenbelt, and/or topography.
3. The method of claim 1 or 2, wherein the selecting a pipeline planning path from the weighted graph that is a path segment combination with a minimum sum of cost values and difficulty values as a target pipeline planning path further comprises:
expanding to an end point by using a Di Jie St algorithm with a starting point as a center, and searching a path segment combination with the minimum total value of the sum of cost values and the sum of difficulty values through permutation and combination;
and determining a pipeline planning path formed by combining the path segments with the minimum total value as a target pipeline planning path.
4. The method of claim 1, wherein said associating resource points to corresponding location points on the electronic map according to the transmission resource data further comprises:
drawing resource points according to the corresponding positions of the transmission resource data in a planning design layer on the electronic map;
the presenting the target pipeline planning path on the electronic map further comprises:
and presenting the target pipeline planning path in a planning design layer on the electronic map.
5. The method of claim 1, wherein the transmission resources comprise machine room sites, fiber optic cable networks, piping networks, rod networks, direct burial networks, and/or optical facilities.
6. The method of claim 1, wherein the method further comprises: and when the electronic map data and/or the transmission resource data change, updating the weight map in real time and reselecting the target pipeline planning path.
7. A path planning apparatus for a transmission pipeline, comprising:
the resource management module is suitable for acquiring transmission resource data;
the planning and design module is suitable for associating the resource points to the corresponding position points on the electronic map according to the transmission resource data; responding to the operation of selecting a pipeline planning starting point and a pipeline planning ending point on the electronic map, and determining at least two pipeline planning paths according to the starting point, the ending point and the resource point; presenting a target pipeline planning path on the electronic map;
the real-time calculation module is suitable for calculating the cost value and the difficulty value of the path segment contained in the at least two pipeline planning paths, and generating a weighted graph according to the cost value and the difficulty value of the path segment; selecting a pipeline planning path formed by the path segment combination with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path according to the weighted graph; wherein, two end points of each path section are composed of one or two of a starting point, an resource point and an end point; for any path segment, calculating the product of the length of the path segment and a rated cost coefficient as a cost value of the path segment; and calculating the product of the length of the path segment and the difficulty influence factor as a difficulty value of the path segment.
8. A computing device, comprising: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to perform operations corresponding to the path planning method of the transmission pipeline according to any one of claims 1-6.
9. A computer storage medium having stored therein at least one executable instruction for causing a processor to perform operations corresponding to the path planning method of a transmission pipeline as claimed in any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010166828.XA CN113393009B (en) | 2020-03-11 | 2020-03-11 | Path planning method and device for transmission pipeline and computing equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010166828.XA CN113393009B (en) | 2020-03-11 | 2020-03-11 | Path planning method and device for transmission pipeline and computing equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113393009A CN113393009A (en) | 2021-09-14 |
| CN113393009B true CN113393009B (en) | 2024-03-19 |
Family
ID=77615541
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010166828.XA Active CN113393009B (en) | 2020-03-11 | 2020-03-11 | Path planning method and device for transmission pipeline and computing equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113393009B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115081672A (en) * | 2022-04-21 | 2022-09-20 | 盐城中科高通量计算研究院有限公司 | Robot access part interactive program control method |
| CN115686024A (en) * | 2022-11-18 | 2023-02-03 | 上海天华建筑设计有限公司 | Using the AStar path planning algorithm to plan the first layer of rainwater level pipeline planning |
| CN117196352B (en) * | 2023-11-07 | 2024-02-06 | 天泽智慧科技(成都)有限公司 | Pipeline planning optimization algorithm considering risk and cost |
| CN118521017A (en) * | 2024-07-23 | 2024-08-20 | 浙江威星智能仪表股份有限公司 | Pipeline construction path planning method and system and electronic equipment |
| CN118822070B (en) * | 2024-09-14 | 2025-01-28 | 国网浙江省电力有限公司诸暨市供电公司 | A Transmission Line Planning Method Based on Artificial Intelligence |
| CN119090248B (en) * | 2024-11-08 | 2025-02-11 | 国网浙江省电力有限公司台州供电公司 | Distribution network resource optimization configuration method and system based on artificial intelligence |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944095A (en) * | 2009-07-08 | 2011-01-12 | 广东融讯信息科技有限公司 | Path planning method and system |
| CN102128629A (en) * | 2010-01-13 | 2011-07-20 | 华为技术有限公司 | Path planning method, navigation system and geographical information system |
| CN105608896A (en) * | 2016-03-14 | 2016-05-25 | 西安电子科技大学 | Traffic bottleneck identification method in urban traffic network |
| CN106017488A (en) * | 2016-03-02 | 2016-10-12 | 电子科技大学 | Group travel route guiding method based on point of interest |
| CN109992923A (en) * | 2018-11-20 | 2019-07-09 | 国网陕西省电力公司 | A Phased Transmission Line Path Planning Method Based on Variable Resolution Cost Surface |
| CN110567459A (en) * | 2018-06-05 | 2019-12-13 | 北京京东尚科信息技术有限公司 | Path planning method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105229422B (en) * | 2013-03-15 | 2018-04-27 | 大众汽车有限公司 | Automatic Pilot route planning application |
-
2020
- 2020-03-11 CN CN202010166828.XA patent/CN113393009B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944095A (en) * | 2009-07-08 | 2011-01-12 | 广东融讯信息科技有限公司 | Path planning method and system |
| CN102128629A (en) * | 2010-01-13 | 2011-07-20 | 华为技术有限公司 | Path planning method, navigation system and geographical information system |
| CN106017488A (en) * | 2016-03-02 | 2016-10-12 | 电子科技大学 | Group travel route guiding method based on point of interest |
| CN105608896A (en) * | 2016-03-14 | 2016-05-25 | 西安电子科技大学 | Traffic bottleneck identification method in urban traffic network |
| CN110567459A (en) * | 2018-06-05 | 2019-12-13 | 北京京东尚科信息技术有限公司 | Path planning method and device |
| CN109992923A (en) * | 2018-11-20 | 2019-07-09 | 国网陕西省电力公司 | A Phased Transmission Line Path Planning Method Based on Variable Resolution Cost Surface |
Non-Patent Citations (3)
| Title |
|---|
| Zengfu Wang, 等.Application of the fast marching method for path planning of long-haul optical fiber cables with shielding.《IEEE Access》.2018,第6卷第41367-41378页. * |
| 基于市场不确定条件下的天然气管线规划;吴恒威;《中国优秀硕士学位论文全文数据库工程科技Ⅰ辑》(第1期);第46-66页、图4.7、图4.10、图5.10 * |
| 面向路径优化的智能物流管理系统设计与实现;张蕾;《中国优秀硕士学位论文全文数据库信息科技辑》(第3期);第I138-548页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113393009A (en) | 2021-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113393009B (en) | Path planning method and device for transmission pipeline and computing equipment | |
| CN109117429B (en) | Database query method and device and electronic equipment | |
| CN104567894B (en) | For providing the apparatus and method of map datum and its system | |
| CN106156138B (en) | The foundation of the spatial index of point of interest, Perimeter method and apparatus | |
| CN104506435B (en) | Shortest path in SDN controllers and SDN determines method | |
| CN111467806A (en) | Method, device, medium and electronic equipment for generating resources in game scene | |
| CN112003787A (en) | Routing path determining method, device, control equipment and storage medium | |
| CN114417572B (en) | Optical cable routing planning method, device, terminal equipment and storage medium | |
| CN103034267B (en) | Apparatus and a method for controlling facility devices | |
| CN111385129A (en) | Globalization content auditing method and device, computer equipment and storage medium | |
| CN113658295A (en) | A method and device for mapping along a grid layout based on geographic information | |
| CN112685175B (en) | Construction method and device of service topological graph and computer readable storage medium | |
| CN106412078B (en) | Accurate information method for pushing, device and system | |
| CN108259195A (en) | The determining method and system of the coverage of anomalous event | |
| CN104753694B (en) | A kind of method and apparatus of optical cable automation Route Selection | |
| CN116760761B (en) | Path creation method, data processing system, controller, storage medium | |
| CN114095807A (en) | Automatic routing method and device for optical cable route and electronic equipment | |
| CN110989982A (en) | Building block construction method and device with return value function, storage medium and processor | |
| CN117521591A (en) | Circuit wiring method, integrated circuit, chip and storage medium | |
| CN107248952B (en) | Method and system for determining service alternative route | |
| CN107733806B (en) | Data processing method and device | |
| CN118250207A (en) | Task scheduling method and device, equipment and medium | |
| CN105812434B (en) | Service chain control method and device after virtualization of user's handheld device | |
| CN113934947A (en) | Method and device for recommending co-hiring area | |
| Yanagi et al. | Development of mobile voice navigation system using user-based mobile maps annotations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |