Optical cable path planning method and device and electronic equipment

Abstract

The invention provides an optical cable path planning method and device and electronic equipment, and the method comprises the steps: obtaining the geographic information and attribute information of each bearing point of a pipeline dummy resource of a target region, and determining an optical cable path planning demand of the target region; based on the geographic information and the attribute information of each bearing point, constructing a bearing network model of the pipeline dumb resources; based on an optical cable path planning demand, determining geographic information and service demands of a plurality of access points, and determining a planning target and constraint conditions; and searching feasible paths meeting constraint conditions in the bearer network model by adopting a depth-first search algorithm based on a planning target and geographic information and service requirements of a plurality of access points, and generating a candidate path set. According to the method, the bearing network model of the pipeline dumb resources is constructed, the feasible path is searched in combination with the depth-first search algorithm, multiple candidate paths can be generated at a time, the limitation of a single path is avoided, the flexibility is high, and the user experience is improved.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to an optical cable path planning method, device and electronic equipment. Background Art

[0002] In current communications networks, optical cables are the primary carrier of information transmission. The planning and design of their routing directly impacts the efficiency and stability of network transmission. Traditional optical cable routing design relies primarily on manual on-site surveys and blueprints. This method is not only time-consuming and labor-intensive, but also susceptible to human error, resulting in inaccurate designs, increased costs, and inefficient resource utilization.

[0003] With the continuous development of technology, especially the application of automation and intelligent algorithms, the design methods of optical cable routing are gradually shifting towards automation and intelligence. Existing technologies for optical cable routing planning are based on the "shortest path" algorithm. This algorithm usually only finds a single optimal path, lacking flexibility in practical applications and unable to meet operators' diverse requirements for optical cable routing. Summary of the Invention

[0004] The present invention provides an optical cable path planning method, device and electronic equipment to solve the defects of the existing technology in which optical cable path planning is based on the "shortest path" algorithm, which has poor flexibility and cannot meet the operators' diverse needs for optical cable laying paths.

[0005] In a first aspect, the present invention provides a method for planning an optical cable path, comprising: Obtaining geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area, and determining the optical cable path planning requirements of the target area; Constructing a bearer network model of the pipeline dumb resources based on the geographic information and attribute information of each bearer point; Based on the optical cable path planning requirements, determining the geographic information and business requirements of multiple access points, and determining planning objectives and constraints; Based on the planning goal and the geographic information and service requirements of the multiple access points, a depth-first search algorithm is used to search for feasible paths that meet the constraints in the bearer network model to generate a candidate path set.

[0006] In some embodiments, constructing the bearer network model of the pipeline dumb resource based on the geographic information and attribute information of each bearer point includes: Preprocessing the geographic information of each bearing point to determine the direction information, relative position and connection relationship of each bearing point; Preprocessing the attribute information of each bearing point to obtain key information of each bearing point; Constructing an initial bearer network model based on the direction information, relative position and connection relationship of each bearer point; Based on the key information of each bearer point, the initial bearer network model is optimized to obtain the bearer network model.

[0007] In some embodiments, the step of searching for feasible paths that meet the constraints in the bearer network model based on the planning objectives and the geographic information and service requirements of the multiple access points using a depth-first search algorithm to generate a candidate path set includes: Determining a cross relationship among multiple bearer links based on the bearer network model, and determining a plurality of branch points from each bearer point based on the cross relationship among the multiple bearer links; Determining a bearer link corresponding to each access point based on geographic information and service requirements of the multiple access points; Based on a depth-first search algorithm, searching for a branch point of a bearer link corresponding to each access point from the multiple branch points, and searching for a feasible path that meets the constraint condition in the bearer network model based on the branch point of the bearer link corresponding to each access point; Grouping and supplementing the found feasible paths to obtain multiple routes from the starting access point to the target access point; The multiple routes are evaluated to obtain evaluation results, and the multiple routes are screened according to the evaluation results to obtain a candidate path set.

[0008] In some embodiments, searching for a feasible path that satisfies the constraint condition in the bearer network model based on a branch point of the bearer link corresponding to each access point includes: Based on the first divergence point of the bearer link corresponding to each access point, an associated first bearer link is determined. Based on the constraint condition, it is determined whether the associated first bearer link matches the next access point. If so, the corresponding feasible path is recorded. Otherwise, the path search is continued based on the second divergence point of the bearer link corresponding to each access point. This cycle is repeated until all feasible paths are found.

[0009] In some embodiments, determining a bearer link corresponding to each access point based on geographic information and service requirements of the multiple access points includes: searching, in the bearer network model, for a plurality of bearer links adjacent to each access point according to the geographic information of each access point; According to the service requirements of each access point, a bearer link corresponding to each access point is determined from the multiple adjacent bearer links.

[0010] In some embodiments, the planning objectives include: minimizing total cost, minimizing failure risk, and maximizing resource utilization; the constraints include: the remaining capacity of the pipeline is greater than or equal to the required capacity, the bending radius of the optical cable is greater than or equal to a first preset threshold, and the construction difficulty value is less than or equal to a second preset threshold.

[0011] In some embodiments, the method further comprises: Sending the candidate path set to a client, the client being configured to obtain a user instruction and determine a target path from the candidate path set based on the user instruction; Receive the target path sent by the client.

[0012] In some embodiments, the method further comprises: Based on the target path, generating a construction drawing and resource occupancy table for laying optical cables; The construction drawing includes the routing direction of the optical cable, the location of the access point, the pipeline laying method and the location of the joints; the resource occupancy table includes the pipeline length, the number of occupied pipe holes and the required equipment and materials.

[0013] In a second aspect, the present invention further provides an optical cable path planning device, comprising: An acquisition unit, configured to acquire geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area, and determine the optical cable path planning requirements of the target area; A construction unit, configured to construct a bearer network model of the pipeline dumb resource based on the geographic information and attribute information of each bearer point; A determination unit, configured to determine planning objectives and constraints, as well as geographic information and service requirements of multiple access points based on the optical cable path planning requirements; A planning unit is configured to search for feasible paths that meet the constraints in the bearer network model using a depth-first search algorithm based on the planning target and the geographic information and service requirements of the multiple access points, and generate a candidate path set.

[0014] In a third aspect, the present invention further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the optical cable path planning method as described above is implemented.

[0015] The optical cable path planning method, device, and electronic device provided by the present invention determine the optical cable path planning requirements of the target area by obtaining the geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area; construct a bearing network model of the pipeline dumb resources based on the geographic information and attribute information of each bearing point; determine the geographic information and business requirements of multiple access points based on the optical cable path planning requirements, and determine the planning objectives and constraints; and use a depth-first search algorithm based on the planning objectives and the geographic information and business requirements of the multiple access points to search for feasible paths that meet the constraints in the bearing network model and generate a set of candidate paths. This avoids the limitations of a single path, is highly flexible, can meet the diverse needs of users, and improves the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction is given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0017] Figure 1 It is a flowchart of the optical cable path planning method provided by an embodiment of the present invention.

[0018] Figure 2 This is one of the structural diagrams of the bearer network model provided by an embodiment of the present invention.

[0019] Figure 3 This is the second structural diagram of the bearer network model provided by an embodiment of the present invention.

[0020] Figure 4 It is a structural diagram of an optical cable path planning device provided by an embodiment of the present invention.

[0021] Figure 5 It is a structural diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0022] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0023] The terms "first," "second," and the like, as used herein, are used to distinguish similar objects, and are not intended to describe a specific order or precedence. It should be understood that the terms used in this manner are interchangeable, where appropriate, so that embodiments of the present invention can be implemented in an order other than that illustrated or described herein. Furthermore, the objects distinguished by "first" and "second" generally refer to a class of objects and do not limit the number of objects. For example, the first object can be one or more. Furthermore, the term "and / or" as used herein refers to at least one of the connected objects, and the character " / " generally indicates that the objects connected are in an "or" relationship.

[0024] Figure 1 Schematic diagram of the process of the optical cable path planning method provided by the embodiment of the present invention. Figure 1 As shown, a method for planning an optical cable path is provided, comprising the following steps: step 110, step 120, step 130, and step 140. The steps of the method flow are merely a possible implementation of the present invention.

[0025] Step 110: Obtain geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area, and determine the optical cable path planning requirements of the target area.

[0026] Among them, pipeline dumb resources are the physical media and related facilities used to carry information transmission.

[0027] Optionally, each bearing point includes a manhole, an electric pole, a supporting point, etc.

[0028] Optionally, the geographic information includes at least: longitude and latitude, altitude, address and other information; the attribute information includes at least the direction of the pipeline, diameter, material, laying age, usage status and other information.

[0029] Among them, the optical cable path planning requirements are determined based on user needs; the optical cable path planning requirements at least include business needs, geographical environment needs, safety and reliability needs, cost and resource needs, etc.

[0030] Step 120: Construct a bearer network model of pipeline dumb resources based on the geographic information and attribute information of each bearer point.

[0031] Optionally, a bearer network model of pipeline dumb resources is constructed with each bearer point as a node and the connecting pipelines between the bearer points as edges.

[0032] The bearer network model includes attribute information of each bearer point and attribute information of each connection pipeline.

[0033] In some embodiments, based on the geographic information and attribute information of each bearer point, a bearer network model of pipeline dumb resources is constructed, including: Pre-process the geographic information of each bearing point to determine the direction information, relative position and connection relationship of each bearing point; Preprocess the attribute information of each bearing point to obtain the key information of each bearing point; Based on the direction information, relative position and connection relationship of each bearing point, an initial bearing network model is constructed; Based on the key information of each bearer point, the initial bearer network model is optimized to obtain a bearer network model.

[0034] Optionally, the key information includes but is not limited to: bearer point type, equipment parameters, operating status, and business load conditions.

[0035] Optionally, based on the key information of each bearer point, an abnormal bearer point where a fault occurs is determined, and the abnormal bearer point is removed from the initial bearer network model to obtain a bearer network model.

[0036] The direction information of each bearing point includes at least: (1) Directionality: It is used to describe how many bearing sections a bearing point has. For example, if a manhole has 1, 2, 3, 4, or 5 pipeline sections, the directionality will be integer values such as 1, 2, 3, 4, or 5. If the directionality of a bearing point is 1, it means that the bearing point is a terminal point or a starting point. If the directionality of a bearing point is 2, it means that the bearing point is a through point. If the directionality of a bearing point is an odd number greater than 2, it means that the bearing point is a branch point and is connected to a terminal point or a starting point. If the directionality of a bearing point is an even number greater than 2, it means that the bearing point is a branch point. (2) Direction segment: used to describe two adjacent non-through point segments. Generally, one direction corresponds to one direction segment. (3) Direction segment angle: It is used to describe the direction of the load-bearing chain corresponding to the divergence point. It is the angle between the first load-bearing segment of the two direction segments and is expressed in [0, π] radians.

[0037] Figure 2 This is one of the structural diagrams of the bearer network model provided by the embodiment of the present invention. Figure 2 As shown, the bearer network model includes 18 manholes, each node represents a manhole, which are numbered 1-18, and the distance (i.e., length) between two adjacent manholes is 50 meters.

[0038] Table 1 is a mapping table of manholes and direction provided by an embodiment of the present invention. As shown in Table 1, Figure 2 The directions of the wells numbered 1-18 are different, namely 1, 2, 3 or 4.

[0039] Table 1 Mapping table of manhole and direction

[0040] Table 2 is a mapping table of direction segments and lengths provided by an embodiment of the present invention. As shown in Table 2, Figure 2 The lengths of sections in different directions, such as 50m, 100m, 150m, and 200m.

[0041] Table 2 Mapping table of direction segments and lengths

[0042] Table 3 shows the direction angles between different direction segments provided by the embodiment of the present invention. As shown in Table 3, Figure 2 The angle between different direction segments, such as π / 2, π.

[0043] Table 3 Direction angles between different direction segments

[0044] Optionally, the angle between the direction segments is calculated as follows (based on Figure 2 Take the manhole 3 in the figure as an example): the angle between the two direction segments 3-4 and 1-3 is arccos ( ), where a is the length of 2-4, b is the length of 3-4, and c is the length of 2-3; the length of 2-4 is calculated from the longitude and latitude of 2 and 4.

[0045] Optionally, Figure 2 Simplify and get Figure 3 , the simplification process follows the following principles: (1) Each bearer network model can only contain two different terminal points; (2) A bearer segment can only belong to one bearer link; (3) At the divergence point, if the angle between a certain direction segment and other related direction segments is greater than 0.75π, then the direction segment and other related direction segments belong to the same bearer link; (4) At a node with an odd degree of direction, if there is no direction segment whose angle with other associated direction segments is greater than 0.75π, then the node is regarded as the terminal point on the direction segment.

[0046] Figure 3 This is the second structural diagram of the bearer network model provided by the embodiment of the present invention. Figure 3 As shown, the bearer network model includes four bearer links: 1-3-18, 4-3-7, 6-7-11-14, and 10-11-12.

[0047] Step 130: Based on the optical cable path planning requirements, determine the geographic information and service requirements of multiple access points, and determine planning objectives and constraints.

[0048] Among them, business requirements include at least capacity requirements, quality requirements, coverage requirements and security requirements.

[0049] In some embodiments, the planning objectives include: minimizing total cost, minimizing failure risk, and maximizing resource utilization; the constraints include: the remaining capacity of the pipeline is greater than or equal to the required capacity, the bending radius of the optical cable is greater than or equal to a first preset threshold, and the construction difficulty value is less than or equal to a second preset threshold.

[0050] Optionally, the first preset threshold and the second preset threshold are determined according to empirical data or based on user input.

[0051] Step 140: Based on the planning objectives and the geographic information and service requirements of the multiple access points, a depth-first search algorithm is used to search for feasible paths that meet the constraints in the bearer network model to generate a candidate path set.

[0052] Among them, the basic idea of the depth-first search algorithm is to search the branches of the tree as deeply as possible. When all the edges where node v is located have been explored, the search will backtrack to the starting node of the edge where node v was found. The whole process is repeated until all nodes have been visited.

[0053] In an embodiment of the present invention, the optical cable path planning requirements of the target area are determined by obtaining the geographic information and attribute information of each bearer point of the pipeline dumb resources in the target area; based on the geographic information and attribute information of each bearer point, a bearer network model of the pipeline dumb resources is constructed; based on the optical cable path planning requirements, the geographic information and business requirements of multiple access points are determined, and the planning objectives and constraints are determined; based on the planning objectives and the geographic information and business requirements of the multiple access points, a depth-first search algorithm is used to search for feasible paths that meet the constraints in the bearer network model, and a candidate path set is generated, thereby avoiding the limitations of a single path, being highly flexible, being able to meet the diverse needs of users, improving the accuracy of path planning, reducing costs, improving resource utilization, and enhancing user experience.

[0054] In some embodiments, based on planning objectives, geographic information of multiple access points, and service requirements, a depth-first search algorithm is used to search for feasible paths that meet constraints in the bearer network model, generating a set of candidate paths, including: Based on the bearer network model, determining the cross-relationship of multiple bearer links, and based on the cross-relationship of the multiple bearer links, determining multiple branch points from each bearer point; Determine the corresponding bearer link for each access point based on the geographic information and service requirements of multiple access points; Based on the depth-first search algorithm, the branch point of the bearer link corresponding to each access point is found from multiple branch points. Based on the branch point of the bearer link corresponding to each access point, a feasible path that meets the constraints is searched in the bearer network model. Grouping and supplementing the found feasible paths to obtain multiple routes from the starting access point to the target access point; The multiple routes are evaluated to obtain evaluation results, and the multiple routes are screened according to the evaluation results to obtain a candidate path set.

[0055] Optionally, multiple routes are evaluated according to a planning objective to obtain an evaluation result.

[0056] It can be understood that based on the bearer network model, by determining the divergence points of multiple bearer links, combining the geographical information and business needs of the access points, and using the depth-first search algorithm to find the divergence points of the bearer links corresponding to each access point, then searching for feasible paths that meet the constraints in the bearer network model, grouping and supplementing the found feasible paths, and obtaining multiple routes from the starting access point to the target access point. Finally, the multiple routes are evaluated and screened to form a candidate path set, which can effectively improve the efficiency and accuracy of path planning, optimize resource allocation, enhance user experience, and ensure the stability and reliability of the network.

[0057] In some embodiments, searching for a feasible path that satisfies the constraint conditions in the bearer network model based on the bifurcation point of the bearer link corresponding to each access point includes: Based on the first divergence point of the bearer link corresponding to each access point, the associated first bearer link is determined. Based on the constraints, it is determined whether the associated first bearer link matches the next access point. If so, the corresponding feasible path is recorded. Otherwise, the path search is continued based on the second divergence point of the bearer link corresponding to each access point. This cycle continues until all feasible paths are found.

[0058] It can be understood that gradually narrowing the search range through divergence points can reduce unnecessary calculations and comparisons, thereby improving search efficiency; by considering multiple divergence points, the optimal path can be selected from multiple possible paths, increasing the flexibility and accuracy of path selection.

[0059] In some embodiments, determining a bearer link corresponding to each access point based on geographic information and service requirements of the plurality of access points includes: searching for multiple bearer links adjacent to each access point in the bearer network model according to the geographic information of each access point; According to the service requirements of each access point, a bearer link corresponding to each access point is determined from a plurality of adjacent bearer links.

[0060] It is understandable that by selecting corresponding bearer links in combination with the geographical information of multiple access points and service requirements, network resources can be used more effectively and resource waste can be avoided.

[0061] In some embodiments, the above method further comprises: The candidate path set is sent to the client, which is used to obtain user instructions and determine the target path from the candidate path set based on the user instructions; Receive the target path sent by the client.

[0062] It can be understood that by sending a set of candidate paths to the client and receiving the target path sent by the client, the user is allowed to select from multiple candidate paths. The user can make the best choice based on personal needs and preferences, thereby meeting diverse user needs and improving user satisfaction.

[0063] In some embodiments, the above method further comprises: Generate construction drawings and resource occupancy tables for optical cable laying based on the target path; Among them, the construction drawing includes the routing direction of the optical cable, the location of the access point, the pipeline laying method and the location of the joints; the resource occupancy table includes the pipeline length, the number of occupied pipe holes and the required equipment and materials.

[0064] It can be understood that by generating construction drawings and resource occupancy tables for optical cable laying based on the target path, clear guidance is provided to the construction team, ensuring a smooth construction process and improving construction efficiency.

[0065] The embodiments of the present invention have the following beneficial effects: (1) Improve the accuracy and efficiency of optical cable path planning: Through the application of automation technology and intelligent algorithms, the present invention can quickly generate a variety of optical cable laying paths, avoiding the errors caused by personal experience and subjective judgment in traditional manual planning; the system can comprehensively consider various factors such as pipeline occupancy rate and various types of existing pipeline dumb resource carrying systems to ensure that the designed path is more scientific and reasonable, thereby improving the accuracy and efficiency of planning.

[0066] (2) Optimize path selection and improve resource utilization: The present invention can generate multiple alternative paths at a time, avoiding the limitations of a single path; it provides more options for planning and design personnel, so that the final selected path is not only of reasonable length, but also effectively avoids network congestion and improves resource utilization efficiency.

[0067] (3) Reduce design costs: Traditional optical cable laying path planning requires on-site surveys and drawing, which is time-consuming, labor-intensive and costly. The present invention reduces manual intervention through an automated routing method, reduces the labor and time costs in the design process, and reduces rework and resource waste caused by human errors.

[0068] (4) Enhanced design flexibility and scalability: The present invention generates multiple path solutions by combining the bifurcation points of the bearer network model for path search. This method is highly efficient and can adapt to network environments of different scales and complexities. Whether it is a small network or a large network, the system can efficiently perform path calculations and has strong flexibility and scalability.

[0069] The optical cable path planning device provided by an embodiment of the present invention is described below. The optical cable path planning device described below and the optical cable path planning method described above can be referenced to each other.

[0070] Figure 4 A schematic diagram of the structure of the optical cable path planning device provided by an embodiment of the present invention is shown in FIG. Figure 4 As shown, the optical cable path planning device 400 includes: An acquisition unit 410 is configured to acquire geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area, and determine the optical cable path planning requirements of the target area; A construction unit 420 is configured to construct a bearer network model of pipeline dumb resources based on geographic information and attribute information of each bearer point; A determination unit 430 is configured to determine planning objectives and constraints, as well as geographic information and service requirements of multiple access points based on the optical cable path planning requirements; The planning unit 440 is configured to search for feasible paths that meet the constraints in the bearer network model using a depth-first search algorithm based on the planning target and the geographic information and service requirements of multiple access points, and generate a candidate path set.

[0071] Optionally, based on the geographic information and attribute information of each bearer point, a bearer network model of pipeline dumb resources is constructed, including: Pre-process the geographic information of each bearing point to determine the direction information, relative position and connection relationship of each bearing point; Preprocess the attribute information of each bearing point to obtain the key information of each bearing point; Based on the direction information, relative position and connection relationship of each bearing point, an initial bearing network model is constructed; Based on the key information of each bearer point, the initial bearer network model is optimized to obtain a bearer network model.

[0072] Optionally, based on the planning objectives, geographic information of multiple access points, and service requirements, a depth-first search algorithm is used to search for feasible paths that meet the constraints in the bearer network model, and a candidate path set is generated, including: Based on the bearer network model, determining the cross-relationship of multiple bearer links, and based on the cross-relationship of the multiple bearer links, determining multiple branch points from each bearer point; Determine the corresponding bearer link for each access point based on the geographic information and service requirements of multiple access points; Based on the depth-first search algorithm, the branch point of the bearer link corresponding to each access point is found from multiple branch points. Based on the branch point of the bearer link corresponding to each access point, a feasible path that meets the constraints is searched in the bearer network model; Grouping and supplementing the found feasible paths to obtain multiple routes from the starting access point to the target access point; The multiple routes are evaluated to obtain evaluation results, and the multiple routes are screened according to the evaluation results to obtain a candidate path set.

[0073] Optionally, based on the bifurcation point of the bearer link corresponding to each access point, searching for a feasible path that meets the constraint conditions in the bearer network model includes: Based on the first divergence point of the bearer link corresponding to each access point, the associated first bearer link is determined. Based on the constraints, it is determined whether the associated first bearer link matches the next access point. If so, the corresponding feasible path is recorded. Otherwise, the path search is continued based on the second divergence point of the bearer link corresponding to each access point. This cycle continues until all feasible paths are found.

[0074] Optionally, determining a bearer link corresponding to each access point based on geographic information and service requirements of the multiple access points includes: searching for multiple bearer links adjacent to each access point in the bearer network model according to the geographic information of each access point; According to the service requirements of each access point, a bearer link corresponding to each access point is determined from a plurality of adjacent bearer links.

[0075] Optionally, the planning objectives include: minimizing total cost, minimizing failure risk and maximizing resource utilization; the constraints include: the remaining capacity of the pipeline is greater than or equal to the required capacity, the bending radius of the optical cable is greater than or equal to a first preset threshold, and the construction difficulty value is less than or equal to a second preset threshold.

[0076] Optionally, the optical cable path planning device further includes: a sending unit, configured to send the candidate path set to the client, and the client is configured to obtain a user instruction and determine a target path from the candidate path set based on the user instruction; The receiving unit is used to receive the target path sent by the client.

[0077] Optionally, the optical cable path planning device further includes: A generation unit, used to generate a construction drawing and resource occupancy table for laying optical cables based on a target path; Among them, the construction drawing includes the routing direction of the optical cable, the location of the access point, the pipeline laying method and the location of the joints; the resource occupancy table includes the pipeline length, the number of occupied pipe holes and the required equipment and materials.

[0078] It should be noted here that the optical cable path planning device provided in the embodiment of the present invention can implement all the method steps implemented in the above-mentioned optical cable path planning method embodiment, and can achieve the same technical effect. The parts and beneficial effects of this embodiment that are the same as the method embodiment will not be described in detail here.

[0079] Figure 5 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention, such as Figure 5 As shown, the electronic device may include: a processor 510, a communications interface 520, a memory 530, and a communications bus 540, wherein the processor 510, the communications interface 520, and the memory 530 communicate with each other via the communications bus 540. The processor 510 may invoke logic instructions in the memory 530 to execute a method for optical cable path planning, which includes: obtaining geographic information and attribute information of each bearer point of pipeline dummy resources in a target area, and determining the optical cable path planning requirements of the target area; constructing a bearer network model for the pipeline dummy resources based on the geographic information and attribute information of each bearer point; determining the geographic information and service requirements of multiple access points based on the optical cable path planning requirements, and determining planning objectives and constraints; and using a depth-first search algorithm to search for feasible paths that meet the constraints in the bearer network model based on the planning objectives and the geographic information and service requirements of the multiple access points, thereby generating a set of candidate paths.

[0080] Furthermore, the logic instructions in the aforementioned memory 530 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the portion that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a mobile hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0081] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, i.e., they may be located in one location or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of the present embodiment. Persons of ordinary skill in the art will be able to understand and implement the present invention without inventive effort.

[0082] Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented using software plus a necessary general-purpose hardware platform, or of course, hardware. Based on this understanding, the essence of the above technical solution, or the portion that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, or an optical disk, and includes a number of instructions for causing a computer device (such as a personal computer, server, or network device) to execute the methods described in each embodiment or certain portions of the embodiments.

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

Claims

1. A method for planning an optical cable path, characterized in that: include: Obtaining geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area, and determining the optical cable path planning requirements of the target area; Constructing a bearer network model of the pipeline dumb resources based on the geographic information and attribute information of each bearer point; Based on the optical cable path planning requirements, determining the geographic information and business requirements of multiple access points, and determining planning objectives and constraints; Based on the planning goal and the geographic information and service requirements of the multiple access points, a depth-first search algorithm is used to search for feasible paths that meet the constraints in the bearer network model to generate a candidate path set.

2. The optical cable path planning method according to claim 1, wherein: The constructing of the bearer network model of the pipeline dumb resource based on the geographic information and attribute information of each bearer point includes: Preprocessing the geographic information of each bearing point to determine the direction information, relative position and connection relationship of each bearing point; Preprocessing the attribute information of each bearing point to obtain key information of each bearing point; Constructing an initial bearer network model based on the direction information, relative position and connection relationship of each bearer point; Based on the key information of each bearer point, the initial bearer network model is optimized to obtain the bearer network model.

3. The optical cable path planning method according to claim 1, wherein: The step of searching for feasible paths that meet the constraints in the bearer network model using a depth-first search algorithm based on the planning objectives and the geographic information and service requirements of the multiple access points to generate a set of candidate paths includes: Determining a cross relationship among multiple bearer links based on the bearer network model, and determining a plurality of branch points from each bearer point based on the cross relationship among the multiple bearer links; Determining a bearer link corresponding to each access point based on geographic information and service requirements of the multiple access points; Based on a depth-first search algorithm, searching for a branch point of a bearer link corresponding to each access point from the multiple branch points, and searching for a feasible path that meets the constraint condition in the bearer network model based on the branch point of the bearer link corresponding to each access point; Grouping and supplementing the found feasible paths to obtain multiple routes from the starting access point to the target access point; The multiple routes are evaluated to obtain evaluation results, and the multiple routes are screened according to the evaluation results to obtain a candidate path set.

4. The optical cable path planning method according to claim 3, wherein: The searching for a feasible path that satisfies the constraint condition in the bearer network model based on the branch point of the bearer link corresponding to each access point includes: Based on the first divergence point of the bearer link corresponding to each access point, an associated first bearer link is determined. Based on the constraint condition, it is determined whether the associated first bearer link matches the next access point. If so, the corresponding feasible path is recorded. Otherwise, the path search is continued based on the second divergence point of the bearer link corresponding to each access point. This cycle is repeated until all feasible paths are found.

5. The optical cable path planning method according to claim 3, wherein: The determining, based on the geographic information and service requirements of the plurality of access points, a bearer link corresponding to each access point includes: searching, in the bearer network model, for a plurality of bearer links adjacent to each access point according to the geographic information of each access point; According to the service requirements of each access point, a bearer link corresponding to each access point is determined from the multiple adjacent bearer links.

6. The optical cable path planning method according to claim 1, wherein: The planning objectives include: minimizing total cost, minimizing failure risk, and maximizing resource utilization; the constraints include: the remaining capacity of the pipeline is greater than or equal to the required capacity, the bending radius of the optical cable is greater than or equal to a first preset threshold, and the construction difficulty value is less than or equal to a second preset threshold.

7. The optical cable path planning method according to any one of claims 2 to 6, characterized in that: The method further comprises: Sending the candidate path set to a client, the client being configured to obtain a user instruction and determine a target path from the candidate path set based on the user instruction; Receive the target path sent by the client.

8. The optical cable path planning method according to claim 7, characterized in that: The method further comprises: Based on the target path, generating a construction drawing and resource occupancy table for laying optical cables; The construction drawing includes the routing direction of the optical cable, the location of the access point, the pipeline laying method and the location of the joints; the resource occupancy table includes the pipeline length, the number of occupied pipe holes and the required equipment and materials.

9. An optical cable path planning device, characterized in that: include: An acquisition unit, configured to acquire geographic information and attribute information of each bearing point of the pipeline dumb resources in the target area, and determine the optical cable path planning requirements of the target area; A construction unit, configured to construct a bearer network model of the pipeline dumb resource based on the geographic information and attribute information of each bearer point; A determination unit, configured to determine planning objectives and constraints, as well as geographic information and service requirements of multiple access points based on the optical cable path planning requirements; A planning unit is configured to search for feasible paths that meet the constraints in the bearer network model using a depth-first search algorithm based on the planning target and the geographic information and service requirements of the multiple access points, and generate a candidate path set.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the optical cable path planning method according to any one of claims 1 to 8 is implemented.

Images