First-aid repair path planning method and device, electronic equipment and medium

Abstract

The invention provides a first-aid repair path planning method and device, electronic equipment and a medium, and relates to the technical field of first-aid repair path planning, and the method comprises the steps: responding to an equipment alarm, intelligently sorting a fault site first-aid repair sequence through local upward priority search and a topological relation, and recommending an optimal task site to a maintainer in combination with triangular distance path planning, and the travel is dynamically adjusted by considering the overlapping distance when multiple tasks are parallel, and finally, the movement path and state of the maintenance personnel are visually displayed on the map, so that the fault repair efficiency and the accuracy of map visual management are effectively improved.

Description

Technical Field

[0001] The present disclosure relates to the technical field of emergency repair route planning, and in particular to an emergency repair route planning method, device, electronic equipment and medium. Background Art

[0002] The mobile communication network is composed of a large number of independent base station sites. After a regional power outage occurs, the base stations are usually powered by batteries. When there are no batteries or the batteries are discharged, the base stations or transmission equipment in various sites in the area will lose power one after another, and the communication network will experience large-scale site failures.

[0003] At present, related technologies usually use methods such as site pre-classification and site traffic assessment to formulate the order of power generation emergency repairs in sequence or in batches, and give and render single-site emergency repair path suggestions on the map of the IT support system. However, in this method of related technologies, the fault impact judgment is only based on single-site assessment, which cannot effectively reflect the impact caused by network chain reactions. It takes a long time for manual identification of multi-task parallelism and path intersections on GIS maps. Summary of the invention

[0004] The present disclosure provides a repair path planning method, device, electronic device and medium to solve the problems in the related technology. By responding to equipment alarms, combining local upward priority search and topological relationships, the order of repairing fault sites is intelligently sorted, and the optimal task site is recommended to maintenance personnel using triangular distance path planning. At the same time, considering the overlapping distance when multiple tasks are parallel, the maintenance personnel's itinerary is dynamically adjusted, and finally the movement path and status of the maintenance personnel are intuitively displayed, effectively improving the efficiency of fault repair and the accuracy of map visualization management.

[0005] The first aspect of the present disclosure provides a method for emergency repair path planning, the method comprising: responding to an equipment alarm event at a fault site, using a local upward priority search algorithm, and combining the topological relationship information of the network transmission in the site to determine the site emergency repair order of the fault site; based on the site emergency repair order of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, performing triangular distance path planning on the fault site to obtain the task site of the maintenance personnel, and recommending the task site to the maintenance personnel; if the distance between the maintenance personnel and the task site is within a preset overlapping distance, according to the occurrence time and clearance time of the fault site with the same name as the overlapping task site, marking the maintenance personnel's marking time set to obtain the marking result; traversing the marking time set, based on the marking result, segmenting the marking time in the marking time set to obtain the maintenance personnel's movement path and the movement path status corresponding to the movement path, and displaying it on a map based on the movement path and the movement path status.

[0006] In some embodiments of the present disclosure, a local upward first search algorithm is used in combination with the topological relationship information of the network transmission in the site to determine the site repair order of the faulty site. Previously, the method included: obtaining the initial topological relationship information of the network transmission in the site; in the initial topological relationship information, performing bidirectional deduplication processing on the links formed between any two sites to obtain deduplicated topological relationship information, wherein each link in the deduplicated topological relationship information is unique.

[0007] In some embodiments of the present disclosure, a local upward priority search algorithm is used, and combined with the topological relationship information of the network transmission in the site, the site repair order of the faulty site is determined, including: based on the preset site category, the faulty sites in the topological relationship information are classified to obtain the category of each faulty site in the topological relationship information, and the preset site categories include access layer, aggregation layer and core layer; the topological structure of the transmission equipment in each faulty site in the topological relationship information and the category of each faulty site are used to form hybrid topological information; the category of each faulty site is used to screen out the set of faulty sites belonging to each preset site category in the hybrid topological information; according to the search rules, the set of faulty sites of each preset site category is locally upward-first searched to determine the site repair order of the faulty site.

[0008] In some embodiments of the present disclosure, based on the site repair order of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, triangular distance path planning is performed on the fault site to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel, including: classifying the fault site set of each preset site category according to the geographical area to obtain a subset of fault sites in the fault point set of each preset site category, wherein the geographical area is determined based on the location information of the fault site; for the fault site set of each preset site category, according to the geographical area corresponding to the location information of the maintenance personnel and in accordance with the site repair order of the fault site, triangular distance path planning is performed on the subset of fault sites in the fault point set of each preset site category to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel.

[0009] In some embodiments of the present disclosure, for each set of fault sites of a preset site category, according to the geographical area corresponding to the location information of the maintenance personnel and in accordance with the site repair order of the fault sites, triangular distance path planning is performed on a subset of fault sites in the set of fault points of each preset site category to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel, including: taking the location information of the first maintenance personnel as the center, and determining the first fault site and the second fault site closest to the first maintenance personnel in accordance with the site repair order; calling the navigation public service interface to respectively determine the first arrival time of the first maintenance personnel at the first fault site and the second arrival time of the first maintenance personnel at the second fault site; comparing the first arrival time and the second arrival time, taking the first fault site or the second fault site with the shortest arrival time between the first arrival time and the second arrival time as the first task site, and recommending the first task site to the first maintenance personnel.

[0010] In some embodiments of the present disclosure, if the distance between the maintenance personnel and the task site is within a preset overlapping distance, the maintenance personnel's marking time set is identified based on the occurrence time and clearance time of the fault site with the same name as the overlapping task site to obtain an identification result, including: determining the distance between the maintenance personnel and the task site; if the distance is less than or equal to the preset overlapping distance, determining that the maintenance personnel overlaps with the task site; determining the occurrence time and clearance time of the fault site with the same site name as the overlapping task site; based on the maintenance personnel's marking time set, occurrence time and clearance time, identifying the marking time in the marking time set to obtain an identification result.

[0011] In some embodiments of the present disclosure, based on the marking time set, occurrence time and clearing time of the maintenance personnel, the marking time in the marking time set is marked and processed to obtain marking results, including: if the first marking time in the marking time set is between the occurrence time and the clearing time, the first marking time is marked as a fault handling action; if the first marking time is after the clearing time, the first marking time is marked as a fault recovery action; if the first marking time is before the occurrence time, the first marking time is marked as a temporary emergency repair action.

[0012] In some embodiments of the present disclosure, a set of marking times is traversed, and based on the identification results, the marking times in the set of marking times are segmented to obtain the movement path of the maintenance personnel and the movement path state corresponding to the movement path, including: traversing all the marking times in the set of marking times of the maintenance personnel, identifying the position information of the first marking time after the identification process as the first segmentation node, and identifying the position information of the second marking time that has not been identified as the second segmentation node; based on the first segmentation node and the second segmentation node, generating the movement path of the maintenance personnel, the movement path includes an en route path and an action path; based on the identification results in the movement path, determining the movement path state corresponding to the movement path.

[0013] In some embodiments of the present disclosure, a display is performed on a map based on a motion path and a motion path status, including: marking points on the map according to the location information of the motion path and connecting them in chronological order; and presenting the connected line segments on the map in layers according to the motion path and the motion path status.

[0014] A second aspect of the present disclosure provides a repair path planning device, the device comprising:

[0015] A repair sequence determination unit is used to respond to an equipment alarm event at a faulty site, use a local upward priority search algorithm, and combine topological relationship information of network transmission in the site to determine the site repair sequence of the faulty site;

[0016] A task site determination unit is used to perform triangular distance path planning for the fault site based on the site repair sequence of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, obtain the task site of the maintenance personnel, and recommend the task site to the maintenance personnel;

[0017] The identification unit is used to identify the maintenance personnel's marking time set according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site if the distance between the maintenance personnel and the task site is within the preset overlapping distance, and obtain the identification result;

[0018] The segmentation processing unit is used to traverse the marking time set, and based on the identification result, segment the marking time in the marking time set to obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and display it on the map based on the movement path and the movement path status.

[0019] The third aspect embodiment of the present disclosure proposes an electronic device, comprising: a processor and a memory for storing a computer program that can be run on the processor, wherein the processor, when used to run the computer program, executes the method described in the first aspect embodiment of the present disclosure.

[0020] The fourth aspect embodiment of the present disclosure proposes a non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to enable a computer to execute the method described in the first aspect embodiment of the present disclosure.

[0021] The fifth aspect embodiment of the present disclosure provides a computer program product, including a computer program, which implements the method described in the first aspect embodiment of the present disclosure when executed by a processor.

[0022] In summary, according to the emergency repair path planning method proposed in the present invention, by responding to the equipment alarm event of the fault site, using the local upward priority search algorithm, and combining the topological relationship information of the network transmission in the site, the site emergency repair order of the fault site is determined; based on the site emergency repair order of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, the fault site is triangular distance path planning is performed on the fault site to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel; if the distance between the maintenance personnel and the task site is within the preset overlapping distance, according to the occurrence time and clearance time of the fault site with the same name as the overlapping task site, the maintenance personnel's marking time set is marked and processed to obtain the marking result; the marking time set is traversed, and based on the identification result, the marking time in the marking time set is segmented to obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and based on the movement path and the movement path status, it is displayed on the map, so as to realize the intelligent sorting of the emergency repair order of the fault site by responding to the equipment alarm, combining the local upward priority search and the topological relationship, and using the triangular distance path planning to recommend the optimal task site to the maintenance personnel. At the same time, the overlapping distance when multiple tasks are carried out in parallel is taken into consideration, and the maintenance personnel's itinerary is dynamically adjusted. Ultimately, the movement path and status of the maintenance personnel are intuitively displayed, effectively improving the efficiency of fault repair and the accuracy of map visualization management.

[0023] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description are used to explain the principles of the present disclosure, and do not constitute improper limitations on the present disclosure.

[0025] Figure 1 A flowchart of a repair path planning method provided by an embodiment of the present disclosure;

[0026] Figure 2 A flowchart of another method for planning a repair path provided by an embodiment of the present disclosure;

[0027] Figure 3A flowchart of another method for planning a repair path provided by an embodiment of the present disclosure;

[0028] Figure 4 A schematic diagram of a specific hybrid topology information provided by an embodiment of the present disclosure;

[0029] Figure 5 A schematic diagram of performing a local upward search for a specific search rule of an access layer provided in an embodiment of the present disclosure;

[0030] Figure 6 A schematic diagram of performing a local upward search for a specific search rule of an access convergence layer provided in an embodiment of the present disclosure;

[0031] Figure 7 A flowchart of another method for planning a repair path provided by an embodiment of the present disclosure;

[0032] Figure 8 A flowchart of another method for planning a repair path provided by an embodiment of the present disclosure;

[0033] Fig. 9 A flowchart of another method for planning a repair path provided by an embodiment of the present disclosure;

[0034] Fig.10 A flowchart of another method for planning a repair path provided by an embodiment of the present disclosure;

[0035] Fig.11 A schematic diagram of a specific map display provided in an embodiment of the present disclosure;

[0036] Fig.12 A schematic diagram of the structure of a repair path planning device provided by an embodiment of the present disclosure;

[0037] Fig.13 A schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0038] The embodiments of the present disclosure are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions.

[0039] The mobile communication network is composed of a large number of independent base station sites. After a regional power outage occurs, the base stations are usually powered by batteries. When there are no batteries or the batteries are discharged, the base stations or transmission equipment in various sites in the area will lose power one after another, and the communication network will experience large-scale site failures.

[0040] At present, related technologies usually use methods such as site pre-classification and site traffic assessment to formulate the order of power generation emergency repairs in sequence or in batches, and give and render single-site emergency repair path suggestions on the map of the IT support system. However, in this method of related technologies, the fault impact judgment is only based on single-site assessment, which cannot effectively reflect the impact caused by network chain reactions. It takes a long time for manual identification of multi-task parallelism and path intersections on GIS maps.

[0041] In order to solve the problems existing in the related technologies, the present invention responds to equipment alarms immediately, uses a local upward priority search algorithm combined with network topology relationships, and intelligently sorts the priority of fault site repairs. Subsequently, based on triangular distance path planning, the optimal task site is recommended to maintenance personnel in combination with location information. In the face of multiple tasks in parallel, overlapping distances are also considered, and maintenance itineraries are dynamically adjusted to ensure efficient processing. Finally, the movement path and status of maintenance personnel are intuitively displayed through maps, significantly improving the efficiency of fault repairs and the accuracy of map management.

[0042] The method proposed in the present disclosure can realize antenna planning efficiently and reliably, and can be mainly applied to antenna planning in high-speed rail network planning and construction, and can also be applied to other antenna planning scenarios, which are not limited in the embodiments of the present disclosure.

[0043] The emergency repair path planning method provided by the present application is described in detail below with reference to the accompanying drawings.

[0044] Figure 1 The following is a flow chart of a method for planning a repair path provided by an embodiment of the present disclosure. Figure 1 As shown, the emergency repair path planning method includes steps 101-104.

[0045] Step 101, in response to an equipment alarm event at a faulty site, a site repair sequence of the faulty site is determined by using a local upward priority search algorithm and combining topological relationship information of network transmission in the site.

[0046] In an embodiment of the present disclosure, when the emergency repair path planning system receives an equipment alarm event at a fault site, a local upward priority search algorithm is initiated. The local upward priority search algorithm uses the topological relationship information transmitted by the network in the site to determine the site emergency repair order of the fault site.

[0047] The priority of site repair is core layer, aggregation layer, and access layer. This ensures that the most critical faulty sites are handled first to minimize the impact on the overall network service.

[0048] Step 102 , based on the site repair sequence of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, triangulated distance path planning is performed on the fault site to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel.

[0049] In an embodiment of the present disclosure, after determining the repair order of the fault site, the repair path planning system will perform triangular distance path planning based on the location information of the fault site and the current location information of the maintenance personnel. Triangular distance path planning takes into account the shortest path for the maintenance personnel to reach each fault site from the current location, while taking into account the feasibility of the path (such as road conditions, traffic restrictions, etc.). By calculating the triangular distance of each possible path (i.e., the geometric relationship between the location of the maintenance personnel and the two fault site locations closest to the maintenance personnel), the optimal path is selected, and the corresponding fault site is recommended to the maintenance personnel as a task site. This helps maintenance personnel quickly locate and go to the site that needs repair.

[0050] Step 103, if the distance between the maintenance personnel and the task site is within the preset overlapping distance, the maintenance personnel's marking time set is marked according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site to obtain a marking result.

[0051] In an embodiment of the present disclosure, after the maintenance personnel receive the recommendation of the task site, the emergency repair path planning system will compare the distance between the maintenance personnel and the task site with the preset overlapping distance. If the distance is within the preset overlapping distance, it means that the maintenance personnel can overlap with the task site. At this time, the emergency repair path planning system will mark the maintenance personnel's dotting time set according to the occurrence time and clearance time of the fault site with the same name as the overlapping task site. This means that the emergency repair path planning system will check the location information of the maintenance personnel at different time points and determine whether these time points correspond to the occurrence or clearance time of a certain fault site. If so, corresponding marks will be made in the dotting time set for subsequent analysis and display of the maintenance personnel's movement path and movement path status, which will help the maintenance personnel to track the progress of the emergency repair in real time, optimize resource allocation, and arrange time reasonably to ensure the efficient completion of the emergency repair task.

[0052] The occurrence time is the time when the fault site first detects the device alarm or abnormality. The clearing time is the time when the device returns to normal working state after the fault site is repaired. The marking time is the time when the maintenance personnel record their position or update the status during the repair task. The marking time reflects the maintenance personnel's work progress, movement trajectory, and switching between different fault sites.

[0053] Step 104, traverse the marking time set, segment the marking time in the marking time set based on the identification result, obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and display it on the map based on the movement path and the movement path status.

[0054] In an embodiment of the present disclosure, the system traverses the set of marking times of the maintenance personnel and segments the marking times according to the identification results. Each segment represents the process of the maintenance personnel moving from one fault site to another fault site within a certain time period. Based on these segmentation information, the system generates the movement path of the maintenance personnel and the corresponding movement path status (such as repair failure, natural recovery, temporary repair, repair success, temporary repair success, temporary repair failure, etc.). Then, the repair path planning system displays this information on the map so that managers can track the dynamics of the maintenance personnel and the repair progress in real time. This helps to improve the overall repair efficiency and management level.

[0055] In summary, according to the emergency repair path planning method proposed in the present invention, by responding to the equipment alarm event of the fault site, using the local upward priority search algorithm, and combining the topological relationship information of the network transmission in the site, the site emergency repair order of the fault site is determined; based on the site emergency repair order of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, the fault site is triangular distance path planning is performed on the fault site to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel; if the distance between the maintenance personnel and the task site is within the preset overlapping distance, according to the occurrence time and clearance time of the fault site with the same name as the overlapping task site, the maintenance personnel's marking time set is marked and processed to obtain the marking result; the marking time set is traversed, and based on the identification result, the marking time in the marking time set is segmented to obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and based on the movement path and the movement path status, it is displayed on the map, so as to realize the intelligent sorting of the emergency repair order of the fault site by responding to the equipment alarm, combining the local upward priority search and the topological relationship, and using the triangular distance path planning to recommend the optimal task site to the maintenance personnel. At the same time, the overlapping distance when multiple tasks are carried out in parallel is taken into consideration, and the maintenance personnel's itinerary is dynamically adjusted. Ultimately, the movement path and status of the maintenance personnel are intuitively displayed, effectively improving the efficiency of fault repair and the accuracy of map visualization management.

[0056] As a possible implementation, Figure 2 The flowchart of another method for emergency repair path planning shown in the figure is based on the above embodiment, using the local upward priority search algorithm, and combining the topological relationship information of the network transmission in the site to determine the site emergency repair order of the fault site. The previous specific process includes the following steps:

[0057] Step 201: Acquire initial topology relationship information of network transmission in a site.

[0058] In the embodiments of the present disclosure, in order to understand the entire network structure and determine the basis of the connection relationship between sites, the present disclosure first needs to obtain the initial topology relationship information of the network transmission in the site during the process of building the network system.

[0059] The present disclosure may utilize the physical location of the site, the connection mode between the sites (such as wired, wireless), the speed and bandwidth of the connection, etc. to obtain the initial topological relationship information.

[0060] In an optional embodiment of the present disclosure, the present disclosure may obtain site location information (such as longitude and latitude information) through base station positioning information or manual recording, as shown below:

[0061] Site name: "sitecode":"a site name"

[0062] Dimension: "latitude": 30.74301767

[0063] Longitude: "longitude":103.96581412

[0064] Site level: "site level": core or aggregation or access

[0065] The present disclosure obtains the initial topological relationship information of the transmission PTN or SPN (the network type is not limited, the same network can be used, if there are multiple networks, they need to be used in different domains) in the site by collecting data or manually recording through the transmission equipment network management. After conversion according to the transmission equipment belonging site resource information, the initial topological relationship information of the present disclosure can be presented in a structured form. Each topological example is as follows:

[0066] A-side site name: "Asitecode":"Site name A"

[0067] Z-side site name: "Zsitecode":"site name Z"}.

[0068] Step 202: In the initial topology relationship information, a link formed between any two sites is bidirectionally deduplicated to obtain deduplicated topology relationship information, wherein each link in the deduplicated topology relationship information is unique.

[0069] In the embodiments of the present disclosure, after the initial topology relationship information is obtained, there may be duplicate link information. In order to obtain a clearer and more accurate network topology structure, the present disclosure can perform bidirectional deduplication processing on the links formed between any two sites.

[0070] After two-way deduplication processing, the present disclosure can obtain a deduplicated topological relationship information. In the deduplicated topological relationship information, each link is unique and there is no duplication. This greatly simplifies the subsequent network analysis and management work.

[0071] In an optional embodiment of the present disclosure, the present disclosure takes the A-end site name: "Asitecode":"some site name A"; Z-end site name: "Zsitecode":"some site name Z"} as an example, the present disclosure can eliminate duplications in the full amount of A and Z ends in both positive and negative interactions, that is, AZ is compared with AZ to remove duplications, and ZA is compared with ZA to remove duplications again, ensuring that no matter what the direction of the link is (A to Z or Z to A), only one unique record is retained in the final topological relationship information.

[0072] In summary, through the method provided by the present invention, the initial topological relationship information of the network transmission in the site is obtained, and two-way deduplication processing is performed. The present invention can obtain a clear and accurate network topology structure, providing strong support for subsequent network analysis and management work.

[0073] As a possible implementation, Figure 3 The flowchart of another method for emergency repair path planning shown in the figure, based on the above embodiment, uses the local upward priority search algorithm and combines the topological relationship information of the network transmission in the site to determine the specific process of the site emergency repair order of the fault site, including the following steps:

[0074] Step 301 , based on preset site categories, classify the faulty sites in the topology relationship information to obtain the category of each faulty site in the topology relationship information, wherein the preset site categories include access layer, aggregation layer and core layer.

[0075] In the embodiments of the present disclosure, the present disclosure predefines preset site categories, such as access layer, aggregation layer, and core layer. These preset site categories represent sites of different levels and functions in the network topology. The wireless communication network of the present disclosure adopts a hierarchical design in the local network part, and each site is classified according to the access layer, aggregation layer, and core layer in the preset site categories to obtain the category of each fault site.

[0076] Step 302: forming hybrid topology information by using the topology structure of the transmission equipment in each faulty site and the category of each faulty site in the topology relationship information.

[0077] In the embodiments of the present disclosure, the topological structure of each faulty site in the topological relationship information of the topological structure of the transmission equipment in the site and the category of each faulty site determined above are combined to form a hybrid topological information composed of a mesh or tree structure (the network type is not limited, the same network can be used, and if there are multiple networks, domain-by-domain calculation is required). Figure 4 A schematic diagram of a specific hybrid topology information is shown. The hybrid topology information disclosed in the present invention can be represented as a graph structure, in which nodes represent various fault sites and edges represent connection relationships.

[0078] Step 303: using the category of each faulty site, filter out a set of faulty sites belonging to each preset site category in the hybrid topology information.

[0079] In the embodiment of the present disclosure, according to the preset site categories (access layer, aggregation layer and core layer), the set of faulty sites belonging to each category is screened out from the hybrid topology information. This is done to perform targeted processing on the faulty sites of each category later.

[0080] Step 304: According to the search rule, a local upward priority search is performed on the set of faulty sites of each preset site category to determine the site repair sequence of the faulty sites.

[0081] In the embodiment of the present disclosure, a search rule is formulated for each set of faulty sites of a preset site category to determine the repair order of the faulty sites. Local upward priority search means that we will prioritize searching and repairing faulty sites that are higher in the network topology (or have more important functions).

[0082] Since the access layer fault points disclosed in the present invention may include the upper layer fault points of the access layer and the common fault points of the access layer, and the aggregation layer fault points include the upper layer fault points of the aggregation layer and the common fault points of the aggregation layer, the present invention adopts a local upward priority search algorithm based on the communication network topology to obtain the site repair order, and the site repair priority order is the upper layer fault point of the aggregation layer > the common fault point of the aggregation layer > the upper layer fault point of the access layer > the common fault point of the access layer.

[0083] In an optional embodiment of the present disclosure, the search rules of the present disclosure may be specifically as follows:

[0084] A local upward search is performed based on the search rules of the access layer. Due to the networking structure, the higher the network layer, the greater the impact of node transmission interruption or power outage. Therefore, the purpose of this link is to find sites at the access layer that are closer to the aggregation layer and have greater impact or risk.

[0085] According to the fault sites determined in the present disclosure, a set of fault sites involving base station interruption and belonging to the access layer is screened out, and the fault site 1 with the latest interruption time is selected to start the search.

[0086] According to the hybrid topology information search, after searching for any opposite site 2, mark the network element as visited, and detect the site 2 level information. If the site 2 level information is the access layer, continue to search for the opposite end of site 2, and repeat the process until a convergence layer site is searched. If before finding the convergence layer site, the next level opposite end site cannot be searched (that is, the end of the branch chain) or the next level opposite end has been visited (that is, a loop), return to the divergence point and search for the unvisited site again.

[0087] like Figure 5 As shown, the present disclosure provides a specific schematic diagram of performing local upward search for the search rules of the access layer, and the latest access layer base station interruption site is found to be site 1, which is marked as visited; the opposite end is searched with site 1 to find the opposite end site 2, which is marked as visited; the opposite end is searched with site 2 to find the opposite end site 3, which is marked as visited; the opposite end is searched with site 3, and no new unvisited sites are found, and the previous site 2 is returned to search the unvisited sites again, and the opposite end site 4 is found; the opposite end site 4 is searched to find the opposite end site 5, and the opposite end is searched with site 5 to find no new unvisited sites, and the previous level site 4 is returned; the opposite end site 4 is searched to find the opposite end site 6, and the opposite end site 1 is searched to find the opposite end site 4, and site 1 is a visited site, and the search returns to site 6. After searching for no new additions, the previous site 4 is returned again, and the process is repeated until returning to site 1. The unvisited sites are searched with site 1, and the aggregation layer site 7 is found. The search ends after the upward path of the faulty site 1 is determined.

[0088] In actual situations, there may be multiple sites in the upward path of fault site 1 (site 1-site 7). The site with the least number of hops from site 7 is the upper fault point of the access network. If there is no transmission interruption, it is marked as a city power outage type. The rest are marked as common fault points at the access layer.

[0089] Site 1 that has completed the above process is marked as searched (note: not visited), the visited mark status of all sites is cleared, and the above steps are repeated for the sites with the latest base station interruption and unsearched sites in chronological order; after all are completed, all identified access network upper layer fault points and access layer common fault points are eliminated.

[0090] A local upward search is performed based on the search rules of the aggregation layer. Due to the networking architecture of the communication network, node failures in the upper layer of the network will propagate to the lower layer. Therefore, the purpose of this link is to find the fault sites in the aggregation layer that have serious impacts and high risk points close to the core layer.

[0091] According to the determined faulty sites, a set of faulty sites that are involved in transmission interruption and belong to the aggregation layer is screened out, and the faulty site with the latest interruption time is selected to start the search.

[0092] According to the above-mentioned transmission paired convergence layer and above hybrid topology (neither of the two end sites is the access layer) information search, after searching for the second site of any opposite end and marking the site as visited, continue to search for the opposite end of the second site, and repeat the process until a core layer site is searched; if before the convergence layer site is found, the next level opposite end site cannot be found (that is, the end of the branch chain) or the site has been visited (forming a loop), return to the previous level divergence point to search for the unvisited sites again, and repeat the process; until a core layer site is found, marked as visited, the search path from the convergence layer to the core layer site is recorded (excluding the return branch part).

[0093] Clear the visited status of all aggregation layer sites (excluding the core layer), exclude the site that is the first hop of the searched path, and restart the search as above until another unvisited core layer site is visited. Record the search path from the aggregation layer to the core layer site (excluding the return branch part).

[0094] like Figure 6 As shown, the present disclosure provides a specific schematic diagram of performing local upward search for the search rules of the access aggregation layer, and finds that the aggregation layer transmission interruption and disconnection site at the latest time point is site 1, which is marked as visited; searching the opposite end with site 1 finds the opposite end site 2, which is marked as visited; continuing to search the opposite end with site 2 finds the opposite end core layer site 3, marks it as visited, and records it as path 1 (excluding the return branch part); searching the opposite end with site 1 again, and excluding site 2, finds the opposite end site 4; searching the opposite end site 4 finds the core layer site 3 that the opposite end has visited, and returns to the upper-level site 4; searching the opposite end site 4 finds that the opposite end has visited site 2, and returns to the upper-level site 4; searching the opposite end site 4 finds that there is no new opposite end site, and returns to the upper-level site 1; searching the unvisited sites with site 1, finds the core layer site 5, and records it as path 2 (excluding the return branch part), and the search ends.

[0095] In the two paths, query the transmission interruption and disconnection fault sites close to the core layer sites in turn. If there are any, record them as the upper-layer fault sites of the aggregation layer. If not, record the starting site of the path as the upper-layer fault site of the aggregation layer; the remaining transmission interruption and disconnection sites and city power outage sites are recorded as common fault points of the aggregation layer.

[0096] The aggregation layer site 1 that has completed the above process is marked as searched (note: not visited), the visited mark status of all aggregation layer sites is cleared, and the above steps are repeated for the aggregation layer sites that have the latest transmission interruption and have not been searched in chronological order; after all are completed, all the marked aggregation layer upper layer fault sites and aggregation layer common fault points are eliminated.

[0097] In summary, through the method provided in the present invention, a priority repair plan can be efficiently formulated by comprehensively considering the category of the faulty site, the internal topology structure, and the location or functional importance in the network, thereby ensuring the rapid recovery of key sites and services and improving the stability and fault response capabilities of the overall network.

[0098] As a possible implementation, Figure 7 The flowchart of another method for emergency repair path planning is shown. On the basis of the above embodiment, based on the emergency repair sequence of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, the triangular distance path planning is performed on the fault site, the task site of the maintenance personnel is obtained, and the specific process of recommending the task site to the maintenance personnel includes the following steps:

[0099] Step 401 , classify the faulty site set of each preset site category according to geographical areas to obtain a faulty site subset in the fault point set of each preset site category, wherein the geographical area is determined based on location information of the faulty site.

[0100] In an embodiment of the present disclosure, all upper-layer failure points of the aggregation layer, common failure points of the aggregation layer, upper-layer failure points of the access layer, and common failure points of the access layer are divided into four different failure site sets according to four types. In each failure point set, failure site subsets are formed according to regions (cities, districts, counties, etc.).

[0101] The area of ​​each fault site may be obtained through the location information of the fault site. The location information of the fault site disclosed in the present invention may be obtained through base station positioning information or manual records.

[0102] Step 402, for each set of fault sites of the preset site category, according to the geographical area corresponding to the location information of the maintenance personnel and in accordance with the site repair order of the fault sites, triangulated distance path planning is performed on the subset of fault sites in the set of fault points of each preset site category to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel.

[0103] In an embodiment of the present disclosure, taking the location information of the first maintenance personnel as the center and according to the order of emergency repair of the sites, the first fault site and the second fault site closest to the first maintenance personnel are determined; the navigation public service interface is called to respectively determine the first arrival time of the first maintenance personnel at the first fault site and the second arrival time of the first maintenance personnel at the second fault site; the first arrival time and the second arrival time are compared, and the first fault site or the second fault site with the shortest arrival time between the first arrival time and the second arrival time is taken as the first task site, and the first task site is recommended to the first maintenance personnel.

[0104] Specifically, in an optional embodiment of the present disclosure, the present disclosure may plan according to a subset of fault sites in an area where a maintenance personnel is located. When the maintenance personnel is in an urban area, a triangular distance path planning is performed on the subset of fault sites in order of priority:

[0105] Taking the longitude and latitude of the first-line maintenance personnel as the center, find the two sites closest to the maintenance personnel at the upper fault point of the convergence layer to form a triangular planning area. The longitude and latitude distance calculation formula is as follows:

[0106]

[0107] Where d is the distance, the longitude and latitude of point A are substituted into λA and φA respectively, and the longitude and latitude of point B are substituted into λB and φB respectively.

[0108] Call the commonly used navigation public service interface, compare the estimated arrival time of the maintenance personnel at the two sites, and recommend the first task site based on the shortest arrival time;

[0109] Taking the first task site as the center, find the two points with the closest and second closest straight-line distance (excluding the planned sites), form a new triangular planning area, query the navigation information of the two new sites, recommend the second task site according to the shortest arrival time, and so on to complete the repair path planning. This method reduces the frequency of calling the navigation public service interface and shortens the planning time.

[0110] After the triangular distance path planning of the high-level fault site subset is completed, the triangular distance path planning of the low-level fault site subset is carried out, and so on. When there are multiple maintenance teams, the area is divided into smaller areas corresponding to the maintenance teams.

[0111] When the maintenance personnel are located in a non-urban area, the arrival time of the maintenance personnel to all fault points is traversed, and a task site planning path is given according to the priority level corresponding to the fault site category. After completing the emergency repair task of the site, the above plan is repeated.

[0112] In summary, through the method provided by the present invention, the fault points of each preset site category are classified by geographical area, and combined with the location information of the maintenance personnel, triangulated distance path planning is performed on the subset of fault sites according to the repair order, effectively recommending the task site to the nearest maintenance personnel, thereby improving the fault response speed and repair efficiency.

[0113] As a possible implementation, Figure 8The flowchart of another method for planning a repair path is shown. Based on the above embodiment, if the distance between the maintenance personnel and the task site is within the preset overlapping distance, the maintenance personnel's marking time set is marked according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site, and the specific process of obtaining the marking result includes the following steps:

[0114] Step 501, determining the distance between the maintenance personnel and the task site.

[0115] In an embodiment of the present disclosure, the present disclosure may determine the distance between the maintenance personnel and the task site according to the latitude and longitude distance calculation formula in the triangular distance path planning.

[0116] Step 502: If the distance is less than or equal to the preset overlap distance, it is determined that the maintenance personnel overlaps with the task site.

[0117] In the embodiments of the present disclosure, since the IT support system that uses minute-level longitude and latitude data and supports emergency repairs of communication networks involves positioning personnel generally reaching thousands of people and positioning sites tens of thousands, the Pythagorean theorem method of fast calculation is used to make overlapping judgments on maintenance personnel and task sites. In the present disclosure, whether the maintenance personnel and the task site overlap is determined based on whether the distance between the maintenance personnel and the task site is less than N (N is 500 meters in conventional urban areas and 1000 meters in rural areas, adjusted in combination with the local base station deployment density). The specific value of N is based on actual conditions and is not limited in the embodiments of the present disclosure.

[0118] Step 503: Determine the occurrence time and clearing time of the fault site with the same site name as the overlapping task site.

[0119] In an embodiment of the present disclosure, the overlapping status of the minute-level longitude and latitude data set of the same maintenance personnel at the current time (within the statistical time range) and the location information (longitude and latitude) of the task site is judged to obtain the latitude and longitude point set (including the time of the point) where the task site and the maintenance personnel overlap.

[0120] "logincode":"Account information"

[0121] {"collecttime":"2024-03-18 16:51:00"||

[0122] "latitude":30.74301767||

[0123] "longitude":103.96581412

[0124] "overlappedsite": "a site name"}

[0125] {"collecttime":"2024-03-18 17:51:00"||

[0126] "latitude":30.74301747||

[0127] "longitude":103.96581432

[0128] "overlappedsite": "a site name"}...

[0129] The obtained task sites and the overlapping longitude and latitude data sets of maintenance personnel are matched with the site names (sitecode) of the previously determined fault sites according to the overlapping task site names (overlappedsite). For the successfully matched sites, the corresponding time points (collecttime) of the dotted data are extracted, that is, the occurrence time (happeningtime) and the cleaning time (cleaningtime).

[0130] Step 504 , based on the marking time set, the occurrence time and the clearing time of the maintenance personnel, marking the marking time in the marking time set is processed to obtain a marking result.

[0131] In an embodiment of the present disclosure, based on the marking time set, occurrence time and clearing time of the maintenance personnel, the marking time in the marking time set is marked and processed to obtain an marking result, including: if the first marking time in the marking time set is between the occurrence time and the clearing time, the first marking time is marked as a fault handling action; if the first marking time is after the clearing time, the first marking time is marked as a fault recovery action; if the first marking time is before the occurrence time, the first marking time is marked as a temporary emergency repair action.

[0132] In other words, when the time (collecttime) of a certain dotting data in the maintenance personnel's dotting set is between the occurrence time (happeningtime) and the clearing time (cleaningtime) of the fault site with the same site name as the above-mentioned site, the dotting time is identified as a fault handling action, and after traversal, the dotting time is obtained to process the latitude and longitude dotting set of the maintenance personnel's fault handling. When the time of a certain dotting data in the maintenance personnel's dotting set is after the clearing time (cleaningtime) of the fault site with the same site name as the above-mentioned site, the dotting time is identified as a fault recovery action, and after traversal, the dotting time is obtained to process the latitude and longitude dotting set of the maintenance personnel's fault recovery. When the time of a certain dotting data in the maintenance personnel's dotting set is before the occurrence time (cleaningtime) of the fault site with the same site name as the above-mentioned site, the dotting time is identified as a temporary emergency repair action, and after traversal, the dotting time is obtained to process the latitude and longitude dotting set of the maintenance personnel's temporary emergency repair.

[0133] In summary, the method provided by the present disclosure calculates the distance between the maintenance personnel and the task site through triangular distance path planning. When the distance is less than or equal to the preset overlapping distance, the maintenance personnel and the task site are determined to overlap. Subsequently, the occurrence and clearing time of the fault site with the same name as the overlapping task site is matched and determined, and then the marking time of the maintenance personnel is marked based on these time information, and finally a clear marking result is obtained, which effectively improves the accuracy and timeliness of fault processing.

[0134] As a possible implementation, Fig. 9 The flowchart of another method for planning a repair path is shown. On the basis of the above embodiment, the marking time set is traversed, and based on the identification result, the marking time in the marking time set is segmented to obtain the movement path of the maintenance personnel and the specific process of the movement path state corresponding to the movement path, including the following steps:

[0135] Step 601, traverse all marking times in the maintenance personnel's marking time set, mark the position information of the first marking time after marking processing as the first segment node, and mark the position information of the second marking time without marking processing as the second segment node.

[0136] In the embodiment of the present disclosure, by traversing the marking time set of the maintenance personnel, the location information is marked as the first segment node (marked) and the second segment node (unmarked) according to whether the marking time has been marked.

[0137] Specifically, in an optional embodiment of the present disclosure, all the longitude and latitude points of the maintenance personnel's paths are arranged in chronological order, and the query is made from the first point information downward. When the query finds that the site point information belongs to any one of the identification results (fault handling action, fault recovery action, temporary repair action), the longitude and latitude point information at that time point is identified as segment node 1.

[0138] Continue to query until the point does not belong to any of the identification results. The point information at this time point is identified as segment node 2. Traverse according to the above rules until the last point is queried.

[0139] Step 602: Generate a movement path of the maintenance personnel based on the first segment node and the second segment node, where the movement path includes an en route path and an action path.

[0140] In an embodiment of the present disclosure, the present disclosure can generate a motion path of a maintenance worker based on these segmentation nodes, and the motion path is further subdivided into a path on the way and an action path. The segmentation nodes obtained by step 601 each form a different path set between each node, named: path on the way 1, action path 1, path on the way 2, action path 2, and so on.

[0141] Step 603: Determine the motion path state corresponding to the motion path based on the identification result in the motion path.

[0142] In an embodiment of the present disclosure, a state judgment is performed on the action path in the motion path. According to the identification result of the action path in the motion path, the state of the path set can be identified. Specifically, it can be determined according to the motion path state determination table shown in Table 1. This state judgment mechanism helps to more accurately understand the work progress and effect of the maintenance personnel, and provide strong support for subsequent fault handling and management.

[0143] The path contains the collection Action Path Status Contains only troubleshooting Repair failed Only contains failure recovery Natural recovery Only temporary repairs are included Temporary repair It also includes fault handling and fault recovery Repair Success It also includes temporary repairs and troubleshooting Temporary repair failed It also includes temporary repair and fault recovery Temporary repair success It also includes temporary repair, fault handling, and fault recovery. Temporary repair success

[0144] Table 1: Motion path state determination table

[0145] In summary, through the method provided by the present disclosure, the location information of the marking time can be accurately divided into the first segment node (marked) and the second segment node (unmarked), and then a complete motion path including the path on the way and the action path can be constructed. At the same time, based on the marking results in the motion path, the method can also accurately judge and determine the state corresponding to the motion path, providing strong support for the efficiency evaluation of operation and maintenance work and the optimization of fault handling.

[0146] As a possible implementation, Fig.10The flowchart of another method for planning a repair path is shown in the figure. Based on the above embodiment, the specific process of displaying the movement path and the movement path state on the map includes the following steps:

[0147] Step 701, mark points on the map according to the location information of the motion path, and connect them in chronological order.

[0148] Step 702: presenting the connected line segments on the map in layers according to the motion paths and motion path states.

[0149] In the embodiments of the present disclosure, Fig.11 As shown, the present disclosure provides a schematic diagram of a specific map display, and the present disclosure adopts an efficient and intuitive method to process the movement paths of operation and maintenance personnel. First, points are accurately marked on the map according to the location information (longitude and latitude information) of each path set, and then these points are connected in chronological order to form line segments. In order to more clearly display the movement path and its status, the present disclosure can present the line segments in a detailed layer: the line segments of the path on the way are rendered in line type according to odd and even numbers, which makes it easy to distinguish different path segments; and the line segments of the action path are rendered in color according to their movement path status, so as to intuitively reflect the activity status of the operation and maintenance personnel. In addition, the present disclosure also combines the longitude and latitude information of the standard site, and performs color rendering on areas where there may be overlap, so as to ensure the accuracy and readability of the map information.

[0150] In summary, the method provided by the present disclosure not only improves the efficiency of operation and maintenance management, but also provides strong data support for decision-making.

[0151] Fig.12 FIG. 1 is a schematic diagram of a repair path planning device 1200 provided in an embodiment of the present disclosure. Fig.12 As shown, the emergency repair path planning device includes:

[0152] The emergency repair sequence determination unit 1210 is used to respond to the equipment alarm event of the fault site, use the local upward priority search algorithm, and combine the topological relationship information of the network transmission in the site to determine the site emergency repair sequence of the fault site;

[0153] The task site determination unit 1220 is used to perform triangulation distance path planning on the fault site based on the site repair sequence of the fault site and the location information of the maintenance personnel, obtain the task site of the maintenance personnel, and recommend the task site to the maintenance personnel;

[0154] The identification unit 1230 is used to identify the maintenance personnel's marking time set according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site if the distance between the maintenance personnel and the task site is within the preset overlapping distance, and obtain an identification result;

[0155] The segmentation processing unit 1240 is used to traverse the marking time set, and based on the identification result, segment the marking time in the marking time set to obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and display it on the map based on the movement path and the movement path status.

[0156] In some embodiments of the present disclosure, the device 1200 also includes: a deduplication unit, which is used to determine the site repair order of the faulty site by utilizing a local upward first search algorithm and combining the topological relationship information of the network transmission in the site. Before that, the initial topological relationship information of the network transmission in the site is obtained; in the initial topological relationship information, bidirectional deduplication processing is performed on the link formed between any two sites to obtain deduplicated topological relationship information, wherein each link in the deduplicated topological relationship information is unique.

[0157] In some embodiments of the present disclosure, the repair order determination unit 1210 is used to: classify the faulty sites in the topological relationship information based on preset site categories to obtain the category of each faulty site in the topological relationship information, the preset site categories including the access layer, the aggregation layer and the core layer; form hybrid topological information using the topological structure of the transmission equipment in each faulty site in the topological relationship information and the category of each faulty site; filter out a set of faulty sites belonging to each preset site category in the hybrid topological information using the category of each faulty site; and perform a local upward priority search on the set of faulty sites of each preset site category according to the search rules to determine the site repair order of the faulty sites.

[0158] In some embodiments of the present disclosure, the task site determination unit 1220 is used to: classify the fault site set of each preset site category according to the geographical area to obtain a subset of fault sites in the fault point set of each preset site category, where the geographical area is determined based on the location information of the fault site; for each fault site set of each preset site category, according to the geographical area corresponding to the location information of the maintenance personnel and in accordance with the site repair order of the fault site, perform triangular distance path planning on the subset of fault sites in the fault point set of each preset site category to obtain the task site of the maintenance personnel, and recommend the task site to the maintenance personnel.

[0159] In some embodiments of the present disclosure, the task site determination unit 1220 is used to: determine the first fault site and the second fault site closest to the first maintenance personnel according to the site repair order, with the location information of the first maintenance personnel as the center; call the navigation public service interface to respectively determine the first arrival time of the first maintenance personnel arriving at the first fault site and the second arrival time of the first maintenance personnel arriving at the second fault site; compare the first arrival time and the second arrival time, and use the first fault site or the second fault site with the shortest arrival time between the first arrival time and the second arrival time as the first task site, and recommend the first task site to the first maintenance personnel.

[0160] In some embodiments of the present disclosure, the identification unit 1230 is used to: determine the distance between the maintenance personnel and the task site; if the distance is less than or equal to a preset overlapping distance, determine that the maintenance personnel overlaps with the task site; determine the occurrence time and clearing time of the fault site with the same site name as the overlapping task site; based on the maintenance personnel's marking time set, occurrence time and clearing time, identify the marking time in the marking time set to obtain an identification result.

[0161] In some embodiments of the present disclosure, the identification unit 1230 is used to: if the first marking time in the marking time set is between the occurrence time and the clearing time, then the first marking time is identified as a fault handling action; if the first marking time is after the clearing time, then the first marking time is identified as a fault recovery action; if the first marking time is before the occurrence time, then the first marking time is identified as a temporary emergency repair action.

[0162] In some embodiments of the present disclosure, the segmentation processing unit 1240 is used to: traverse all the marking times in the maintenance personnel's marking time set, identify the position information of the first marking time after identification processing as the first segmentation node, and identify the position information of the second marking time that has not been identified as the second segmentation node; based on the first segmentation node and the second segmentation node, generate a motion path of the maintenance personnel, the motion path includes an en route path and an action path; based on the identification result in the motion path, determine the motion path state corresponding to the motion path.

[0163] In some embodiments of the present disclosure, the segmentation processing unit 1240 is used to: mark points on the map according to the location information of the motion path and connect them in chronological order; and present the connected line segments on the map in layers according to the motion path and the motion path status.

[0164] Corresponding to the methods provided in the above-mentioned embodiments, the present disclosure also provides a repair path planning device. Since the device provided in the embodiment of the present disclosure corresponds to the methods provided in the above-mentioned embodiments, the implementation method of the method is also applicable to the device provided in this embodiment and will not be described in detail in this embodiment.

[0165] In the embodiments provided in the present application, the methods and devices provided in the embodiments of the present application are introduced. In order to implement the functions in the methods provided in the embodiments of the present application, the electronic device may include a hardware structure and a software module, and implement the functions in the form of a hardware structure, a software module, or a hardware structure plus a software module. A function of the functions may be executed in the form of a hardware structure, a software module, or a hardware structure plus a software module.

[0166] Fig.13 1 is a block diagram of an electronic device 1300 for implementing the above-mentioned emergency repair path planning method according to an exemplary embodiment. For example, the electronic device 1300 may be a mobile phone, a computer, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, etc.

[0167] Reference Fig.13 The electronic device 1300 may include a communication interface 1301, which can interact with other devices; a processor 1302, which is connected to the communication interface 1301 to interact with other devices and is used to execute the method provided by one or more of the above technical solutions when running a computer program; and a memory 1303, on which the computer program is stored. Specifically, the specific processing process of the processor 1302 can refer to the emergency repair path planning method described in the above embodiment of the present disclosure.

[0168] Of course, in actual application, the various components in the electronic device 1300 are coupled together through the bus system 1304. It can be understood that the bus system 1304 is used to realize the connection and communication between these components. In addition to the data bus, the bus system 1304 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, Fig.13 Various buses are labeled as bus system 1304.

[0169] The memory 1303 in the embodiment of the present application is used to store various types of data to support the operation of the electronic device 1300. Examples of such data include: any computer program used to operate on the electronic device 1300.

[0170] The method disclosed in the above embodiment of the present application can be applied to the processor 1302, or implemented by the processor 1302. The processor 1302 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 1302. The above processor 1302 may be a general-purpose processor, a digital signal processor (DSP, Digital Signal Processor), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The processor 1302 can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. In combination with the steps of the method disclosed in the embodiment of the present application, it can be directly embodied as a hardware decoding processor to execute, or it can be executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, which is located in the memory 1303, and the processor 1302 reads the information in the memory 1303, and completes the steps of the above method in combination with its hardware.

[0171] In an exemplary embodiment, the electronic device 1300 can be implemented by one or more application specific integrated circuits (ASIC), DSP, programmable logic device (PLD), complex programmable logic device (CPLD), field programmable gate array (FPGA), general processor, controller, microcontroller (MCU), microprocessor, or other electronic components to execute the aforementioned method.

[0172] The embodiments of the present disclosure further provide a non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to enable a computer to execute the emergency repair path planning method described in the above embodiments of the present disclosure.

[0173] The embodiments of the present disclosure further provide a computer program product, including a computer program, which executes the emergency repair path planning method described in the above embodiments of the present disclosure when a processor executes the computer program.

[0174] An embodiment of the present disclosure also proposes a chip, which includes one or more interface circuits and one or more processors; the interface circuit is used to receive signals from a memory of an electronic device and send signals to the processor, the signals include computer instructions stored in the memory, and when the processor executes the computer instructions, the electronic device executes the emergency repair path planning method described in the above embodiment of the present disclosure.

[0175] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0176] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "illustrative embodiments", "examples", "specific examples" or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiments or examples are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0177] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present invention includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by those skilled in the art to which the embodiments of the present invention belong.

[0178] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processing module, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (control method), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or otherwise processing in a suitable manner if necessary, and then stored in a computer memory.

[0179] It should be understood that the various parts of the embodiments of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0180] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0181] In addition, each functional unit in each embodiment of the present invention may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium. The above-mentioned storage medium may be a read-only memory, a disk or an optical disk, etc.

[0182] Although the embodiments of the present invention have been shown and described above, it is to be understood that the above embodiments are exemplary and are not to be construed as limitations of the present invention. A person skilled in the art may make changes, modifications, substitutions and variations to the above embodiments within the scope of the present invention.

Claims

1. A repair path planning method, characterized in that: The method comprises: In response to an equipment alarm event at a faulty site, a site repair sequence of the faulty site is determined by using a local upward priority search algorithm and combining topological relationship information of network transmission in the site; Based on the site repair sequence of the fault site, combined with the location information of the fault site and the location information of the maintenance personnel, triangulation distance path planning is performed on the fault site to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel; If the distance between the maintenance personnel and the task site is within the preset overlapping distance, the marking time set of the maintenance personnel is marked according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site to obtain a marking result; The marking time set is traversed, and based on the identification result, the marking time in the marking time set is segmented to obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and based on the movement path and the movement path status, it is displayed on a map.

2. The method according to claim 1, characterized in that The method comprises: determining the site repair order of the faulty site by using the local upward priority search algorithm and combining the topological relationship information of the network transmission in the site. Obtaining initial topological relationship information of network transmission in the site; In the initial topology relationship information, a bidirectional deduplication process is performed on the links formed between any two sites to obtain deduplicated topology relationship information, wherein each link in the deduplicated topology relationship information is unique.

3. The method according to claim 1, characterized in that The method of using a local upward priority search algorithm and combining topological relationship information of network transmission in the site to determine the site repair sequence of the fault site includes: Based on preset site categories, classify the faulty sites in the topology relationship information to obtain a category of each faulty site in the topology relationship information, wherein the preset site categories include an access layer, a convergence layer, and a core layer; Using the topological structure of the transmission equipment in each fault site in the topological relationship information and the category of each fault site, hybrid topology information is formed; Using the category of each faulty site, a set of faulty sites belonging to each preset site category is screened out in the hybrid topology information; According to the search rule, a local upward priority search is performed on the fault site set of each preset site category to determine the site repair order of the fault sites.

4. The method according to claim 1, characterized in that The site repair sequence based on the fault site, combining the location information of the fault site and the location information of the maintenance personnel, performing triangular distance path planning on the fault site, obtaining the task site of the maintenance personnel, and recommending the task site to the maintenance personnel, includes: Classifying the set of faulty sites of each preset site category according to geographical areas to obtain a subset of faulty sites in the set of faulty points of each preset site category, wherein the geographical areas are determined based on location information of the faulty sites; For the set of fault sites of each preset site category, according to the geographical area corresponding to the location information of the maintenance personnel and in accordance with the site repair order of the fault sites, triangular distance path planning is performed on the subset of fault sites in the set of fault points of each preset site category to obtain the task site of the maintenance personnel, and the task site is recommended to the maintenance personnel.

5. The method according to claim 4, characterized in that The method of performing triangular distance path planning on a subset of fault sites in the set of fault points of each preset site category according to the geographical area corresponding to the location information of the maintenance personnel and the site repair order of the fault sites for the set of fault sites of each preset site category, obtaining the task site of the maintenance personnel, and recommending the task site to the maintenance personnel includes: Taking the location information of the first maintenance personnel as the center, and according to the emergency repair order of the stations, determining the first fault station and the second fault station closest to the first maintenance personnel; Calling a navigation public service interface to respectively determine a first arrival time of the first maintenance personnel arriving at the first fault site and a second arrival time of the first maintenance personnel arriving at the second fault site; The first arrival time and the second arrival time are compared, and the first fault site or the second fault site with the shortest arrival time between the first arrival time and the second arrival time is used as the first task site, and the first task site is recommended to the first maintenance personnel.

6. The method according to claim 1, characterized in that If the distance between the maintenance personnel and the task site is within the preset overlapping distance, the marking time set of the maintenance personnel is marked according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site, and the marking result is obtained, including: determining a distance between the maintenance personnel and the task site; If the distance is less than or equal to a preset overlapping distance, it is determined that the maintenance personnel overlaps with the task site; Determine the occurrence time and clearing time of a fault site having the same site name as an overlapping mission site; Based on the marking time set of the maintenance personnel, the occurrence time and the clearing time, marking processing is performed on the marking time in the marking time set to obtain a marking result.

7. The method according to claim 6, characterized in that The marking time set based on the maintenance personnel, the occurrence time and the clearing time is marked on the marking time in the marking time set to obtain a marking result, including: If a first marking time in the marking time set is between the occurrence time and the clearing time, marking the first marking time as a fault handling action; If the first dotting time is after the clearing time, marking the first dotting time as a fault recovery action; If the first marking time is before the occurrence time, the first marking time is marked as a temporary emergency repair action.

8. The method according to claim 1, characterized in that The traversing the marking time set and segmenting the marking time in the marking time set based on the identification result to obtain the movement path of the maintenance personnel and the movement path state corresponding to the movement path includes: Traversing all the marking times in the marking time set of the maintenance personnel, marking the position information of the first marking time after the marking process as the first segmentation node, and marking the position information of the second marking time without the marking process as the second segmentation node; Based on the first segmentation node and the second segmentation node, a motion path of the maintenance personnel is generated, wherein the motion path includes an en route path and an action path; Based on the identification result in the motion path, a motion path state corresponding to the motion path is determined.

9. The method according to claim 1, characterized in that: The displaying on a map based on the motion path and the motion path state includes: Marking points on the map according to the location information of the movement path and connecting them in chronological order; The connected line segments on the map are presented in layers according to the motion path and the motion path status.

10. A repair path planning device, characterized in that: The device comprises: A repair sequence determination unit is used to respond to an equipment alarm event of a faulty site, use a local upward priority search algorithm, and combine topological relationship information of network transmission in the site to determine the site repair sequence of the faulty site; A task site determination unit is used to perform triangular distance path planning on the fault site based on the site emergency repair sequence of the fault site and in combination with the location information of the fault site and the location information of the maintenance personnel, obtain the task site of the maintenance personnel, and recommend the task site to the maintenance personnel; an identification unit, configured to, if the distance between the maintenance personnel and the task site is within a preset overlapping distance, identify the set of marking times of the maintenance personnel according to the occurrence time and clearing time of the fault site with the same name as the overlapping task site, and obtain an identification result; A segmentation processing unit is used to traverse the marking time set, and based on the identification result, segment the marking time in the marking time set to obtain the movement path of the maintenance personnel and the movement path status corresponding to the movement path, and display it on a map based on the movement path and the movement path status.

11. An electronic device, characterized in that: include: a processor and a memory for storing a computer program capable of being executed on the processor, Wherein, when the processor is used to run the computer program, it executes the method described in any one of claims 1-9.

12. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-9.

13. A computer program product, characterized in that The invention comprises a computer program which, when executed by a processor, implements the method according to any one of claims 1 to 9.

Images