Inspection path planning method and device, electronic equipment and storage medium

Abstract

The invention provides an inspection path planning method and device, electronic equipment and a storage medium. The method comprises the following steps: acquiring a to-be-inspected cabinet set; according to the to-be-inspected cabinet set, a hierarchy graph corresponding to each hierarchy is updated, the hierarchy graphs comprise a first hierarchy graph, a second hierarchy graph and a third hierarchy graph, and the hierarchy graphs are constructed based on a digital machine room map; according to the hierarchy graph corresponding to each hierarchy, determining a multi-hierarchy shortest path corresponding to the to-be-inspected cabinet set, the multi-hierarchy shortest path including a machine room shortest path, a cabinet group shortest path and a cabinet shortest path; and determining the shortest path of the to-be-inspected cabinet based on the multi-level shortest path. The method comprises the following steps: respectively updating a hierarchy graph corresponding to each hierarchy through a to-be-inspected cabinet set needing to be inspected at the current time; and calculating a multi-level shortest path corresponding to the to-be-inspected cabinet set so as to determine the shortest path of the to-be-inspected cabinet, so that the inspection labor cost is reduced, and the machine room inspection efficiency is improved.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to an inspection path planning method, device, electronic equipment and storage medium. Background Art

[0002] With the rapid development of information technology, enterprises and organizations have set up core facilities such as data centers and computer rooms to manage servers or information systems. Their normal operation is crucial to ensuring business stability.

[0003] In order to ensure the normal operation of computer room equipment and timely discover potential problems, computer room inspection has become a vital task. In computer room inspection, inspection plan design and inspection path planning have important research significance for improving computer room management effectiveness, inspection efficiency and reducing labor costs.

[0004] At present, computer room inspection plans and path planning mainly rely on manual design and labeling. Since manually designed paths lack analysis and feedback of a large amount of inspection data, and in large-scale and complex computer room environments, manually designed paths may become cumbersome and difficult to manage, resulting in low efficiency of computer room inspections. Summary of the invention

[0005] In view of this, an embodiment of the present invention provides an inspection path planning method, device, electronic device and storage medium to solve the problem of low efficiency of computer room inspection existing in the prior art.

[0006] To achieve the above objectives, the embodiments of the present invention provide the following technical solutions:

[0007] A first aspect of an embodiment of the present invention shows a method for patrol path planning, the method comprising:

[0008] Get the cabinet collection to be inspected;

[0009] According to the set of cabinets to be inspected, a hierarchical diagram corresponding to each level is updated, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram and a third hierarchical diagram, and the hierarchical diagram is constructed based on a digital computer room map;

[0010] Determine the multi-level shortest path corresponding to the set of cabinets to be inspected according to the hierarchical graph corresponding to each level, wherein the multi-level shortest path includes the shortest path of the computer room, the shortest path of the cabinet group and the shortest path of the cabinet;

[0011] The shortest path of the cabinet to be inspected is determined based on the multi-level shortest paths.

[0012] Optionally, before obtaining the cabinet set to be inspected, the following is also included:

[0013] Building a digital computer room map based on computer room environment data collected by users, the digital computer room map can present the operating status of the cabinet equipment in the computer room;

[0014] Classify the cabinets according to the digital computer room map to obtain multiple cabinet levels;

[0015] A hierarchical diagram corresponding to each level is constructed based on the multiple levels of the cabinets and the digital computer room map, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram and a third hierarchical diagram.

[0016] Optionally, obtain the cabinet set to be inspected, including:

[0017] If it is determined that alarm data appears in each cabinet within the current time period, the alarm data is written into the cabinet set to be inspected;

[0018] Using a pre-built cabinet failure prediction model, determine the cabinet that may fail at the current time, wherein the cabinet failure prediction model is trained based on the collected historical cabinet data;

[0019] The cabinet that may currently have a fault is added to the set of cabinets to be inspected, so as to obtain the set of cabinets to be inspected.

[0020] Optionally, updating the hierarchical diagram corresponding to each level according to the set of cabinets to be inspected includes:

[0021] Update the first level map according to the computer room where each cabinet to be inspected is located in the cabinet to be inspected set;

[0022] Update the second hierarchical diagram according to the cabinet group where each cabinet to be inspected in the cabinet set to be inspected is located;

[0023] The third level diagram is updated according to each cabinet to be inspected in the set of cabinets to be inspected.

[0024] Optionally, determining the multi-level shortest path corresponding to the set of cabinets to be inspected according to the level graph corresponding to each level includes:

[0025] Determine the shortest path in the computer room corresponding to each cabinet to be inspected according to the first hierarchical diagram;

[0026] Determine the shortest path of the cabinet group corresponding to each cabinet to be inspected according to the second hierarchical graph;

[0027] The cabinet shortest path corresponding to each cabinet to be inspected is determined according to the third hierarchical diagram and the cabinet group shortest path.

[0028] Optionally, determining the cabinet shortest path corresponding to each cabinet to be inspected according to the third hierarchical graph and the cabinet group shortest path includes:

[0029] For each cabinet to be inspected, determine the path starting point and path end point of the third hierarchical graph based on the shortest path of the cabinet group and the cabinet group where the cabinet to be inspected is located;

[0030] Merging the path start point and the path end point into the third-level graph to obtain a new third-level graph;

[0031] The shortest cabinet path corresponding to each cabinet to be inspected is determined according to the new third-level graph.

[0032] Optionally, determining the shortest path of the cabinet to be inspected based on the multi-level shortest path includes:

[0033] Determine a first shortest path according to the shortest path in the computer room and the shortest path in the cabinet group;

[0034] Determine a second shortest path according to the cabinet group shortest path and the cabinet shortest path;

[0035] Based on the first shortest path and the second shortest path, the shortest path of the cabinet to be inspected is determined.

[0036] A second aspect of an embodiment of the present invention shows a patrol route planning device, the device comprising:

[0037] An acquisition unit, used to acquire a set of cabinets to be inspected;

[0038] A processing unit, configured to update a hierarchical diagram corresponding to each level according to the set of cabinets to be inspected, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram, and a third hierarchical diagram, and the hierarchical diagram is constructed based on a digital computer room map;

[0039] A determination unit is used to determine the multi-level shortest path corresponding to the set of cabinets to be inspected according to the hierarchical diagram corresponding to each level, wherein the multi-level shortest path includes the shortest path of the computer room, the shortest path of the cabinet group and the shortest path of the cabinet; and determine the shortest path of the cabinets to be inspected based on the multi-level shortest path.

[0040] The third aspect of an embodiment of the present invention shows an electronic device, comprising: a processor and a memory, wherein the processor and the memory are connected via a communication bus; wherein the processor is used to call and execute a program stored in the memory; and the memory is used to store a program, wherein the program is used to implement the inspection path planning method as shown in the first aspect of the embodiment of the present invention.

[0041] A fourth aspect of an embodiment of the present invention shows a storage medium, including the electronic device shown in the third aspect, and the electronic device is used to execute the inspection path planning method shown in the first aspect of the embodiment of the present invention.

[0042] Based on the above-mentioned embodiment of the present invention, a patrol path planning method, device, electronic device and storage medium are provided, the method includes: obtaining a set of cabinets to be patrolled; updating the hierarchical graph corresponding to each level according to the set of cabinets to be patrolled, the hierarchical graph includes a first hierarchical graph, a second hierarchical graph and a third hierarchical graph, and the hierarchical graph is constructed based on a digital computer room map; determining the multi-level shortest path corresponding to the set of cabinets to be patrolled according to the hierarchical graph corresponding to each level, wherein the multi-level shortest path includes the shortest path of the computer room, the shortest path of the cabinet group and the shortest path of the cabinet; determining the shortest path of the cabinet to be patrolled based on the multi-level shortest path. In the embodiment of the present invention, the hierarchical graph corresponding to each level constructed based on the digital computer room map is updated respectively by the set of cabinets to be patrolled that need to be patrolled at the current time; then, the multi-level shortest path corresponding to the set of cabinets to be patrolled is calculated, and then the shortest path of the cabinet to be patrolled is determined, that is, the global optimal patrol path is obtained to reduce the patrol manpower cost and improve the efficiency of computer room patrol. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0044] Figure 1 A schematic diagram of a process flow of an inspection path planning method shown in an embodiment of the present invention;

[0045] Figure 2 A multi-level schematic diagram of a cabinet according to an embodiment of the present invention;

[0046] Figure 3 A schematic diagram of a global optimal inspection path shown in an embodiment of the present invention;

[0047] Figure 4 The present invention is a schematic diagram of an inspection route planning device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0048] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0049] The terms "first", "second", "third", "fourth", etc. (if any) in the specification and claims of the present application 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 interchangeable where appropriate, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0050] It should be noted that the descriptions of "first", "second", etc. in the present invention are only for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" or "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but it must be based on the current skills. It should be considered that such a combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0051] In the present application, the terms "comprises", "includes" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or apparatus that includes a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements limited by such a sentence "includes one...", and does not exclude the presence of other identical elements in the process, method, article or apparatus that includes the elements.

[0052] See also Figure 1 , is a flow chart of a method for inspection path planning shown in an embodiment of the present invention, the method comprising:

[0053] Step S101: constructing a digital computer room map based on computer room environment data collected by a user, wherein the digital computer room map can present the operating status of the cabinet equipment in the computer room;

[0054] In the process of implementing step S101, a computer-aided design CAD drawing of the computer room scene is generated based on the computer room environment data input by the user; a computer room scene model library is constructed based on the CAD drawing through diversified modeling methods such as geographic information technology GIS, simultaneous positioning and map construction SLAM data, etc.; Three.js and WEBGL technology are used to build a one-to-one replica of a digital twin computer room scene corresponding to the computer room scene model library, and third-party data is accessed to construct a two-dimensional chart, and the data is used to accurately display the overall operation of the computer room, thereby obtaining a digital computer room map that can present the operating status of cabinet equipment in real time.

[0055] The computer room environment data includes the location of the computer room, the location information of each cabinet device collected by the user, the layout of the cabinet equipment, etc.

[0056] Among them, Simultaneous Localization and Mapping (SLAM) is a technology that aims to build an environmental map in real time through sensor data and determine the position of the robot in the environment.

[0057] Three.js is a lightweight, cross-browser JavaScript library / API for creating and displaying animated 3D computer graphics on web browsers.

[0058] WebGL is a JavaScript API for rendering interactive 3D graphics on web pages without the need for any plugins.

[0059] It should be noted that the digital computer room map includes full digital twin scenario computer room maps of multiple computer rooms.

[0060] Step S102: Classify cabinets according to the digital computer room map to obtain multiple cabinet levels;

[0061] It should be noted that the cabinet multi-level includes the first level, i.e., the computer room, the second level, i.e., the cabinet group, and the third level, i.e., the single cabinet, e.g. Figure 2 shown.

[0062] The smallest component unit at the first level is the computer room, and all the cabinets in each computer room are considered as a whole.

[0063] The smallest unit of the second level is the cabinet group. The distance between cabinet groups must be greater than the longest distance between cabinets in the cabinet group.

[0064] The smallest component unit at the third level is the cabinet, which is also the smallest unit to be inspected.

[0065] In the process of specifically implementing step S102, the digital computer room map is traversed to determine the number of computer rooms in the digital computer room map, and the number is used as the first level; then, for each computer room, the distance between every two cabinets is calculated; for each cabinet, the cabinets whose distance between cabinets is less than the preset distance are written into a cabinet group to divide all cabinets, obtain multiple cabinet groups, and use them as the first level; then; for the cabinets in each cabinet group, each mechanism is set to the third level.

[0066] It should be noted that since the distance between cabinet groups is greater than the farthest distance between cabinets in a cabinet group, the cabinet groups are divided according to the distance between the mechanisms. The preset distance is set based on multiple experiments or experience, and this embodiment of the present invention does not limit this.

[0067] Among them, the cabinet information carried by the multi-level cabinet includes the number of each level, such as the number of computer rooms at the first level, the number of cabinet groups at the second level, and the number of cabinets. The first level of Ju Ri also includes the number of cabinet groups in each computer room and the number of cabinets.

[0068] Step S103: constructing a level map corresponding to each level based on the cabinet multi-levels and the digital computer room map.

[0069] It should be noted that the hierarchical diagram includes a first-level diagram, a second-level diagram and a third-level diagram.

[0070] Step S11: constructing a corresponding first level map based on the cabinet multi-level and digital computer room map.

[0071] In the specific implementation process of step S11, the number of computer rooms in the first level is determined, and the entrance position and floor entrance of each computer room in the digital computer room map are traversed; then, the entrance position and floor entrance of the computer room are used as vertices, and a preset search algorithm is used to calculate the shortest distance between each computer room entrance and floor entrance in the digital computer room map, and the shortest distance is used as the weight of the edge connecting each vertex to obtain a computer room level graph, and the first level graph is g = (V, E, A).

[0072] Where V = {c1, c2, ..., c N} is the set of each room entrance and floor entrance, c1 is the vertex related to the floor entrance, c n ,n=2,3,...,N is the vertex related to the nth computer room, E is the set of edges consisting of the lines connecting the entrances of each computer room and the floor entrances, and A is the adjacency matrix composed of the shortest distances.

[0073] It should be noted that the preset search algorithm is an algorithm pre-set by a technician for use in path planning and graph search to find the optimal path from the starting point to the end point. The algorithm may be an A-star search algorithm.

[0074] Step S12: construct a corresponding second hierarchical map based on the cabinet multi-levels and the digital computer room map.

[0075] In the specific implementation of step S12, for each computer room N, the number of cabinet groups N in each computer room is determined from the cabinet information carried by the cabinets at multiple levels. n -1; traverse the geometric center position of each cabinet group under the computer room in the digital computer room map, and the entrance of the computer room; then use the geometric center of each cabinet group and the entrance of the computer room as vertices, use the preset search algorithm to calculate the shortest distance between the geometric center of each cabinet group and the entrance of the computer room in the digital computer room map, and use the shortest distance as the weight of the edge connecting each vertex to obtain the cabinet group diagram, that is, the second level diagram is in It is the collection of geometric centers of each cabinet group and the entrance of the computer room;

[0076] Among them, c n,i Refers to the vertex related to the nth computer room entrance and the ith cabinet group; n=2,3,…,N, i=2,3,…,N n , E n A is the set of edges formed by the connection between the geometric center of each cabinet group and the entrance of the computer room. n is an adjacency matrix consisting of the shortest distances.

[0077] Step S13: constructing a corresponding third level map based on the cabinet multi-level and digital computer room map.

[0078] In the specific implementation of step S13, for each cabinet N ni , determine the room n where the cabinet is located, and the cabinet group i where it is located; traverse the position of each cabinet in the digital room map; then use each cabinet as a vertex, use a preset search algorithm to calculate the shortest distance between each cabinet, and use the shortest distance as the weight of the edge connecting each vertex to obtain the cabinet graph, that is, the third-level graph is

[0079] in, is a collection of cabinets, c n,i,j is the vertex associated with the jth cabinet in the i-th cabinet group in the n-th computer room, n = 2, 3, ..., N, i = 2, 3, ..., N n ,j=1,2,…,N ni , E n,i is the set of edges formed by the connections between cabinets. n,i is an adjacency matrix consisting of the shortest distances.

[0080] Step S104: Obtain a set of cabinets to be inspected.

[0081] It should be noted that the set of cabinets to be inspected includes cabinets to be inspected, that is, cabinets that have alarms or may fail.

[0082] It should be noted that the specific process of implementing step S104 includes the following steps:

[0083] Step S21: determine whether each cabinet has alarm data in the current time period. If so, execute step S23. If not, determine that there is no cabinet with alarm data.

[0084] The alarm types in the alarm data include CPU alarms, security alarms, switch alarms, network alarms, etc. of the cabinet.

[0085] In the process of implementing step S21, the alarm of each cabinet in each computer room in the current time period is monitored. If any one or more cabinets detect an alarm in the current time period, step S23 is executed. If not, it is determined that there is no cabinet with alarm data.

[0086] It should be noted that the alarm data includes the location, identification, alarm sending time, and alarm type of the cabinet where the alarm occurs in the current time period.

[0087] The current time period refers to a period of time before and after the user triggers the predicted cabinet set.

[0088] The period of time is set by the technicians according to the experiment, which can generally be 30 minutes before and after;

[0089] For example, the time when the user triggers the prediction of the cabinet set is 2:00:00, and the period before and after is taken as the current time period, that is, the current time period is [1:30:00-2:30:00].

[0090] Step S22: using the pre-built cabinet failure prediction model, determine the cabinet that may fail at the current time.

[0091] In the specific implementation of step S22, the pre-built cabinet failure prediction model is used to process the historical alarm information of each cabinet, and the cabinet that may fail at the current time is output.

[0092] The historical fault information refers to the time from before the current time to after the cabinet begins to be used.

[0093] It should be noted that the cabinet failure prediction model is trained based on cabinet data with high alarm frequency collected in the past.

[0094] Specifically, the process of obtaining the cabinet failure prediction model through training based on the collected historical cabinet data includes:

[0095] The cabinet data with high alarm frequency collected in the past is used as a training set and sent to the long short-term memory artificial neural network for training to obtain a trained initial model. If the initial model processes the historical alarm information of each cabinet, determines the cabinet that may have a fault, and compares it with the cabinet that actually has a fault, if they are consistent, the initial model is used as the cabinet fault prediction model.

[0096] Among them, historical cabinet data refers to cabinet data with high alarm frequency collected in the past.

[0097] Step S23: write the cabinets where alarm data appears and the cabinets that may have a fault this time into the cabinet set to be inspected.

[0098] In the process of implementing step S23, each cabinet in which alarm data appears, each cabinet that may have a fault at the current time, the location and code of each cabinet, the location and number of the cabinet group in which each cabinet is located, and the location and number of the computer room in which each cabinet is located are put into the set of cabinets to be inspected.

[0099] It should be noted that each cabinet written into the cabinet set to be inspected can be called a cabinet to be inspected.

[0100] Step S105: updating the hierarchical diagram corresponding to each level according to the set of cabinets to be inspected.

[0101] The specific implementation process of step S105 includes the following steps:

[0102] Step S31: updating the first level diagram according to the computer room where each cabinet to be inspected in the cabinet set is located.

[0103] In the process of implementing step S31, according to the set of cabinets to be inspected, the computer rooms (vertices) and corresponding edges that do not contain the cabinets to be inspected in the first hierarchical graph are deleted. That is to say, only the computer room number (i.e., vertex) and corresponding edges of each cabinet to be inspected are retained to obtain a new computer room hierarchical graph, i.e., the updated first hierarchical graph.

[0104] It should be noted that the updated first-level graph is where V′={c′1,c′2,...,c′ N′} is the set of each room entrance and floor entrance, c′1 is the vertex related to the floor entrance, c′n are the vertices related to the nth room to be inspected, n = 2, 3, ..., N', N' is the number of rooms to be inspected, E' and A' represent the set and adjacency matrix of the room-level graph after pruning, respectively;

[0105] Step S32: updating the second hierarchical diagram according to the cabinet group to which each cabinet to be inspected in the cabinet set to be inspected is located.

[0106] In the process of specifically implementing step S32, according to the set of cabinets to be inspected, the cabinet groups (vertices) and corresponding edges that do not contain the cabinets to be inspected in the cabinet group level diagram are deleted. That is to say, only the cabinet group number (i.e., vertex) and corresponding edges of each cabinet to be inspected are retained to obtain a new cabinet group level diagram, i.e., the updated second level diagram.

[0107] It should be noted that the updated second-level diagram is in is the vertex of the cabinet group graph after pruning, c′ n,i It is the vertex related to the i-th cabinet group to be inspected at the n-th computer room entrance, n=2,3,…,N′,i=2,3,…,N′ n , N′ n is the number of cabinet groups to be inspected, E′ n and A′ n They represent the set and adjacency matrix of the cabinet group-level graph edges after pruning respectively;

[0108] Step S33: updating the third level diagram according to each cabinet to be inspected in the cabinet set to be inspected.

[0109] In the process of implementing step S33, according to the set of cabinets to be inspected, the cabinets (vertices) and corresponding edges that do not contain the cabinets to be inspected in the cabinet level graph are deleted. That is to say, only the number of each cabinet to be inspected (i.e., vertex) and the corresponding edge are retained to obtain a new cabinet level graph, i.e., the updated third level graph.

[0110] It should be noted that the updated third-level diagram is in, is the vertex of the cabinet-level graph after pruning, c n ' ,i,j The vertices related to the jth cabinet to be inspected under the i-th cabinet group to be inspected at the entrance of the n-th computer room, n=2,3,…,N′,i=2,3,…,N n ′,j=1,2,...,N n ' i , N n ' i is the number of cabinets to be inspected, E n ' ,i and An ' ,i They represent the set and adjacency matrix of the cabinet-level graph edges after pruning, respectively.

[0111] Step S106: determining the multi-level shortest paths corresponding to the set of cabinets to be inspected according to the level graph corresponding to each level.

[0112] The multi-level shortest path includes the equipment room shortest path, the cabinet group shortest path, and the cabinet shortest path.

[0113] Step S41: determining the shortest path in the computer room corresponding to each cabinet to be inspected according to the first hierarchical diagram;

[0114] In the specific implementation process of step S41, each vertex in the first hierarchical graph is dynamically planned, that is, it is input into formula (1) for processing to obtain the shortest path in the computer room corresponding to each cabinet to be inspected.

[0115] Formula (1):

[0116]

[0117] Among them, S′ represents the set of vertices in the first-level graph, dist(p,S′) represents the shortest distance from vertex c1 through all vertices in S′ to vertex cp, and d(c p ,c q ) represents the distance from vertex cp to cq, represents the empty set, p refers to the vertex where the path starts, and q refers to the final vertex of the path.

[0118] Specifically, if the vertex c from which the path starts p is vertex c′1, the final vertex c of the path q As vertex c′1, starting from vertex c′1 in the first-level graph, according to the state equation, that is, formula (1), the shortest path at the computer room level can be obtained as in, Indicates the vertices of the computer rooms passed in sequence.

[0119] Step S42: determining the shortest path of the cabinet group corresponding to each cabinet to be inspected according to the second hierarchical graph;

[0120] In the specific implementation of step S42, each vertex in the second hierarchical graph and the shortest path in the computer room is dynamically planned, that is, it is input into formula (1) for processing to obtain the shortest path of the cabinet group corresponding to each cabinet to be inspected.

[0121] In this case, S′ in formula (1) represents the set of vertices in the second-level graph, and dist(p,S′) represents the distance from vertex c′ to the n,1Start from S' and pass through all vertices to reach vertex c p The shortest distance, d(c p ,c q ) represents vertex c p to c q The distance Represents the empty set.

[0122] Specifically, determine the vertex c starting from the second-level graph path from the shortest path in the computer room p is vertex c′ n,1 , the final vertex c of the path q is vertex c′ n,1 , from the vertex c′ in the second level graph n,1 Starting from the state equation, formula (1), we can perform recursive calculation to obtain the shortest path at the cabinet group level: in Indicates the cabinet groups that are passed in sequence.

[0123] Step S43: determining the cabinet shortest path corresponding to each cabinet to be inspected according to the third hierarchical graph and the cabinet group shortest path;

[0124] The specific implementation of step S43 includes the following steps:

[0125] Step S51: for each cabinet to be inspected, determine the path starting point and path end point of the third hierarchical graph based on the shortest path of the cabinet group and the cabinet group where the cabinet to be inspected is located.

[0126] In the specific implementation of step S51, the i-th cabinet group in the shortest path of the n-th cabinet group in the computer room is inspected. For example, the path starting point and path end point of the cabinet to be inspected are determined by the shortest path in the cabinet group graph, that is, the path starting point and path end point are and

[0127] Step S52: merge the path start point and the path end point into the third-level graph to obtain a new third-level graph.

[0128] In the specific implementation of step S52, the path start point and the path end point are incorporated into the graph. Get a new picture and place the vertex and The weight of the edge is set to zero.

[0129] Step S53: determining the shortest cabinet path corresponding to each cabinet to be inspected according to the new third-level graph;

[0130] In the specific implementation of step S53, the state equation, that is, formula (1), is used to solve the shortest path problem of traversing all vertices back to the starting point of the path. and vertices The weights of all other edges are greater than zero. Therefore, the shortest inspection path of the cabinet must pass through the vertex and vertices By deleting the edge and breaking the circle, the shortest inspection path at the cabinet level is obtained as

[0131] Specifically, if the vertex c from which the path starts p Vertex The vertex c at the end of the path q Vertex Starting from the vertices in the new third-level graph, using the state equation, that is, formula (1), recursive calculation can be performed to obtain the shortest path of the cabinet:

[0132] Step S107: Determine the shortest path of the cabinet to be inspected based on the multi-level shortest paths.

[0133] The specific implementation process of step S107 includes the following steps:

[0134] Step S61: determining a first shortest path according to the shortest path of the computer room and the shortest path of the cabinet group.

[0135] It should be noted that the first shortest path refers to the shortest path for inspection of the equipment room-cabinet group.

[0136] In the specific implementation of step S61, the path starting point and path end point of the first shortest path are determined according to the shortest path in the computer room, that is, c n,1 and c n , n=2,3,...,N′ all represent the entrance of the nth computer room; then, the path starting point and path end point of the first shortest path are used as the path starting point and path end point of the cabinet group shortest path, so as to combine the vertices in the computer room shortest path and the cabinet group shortest path, so as to traverse the vertices in the computer room shortest path and the cabinet group shortest path to obtain the first shortest path.

[0137] Therefore, the shortest path from the equipment room level to the cabinet group level can be obtained as:

[0138]

[0139] in,

[0140] Step S62: determining a second shortest path according to the cabinet group shortest path and the cabinet shortest path.

[0141] It should be noted that the second shortest path refers to the shortest path of cabinet group-cabinet inspection.

[0142] In the process of specifically implementing step S62, the path starting point and path end point of the shortest path of the cabinet group are used as the path starting point and path end point of the second shortest path, so as to combine the vertices in the shortest path of the cabinet group and the shortest path of the cabinet, so as to traverse the vertices in the shortest path of the cabinet group and the shortest path of the cabinet to obtain the first shortest path.

[0143] Specifically, according to the shortest path of the cabinet, we can know that the shortest path for inspecting the cabinet in the i-th cabinet group in the n-th computer room is Therefore, the shortest inspection path of all cabinets in the nth computer room can be expressed as:

[0144]

[0145] Where n=2,3,...,N′.

[0146] Step S63: Determine the shortest path of the cabinet to be inspected based on the first shortest path and the second shortest path.

[0147] In the specific implementation of step S63, the second shortest path is substituted into the first shortest path to generate the shortest path of the cabinets to be inspected that traverses all vertices in the first shortest path and the second shortest path.

[0148] For example, the inspection path of the nth computer room in the second shortest path is substituted into the first shortest path to obtain the shortest path of computer room-cabinet group-cabinet inspection.

[0149] In order to better understand the method shown in the above invention, Figure 3 The optimal inspection route obtained by the multi-level method shown is Figure 3 The first level consists of 3 computer rooms, the second level consists of 4 cabinet groups in each computer room, and the third level consists of 4 cabinets in each cabinet group. The black five-pointed star represents the floor entrance, the black square represents the computer room entrance, the red circle represents the cabinet, and the blue directional line represents the shortest inspection route.

[0150] By using the method shown in the above embodiment of the present invention, the shortest path and inspection time corresponding to the multi-level method can be determined, as shown in Table (1).

[0151] Table (1):

[0152]

[0153] In the embodiment of the present invention, the shortest path used by the method shown in the present application is shorter than the shortest path planned by other existing methods.

[0154] The present invention transforms the large-scale machine room inspection path planning method into a three-level shortest path planning. Assuming that the machine room × cabinet group × cabinet = N × M × P, the computational complexity is reduced from 100% to 100% compared with the direct application of the dynamic programming method. Reduced to

[0155] The present invention can be extended to apply to tasks such as workshop inspection, power inspection, agricultural inspection, etc., where the inspection objects can be divided into multiple levels.

[0156] In an embodiment of the present invention, a digital computer room map is first constructed to divide the data computer room map into multiple levels to reduce the computational complexity of the shortest path planning and obtain multiple levels of cabinets; then, a hierarchical graph corresponding to each level of the multiple levels of cabinets is drawn; the hierarchical graph corresponding to each level is updated respectively through the set of cabinets to be inspected that need to be inspected this time; then, the multi-level shortest paths corresponding to the set of cabinets to be inspected are calculated, and then the shortest path of the cabinets to be inspected is determined, that is, the global optimal inspection path is obtained to reduce the inspection manpower cost and improve the efficiency of computer room inspection.

[0157] Based on the method shown in the above embodiment of the present invention, the embodiment of the present invention also shows a schematic diagram of the architecture of an inspection path planning device, such as Figure 4 As shown, the device comprises:

[0158] An acquisition unit 401 is used to acquire a set of cabinets to be inspected;

[0159] A processing unit 402 is used to update a hierarchical diagram corresponding to each level according to the set of cabinets to be inspected, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram and a third hierarchical diagram, and the hierarchical diagram is constructed based on a digital computer room map;

[0160] Determination unit 403 is used to determine the multi-level shortest path corresponding to the set of cabinets to be inspected according to the hierarchical diagram corresponding to each level, wherein the multi-level shortest path includes the shortest path of the computer room, the shortest path of the cabinet group and the shortest path of the cabinet; and determine the shortest path of the cabinet to be inspected based on the multi-level shortest path.

[0161] The specific principles and execution processes of each unit in the inspection path planning device disclosed in the above embodiment of the present invention are the same as the corresponding contents in the inspection path planning method provided in the above embodiment of the present invention. Please refer to the corresponding parts of the inspection path planning method disclosed in the above embodiment of the present invention, and will not be repeated here.

[0162] In an embodiment of the present invention, the hierarchical graph corresponding to each level is updated respectively through the set of cabinets to be inspected that need to be inspected currently; then, the multi-level shortest paths corresponding to the set of cabinets to be inspected are calculated, and then the shortest path of the cabinets to be inspected is determined, that is, the global optimal inspection path is obtained, so as to reduce the inspection manpower cost and improve the efficiency of the computer room inspection.

[0163] Optionally, based on the inspection path planning device shown in the above embodiment of the present invention, the processing unit 402 is further used to:

[0164] Before obtaining the set of cabinets to be inspected, a digital computer room map is constructed based on the computer room environment data collected by the user, and the digital computer room map can present the operating status of the cabinet equipment in the computer room;

[0165] Classify the cabinets according to the digital computer room map to obtain multiple cabinet levels;

[0166] A hierarchical diagram corresponding to each level is constructed based on the multiple levels of the cabinets and the digital computer room map, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram and a third hierarchical diagram.

[0167] Optionally, based on the inspection path planning device shown in the above embodiment of the present invention, the acquisition unit 401 is specifically used to:

[0168] If it is determined that alarm data appears in each cabinet within the current time period, the alarm data is written into the cabinet set to be inspected;

[0169] Using a pre-built cabinet failure prediction model, determine the cabinet that may fail at the current time, wherein the cabinet failure prediction model is trained based on the collected historical cabinet data;

[0170] The cabinet that may currently have a fault is added to the set of cabinets to be inspected, so as to obtain the set of cabinets to be inspected.

[0171] Optionally, based on the inspection path planning device shown in the above embodiment of the present invention, the processing unit 402 that updates the hierarchical graph corresponding to each level according to the set of cabinets to be inspected is specifically used to:

[0172] Update the first level map according to the computer room where each cabinet to be inspected is located in the cabinet to be inspected set;

[0173] Update the second hierarchical diagram according to the cabinet group where each cabinet to be inspected in the cabinet set to be inspected is located;

[0174] The third level diagram is updated according to each cabinet to be inspected in the set of cabinets to be inspected.

[0175] Optionally, based on the inspection path planning device shown in the above embodiment of the present invention, a determination unit 403 for determining the multi-level shortest path corresponding to the set of cabinets to be inspected according to the hierarchical graph corresponding to each level is specifically used to:

[0176] Determine the shortest path in the computer room corresponding to each cabinet to be inspected according to the first hierarchical diagram;

[0177] Determine the shortest path of the cabinet group corresponding to each cabinet to be inspected according to the second hierarchical graph;

[0178] The cabinet shortest path corresponding to each cabinet to be inspected is determined according to the third hierarchical diagram and the cabinet group shortest path.

[0179] Wherein, determining the cabinet shortest path corresponding to each cabinet to be inspected according to the third hierarchical graph and the cabinet group shortest path includes:

[0180] For each cabinet to be inspected, determine the path starting point and path end point of the third hierarchical graph based on the shortest path of the cabinet group and the cabinet group where the cabinet to be inspected is located;

[0181] Merging the path start point and the path end point into the third-level graph to obtain a new third-level graph;

[0182] The shortest cabinet path corresponding to each cabinet to be inspected is determined according to the new third-level graph.

[0183] Optionally, the inspection path planning device shown in the above embodiment of the present invention determines the shortest path of the cabinet to be inspected based on the multi-level shortest path, and the determining unit 403 is specifically used to:

[0184] Determine a first shortest path according to the shortest path in the computer room and the shortest path in the cabinet group;

[0185] Determine a second shortest path according to the cabinet group shortest path and the cabinet shortest path;

[0186] Determine the shortest path of the cabinet to be inspected based on the first shortest path and the second shortest path;

[0187] An embodiment of the present application provides an electronic device, which includes a processor and a memory, wherein the memory is used to store program code and data for inspection path planning, and the processor is used to call program instructions in the memory to execute the steps shown in the inspection path planning method in the above embodiment.

[0188] An embodiment of the present invention provides a storage medium, and a vehicle includes the electronic device provided by the above-mentioned embodiment of the present application, and the electronic device is used to execute the inspection path planning method disclosed in the embodiment of the present application.

[0189] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can refer to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system or system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can refer to the partial description of the method embodiment. The system and system embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without creative work.

[0190] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0191] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A patrol route planning method, characterized in that: The method comprises: Get the cabinet collection to be inspected; According to the set of cabinets to be inspected, a hierarchical diagram corresponding to each level is updated, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram and a third hierarchical diagram, and the hierarchical diagram is constructed based on a digital computer room map; Determine the multi-level shortest path corresponding to the set of cabinets to be inspected according to the hierarchical graph corresponding to each level, wherein the multi-level shortest path includes the shortest path of the computer room, the shortest path of the cabinet group and the shortest path of the cabinet; The shortest path of the cabinet to be inspected is determined based on the multi-level shortest paths.

2. The method according to claim 1, characterized in that: Before obtaining the cabinet set to be inspected, the following steps are also required: Building a digital computer room map based on computer room environment data collected by users, the digital computer room map can present the operating status of the cabinet equipment in the computer room; Classify the cabinets according to the digital computer room map to obtain multiple cabinet levels; A hierarchical diagram corresponding to each level is constructed based on the multiple levels of the cabinets and the digital computer room map, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram and a third hierarchical diagram.

3. The method according to claim 1, characterized in that Get the cabinet collection to be inspected, including: If it is determined that alarm data appears in each cabinet within the current time period, the alarm data is written into the cabinet set to be inspected; Using a pre-built cabinet failure prediction model, determine the cabinet that may fail at the current time, wherein the cabinet failure prediction model is trained based on the collected historical cabinet data; The cabinet that may currently have a fault is added to the set of cabinets to be inspected, so as to obtain the set of cabinets to be inspected.

4. The method according to claim 1, characterized in that: The hierarchical diagram corresponding to each level is updated according to the set of cabinets to be inspected, including: Update the first level map according to the computer room where each cabinet to be inspected is located in the cabinet to be inspected set; Update the second hierarchical diagram according to the cabinet group where each cabinet to be inspected in the cabinet set to be inspected is located; The third level diagram is updated according to each cabinet to be inspected in the set of cabinets to be inspected.

5. The method according to claim 1, characterized in that: Determining the multi-level shortest path corresponding to the set of cabinets to be inspected according to the level graph corresponding to each level includes: Determine the shortest path in the computer room corresponding to each cabinet to be inspected according to the first hierarchical diagram; Determine the shortest path of the cabinet group corresponding to each cabinet to be inspected according to the second hierarchical graph; The cabinet shortest path corresponding to each cabinet to be inspected is determined according to the third hierarchical diagram and the cabinet group shortest path.

6. The method according to claim 5, characterized in that Determining the cabinet shortest path corresponding to each cabinet to be inspected according to the third hierarchical graph and the cabinet group shortest path includes: For each cabinet to be inspected, determine the path starting point and path end point of the third hierarchical graph based on the shortest path of the cabinet group and the cabinet group where the cabinet to be inspected is located; Merging the path start point and the path end point into the third-level graph to obtain a new third-level graph; The shortest cabinet path corresponding to each cabinet to be inspected is determined according to the new third-level graph.

7. The method according to claim 1, characterized in that Determining the shortest path of the cabinet to be inspected based on the multi-level shortest path includes: Determine a first shortest path according to the shortest path in the computer room and the shortest path in the cabinet group; Determine a second shortest path according to the cabinet group shortest path and the cabinet shortest path; Based on the first shortest path and the second shortest path, the shortest path of the cabinet to be inspected is determined.

8. A patrol route planning device, characterized in that: The device comprises: An acquisition unit, used to acquire a set of cabinets to be inspected; A processing unit, configured to update a hierarchical diagram corresponding to each level according to the set of cabinets to be inspected, wherein the hierarchical diagram includes a first hierarchical diagram, a second hierarchical diagram, and a third hierarchical diagram, and the hierarchical diagram is constructed based on a digital computer room map; A determination unit is used to determine the multi-level shortest path corresponding to the set of cabinets to be inspected according to the hierarchical diagram corresponding to each level, wherein the multi-level shortest path includes the shortest path of the computer room, the shortest path of the cabinet group and the shortest path of the cabinet; and determine the shortest path of the cabinets to be inspected based on the multi-level shortest path.

9. An electronic device, characterized in that: include: A processor and a memory, wherein the processor and the memory are connected via a communication bus; wherein the processor is used to call and execute a program stored in the memory; The memory is used to store a program, and the program is used to implement the inspection path planning method as described in any one of claims 1-7.

10. A storage medium, characterized in that: It includes the electronic device described in claim 9, and the electronic device is used to execute the inspection path planning method described in any one of claims 1-7.

Images