Beidou grid code-based transformer substation intelligent inspection robot path planning method
Through Beidou grid code technology, the substation is gridded and divided into sections, the relationship between inspection points and sections is established, and the shortest path is calculated, which solves the problems of low computing efficiency and slow search speed in intelligent inspection robot path planning. , achieving more efficient inspection path planning.
Patent Information
- Application Number
- CN202410871256.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-01
- Publication Date
- 2024-11-15
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing intelligent inspection robot path planning algorithm has problems of low computational efficiency and slow search speed in substation scenarios.
The path planning method based on Beidou grid code is adopted, and the substation area is gridded and divided into passable areas and sections, the relationship between the inspection points and sections is established, the shortest path is calculated and the complete inspection path is generated.
The path calculation efficiency is improved, the number of inspection points is reduced, the accuracy and efficiency of inspection paths is improved, and the situation of bending walking is avoided.
Smart Images

Figure CN118960730A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of path planning technology, and in particular to a path planning method, system, terminal and computer-readable storage medium for a substation intelligent inspection robot based on Beidou grid code. Background Art
[0002] With the development of the Internet of Things and big data technology, the operation and maintenance mode of substations is changing from traditional manual monitoring to intelligent and automated. Among them, there are more and more application scenarios where intelligent inspection robots are used to replace operation and maintenance personnel to complete various inspection tasks of substations.
[0003] At present, the key points of motion control of intelligent inspection robots are navigation technology and path planning algorithms. The premise of the existing path planning algorithm is to construct a map in the substation through the grid method, restore the real physical size of various objects in the substation, and the location information of the intelligent inspection robot, inspection points and obstacles can be uniquely represented on the grid map. On this basis, combined with the commonly used search-based path planning algorithms such as Dijkstra algorithm and A* algorithm, the planning of the inspection path of the intelligent inspection robot is realized. Such algorithms are widely used in path planning of grid maps due to their probability completeness and path optimality. However, when applied in actual substation scenarios, it is found that such algorithms also have disadvantages such as low computational efficiency and slow search speed.
[0004] Therefore, the prior art still needs to be improved and developed. Summary of the invention
[0005] The main purpose of the present invention is to provide a path planning method, system, terminal and computer-readable storage medium for a substation intelligent inspection robot based on Beidou grid code, aiming to solve the problems of low computational efficiency and slow search speed in the existing methods for motion control and inspection path planning of intelligent inspection robots.
[0006] To achieve the above object, the present invention provides a path planning method for a substation intelligent inspection robot based on Beidou grid code, and the path planning method for a substation intelligent inspection robot based on Beidou grid code comprises the following steps:
[0007] Grid the substation area, construct a traversable area, and divide the traversable area into multiple connected traversable sections;
[0008] Establish an association between the inspection points and the passable road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections;
[0009] Calculate the distance from the starting point to the nearest section to be inspected, the shortest path from the starting point to the section to be inspected, and the last inspection point in the section, and set the last inspection point as the new starting point;
[0010] Take the last inspection point in the road section as the starting point, calculate the distance from the starting point to the nearest road section to be inspected, until there are no more sections to be inspected. When the cycle ends, a set of sections with a sequence is obtained, and the connection lines of the set of sections are calculated to obtain a complete inspection path.
[0011] Optionally, the path planning method for the substation intelligent inspection robot based on Beidou grid code, wherein the substation area is gridded, a traversable area is constructed, and the traversable area is divided into a plurality of connected traversable sections, specifically comprising:
[0012] Divide the substation area into grids according to the preset levels of the Beidou grid, and determine whether the corresponding grid is a passable grid based on the specific objects in the grid, construct the passable area of the substation, and obtain a passable path map inside the substation based on the passable area;
[0013] The traversable path map is intelligently analyzed using image recognition and connected component method, and combined with manual correction, the traversable path map is divided into sections to obtain multiple connected traversable sections.
[0014] Optionally, the path planning method for a substation intelligent inspection robot based on Beidou grid code, wherein the substation area is gridded according to a preset level of the Beidou grid, specifically comprising:
[0015] Determine the longitude and latitude of the four vertices of the rectangular area of the substation, as well as the longitude and latitude of specific objects inside the substation;
[0016] According to the national standard of Beidou grid code, longitude and latitude are converted into grid code to complete the grid division of the substation area.
[0017] Optionally, the path planning method for the substation intelligent inspection robot based on the Beidou grid code, wherein the establishing of an association relationship between the inspection points and the passable road sections, obtaining multiple road sections to be inspected, and sorting the inspection points in the road sections, specifically includes:
[0018] When planning the inspection route of the substation, after extracting the inspection point information that needs to be inspected in this task from the inspection task, establish the association between the inspection point and the road section;
[0019] The order of inspection points in the road section is calculated, and the order of points in the road section is sorted by calculating the distance from the grid where the point is located to the grid where the edge of the road section is located.
[0020] Optionally, the path planning method for the substation intelligent inspection robot based on the Beidou grid code, wherein when performing the inspection path planning of the substation, after extracting the inspection point information that needs to be inspected in this task from the inspection task, establishing an association relationship between the inspection point and the road section, specifically includes:
[0021] The longitude and latitude information in the inspection point information is converted into a grid code, and the grid code of the inspection point and the grid code set of the road section are calculated;
[0022] Determine whether there is an inclusion relationship between the inspection point grid code and the grid code set of the road section. If there is an inclusion relationship, establish an association relationship between the corresponding inspection point and the road section to obtain multiple road sections to be inspected;
[0023] Each road section to be inspected includes one or more inspection points, and a road section without an inspection point does not belong to the road section to be inspected.
[0024] Optionally, the path planning method for the substation intelligent inspection robot based on the Beidou grid code, wherein the calculation of the distance from the starting point to the nearest section to be inspected, the shortest path from the starting point to the section to be inspected and the last inspection point in the section, and setting the last inspection point as the new starting point, specifically includes:
[0025] According to the characteristics of the grid code in terms of size, a set of grids closest to the starting grid is calculated;
[0026] Calculate the shortest connection path between the starting point and the nearest section to be inspected, and determine the head and tail of the section to be inspected;
[0027] According to the head and tail of the most recent road section to be inspected, combined with the preset order of inspection points in the road section, the actual order of inspection points in the section is determined, and the last inspection point is obtained as the starting point of the next cycle.
[0028] Optionally, the path planning method for the substation intelligent inspection robot based on the Beidou grid code, wherein the last inspection point in the road section is taken as the starting point, and the road section to be inspected that is closest to the starting point is calculated until there is no road section to be inspected. When the cycle is completed, a road section set with a sequence is obtained, and the connection line of the road section set is calculated to obtain a complete inspection path, specifically including:
[0029] The last inspection point in the road section is used as the starting point for the next cycle calculation, and the nearest uninspected road section to the last inspection point is calculated until there is no road section to be inspected;
[0030] After all the road sections to be inspected are traversed, a complete set of inspection path sections with a sequence and inspection point data with a sequence are obtained;
[0031] Calculate the connection lines of the road segment set, combine it with the complete inspection path segment set with sequence, and get the complete inspection path.
[0032] In addition, to achieve the above purpose, the present invention also provides a substation intelligent inspection robot path planning system based on Beidou grid code, wherein the substation intelligent inspection robot path planning system based on Beidou grid code includes:
[0033] The regional gridding module is used to grid the substation area and construct the traversable area;
[0034] A road segment division module, used for dividing the traversable area into a plurality of connected traversable road segments;
[0035] The inspection point sorting module is used to establish an association between the inspection points and the passable road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections;
[0036] The first information calculation module is used to calculate the road section to be inspected that is closest to the starting point;
[0037] The second information calculation module is used to calculate the shortest path from the starting point to the road section to be inspected;
[0038] The third information calculation module is used to calculate the last inspection point in the road section and set the last inspection point as the new starting point;
[0039] The fourth information calculation module is used to take the last inspection point in the road section as the starting point and calculate the distance between the starting point and the nearest road section to be inspected until there is no road section to be inspected;
[0040] A road segment set generation module is used to obtain a road segment set with a sequence after the cycle is completed;
[0041] The inspection path generation module is used to calculate the connection lines of the road section set to obtain a complete inspection path.
[0042] In addition, to achieve the above-mentioned purpose, the present invention also provides a terminal, wherein the terminal includes: a memory, a processor, and a substation intelligent inspection robot path planning program based on the Beidou grid code stored in the memory and run on the processor, and the substation intelligent inspection robot path planning program based on the Beidou grid code is executed by the processor to implement the steps of the substation intelligent inspection robot path planning method based on the Beidou grid code as described above.
[0043] In addition, to achieve the above-mentioned purpose, the present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a path planning program for a substation intelligent inspection robot based on a Beidou grid code, and when the path planning program for a substation intelligent inspection robot based on a Beidou grid code is executed by a processor, the steps of the path planning method for a substation intelligent inspection robot based on a Beidou grid code as described above are implemented.
[0044] In the present invention, the substation area is gridded to construct a passable area, and the passable area is divided into a plurality of connected passable sections; an association relationship is established between inspection points and passable sections to obtain a plurality of sections to be inspected, and the inspection points in the sections are sorted; the section to be inspected that is closest to the starting point, the shortest path from the starting point to the section to be inspected, and the last inspection point in the section are calculated, and the last inspection point is set as a new starting point; the last inspection point in the section is taken as the starting point, and the section to be inspected that is closest to the starting point is calculated until there is no section to be inspected. When the cycle is completed, a section set with a sequence is obtained, and the connection lines of the section set are calculated to obtain a complete inspection path. Based on the gridding of the substation by using Beidou grid code technology, the passable area in the substation is divided into sections, and the association relationship between the inspection points and the sections is established in combination with grid operation. The shortest distance between the inspection points and the sections is determined by calculation to obtain an ordered set of sections, and finally a complete inspection path is obtained by splicing. The present invention divides the passable path into sections to form sections, and obtains the connecting line segments of the sections through grid calculation. The association relationship between points and sections is constructed through grid calculation, and the shortest distance path finding from points to sections is realized by grid distance calculation, thereby realizing path planning, reducing the number of inspection points that need to be path-finded, and improving the efficiency of path calculation. BRIEF DESCRIPTION OF THE DRAWINGS
[0045] Figure 1 It is a flow chart of a preferred embodiment of the path planning method of the substation intelligent inspection robot based on Beidou grid code of the present invention;
[0046] Figure 2 It is a schematic diagram of the passable area and the impassable area in a preferred embodiment of the path planning method of the substation intelligent inspection robot based on the Beidou grid code of the present invention;
[0047] Figure 3 It is a schematic diagram of the traversable road sections divided on the basis of the traversable area of the actual substation in a preferred embodiment of the substation intelligent inspection robot path planning method based on Beidou grid code of the present invention;
[0048] Figure 4 It is a schematic diagram of multiple navigable road sections in a preferred embodiment of the path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0049] Figure 5 It is a schematic diagram of establishing associations between inspection points and road sections and sorting the order of inspection points in a preferred embodiment of the path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0050] Figure 6 It is a schematic diagram of the distance between the starting point and the road section to be inspected in a preferred embodiment of the path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0051] Figure 7 It is a schematic diagram of calculating the shortest path from a starting point to a section to be inspected in a preferred embodiment of a path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0052] Figure 8 It is a schematic diagram of determining the last inspection point as the starting point of the next cycle in a preferred embodiment of the path planning method of the substation intelligent inspection robot based on the Beidou grid code of the present invention;
[0053] Fig. 9 In a preferred embodiment of the path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention, the last inspection point in the road section is used as the starting point of the next cycle calculation, and a schematic diagram of an uninspected road section closest to the inspection point is calculated;
[0054] Fig.10 It is a schematic diagram of the existing planned path;
[0055] Fig.11 and Fig.12 This is an example diagram of the internal grid of a real substation;
[0056] Fig.13 It is a schematic diagram of calculating the center point of a grid in a preferred embodiment of a path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0057] Fig.14 It is a schematic diagram of obtaining a complete inspection path in a preferred embodiment of the path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0058] Fig.15 It is a schematic diagram of an inspection path sent to an intelligent inspection robot using point grid data in a preferred embodiment of a path planning method for an intelligent inspection robot for a substation based on Beidou grid code of the present invention;
[0059] Fig.16It is a schematic diagram of processing the situation that the inspection point is not on the connection line after calculating the connection line of the road section set in a preferred embodiment of the substation intelligent inspection robot path planning method based on Beidou grid code of the present invention;
[0060] Fig.17 It is a schematic diagram showing that the inspection path finally obtained in the preferred embodiment of the substation intelligent inspection robot path planning method based on Beidou grid code of the present invention is not the shortest path;
[0061] Fig.18 It is a schematic diagram of different inspections performed by a traditional path planning algorithm and the path planning method of the present invention in a preferred embodiment of the path planning method of a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0062] Fig.19 It is a schematic diagram of the process of generating a complete inspection path in a preferred embodiment of the path planning method for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0063] Fig. 20 It is a structural diagram of a preferred embodiment of the path planning system for a substation intelligent inspection robot based on Beidou grid code of the present invention;
[0064] Fig.21 It is a structural diagram of a preferred embodiment of the terminal of the present invention. DETAILED DESCRIPTION
[0065] In order to make the purpose, technical solution and advantages of the present invention clearer and more specific, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.
[0066] Beidou Grid Code (BGC) is a national standard formulated by my country. The national standard document is GB / T 39409-2020 Beidou Grid Location Code. The main difference between the Beidou Grid Code and the currently commonly used latitude and longitude code to identify location information is that the latitude and longitude code uses a pair of coordinates to represent the location of a point, while the Beidou Grid Code uses an integer to represent an area location. The Beidou two-dimensional grid location code can finely express various entities in the real world through a ten-level grid. The Beidou two-dimensional grid code is composed of no more than 20 code elements, and the accuracy of the tenth-level grid can reach 1.5cm. In addition, the grid code also has the following characteristics:
[0067] (1) Grid codes have a hierarchical relationship. An upper grid code can be divided into multiple lower grid codes. For example, the tenth-level grid is obtained by dividing the ninth-level grid into 8×8 tenth-level grids according to longitude and latitude.
[0068] (2) The grid code has a size form. Each level of the Beidou grid has a fixed grid size. For example, the tenth level grid has a grid size of 1.5 cm × 1.5 cm.
[0069] (3) There is a directional relationship between grid codes. In the coding structure of the Beidou two-dimensional grid position code, the first code element takes the value N or S, representing the northern hemisphere and southern hemisphere of the earth's surface respectively. The second to fourth code elements identify the first-level grid. Among them, the second and third code elements identify the longitude grid, which are coded with 01 to 60; the fourth code element identifies the latitude grid, and the latitude is coded with A to V for the northern and southern hemispheres. Therefore, the directional relationship between the two grid codes can be determined by calculation (east, south, west, north, southeast, northeast, southwest, northwest).
[0070] The intelligent robot inspection in the substation mainly specifies the inspection points first, and then when performing the inspection task, the intelligent robot walks to the points to be inspected one by one to complete tasks such as taking photos or recording videos. Therefore, the current inspection route planning requires processing of the substation environment and inspection points. Including:
[0071] One method is to directly use the longitude and latitude of the inspection points, combine it with satellite positioning technology, calculate the shortest distance between the inspection points, and then plan the route.
[0072] One is to establish a two-dimensional coordinate system of XY axes with one point as the origin within the substation range. In actual work, since the substation fence range is a rectangular building area, the origin is generally one of the corners of the fence. After the coordinate system is established, the equipment, inaccessible areas, accessible areas, inspection points, etc. in the substation are clearly marked on the two-dimensional coordinate system. Then, during the actual inspection, the shortest distance between the inspection points is calculated based on the two-dimensional coordinate system to obtain the inspection path.
[0073] In the above two existing methods, no matter through longitude and latitude calculation or self-built two-dimensional coordinate technology, the calculation objects of path planning are all points, while the present invention combines the calculation of segments and points, which is different from the above existing technical methods.
[0074] The path planning method for a substation intelligent inspection robot based on Beidou grid code described in the preferred embodiment of the present invention is as follows: Figure 1 As shown, the path planning method for the substation intelligent inspection robot based on the Beidou grid code includes the following steps:
[0075] Step S10: grid the substation area, construct a traversable area, and divide the traversable area into a plurality of connected traversable sections.
[0076] Specifically, the substation area is gridded according to the preset level of the Beidou grid (for example, the eighth level of the Beidou grid, 0.97×0.97m), and whether the corresponding grid is a passable grid is determined according to the specific objects in the grid. For example, the grids in the substation interval area, main buildings, and equipment and facilities areas are inaccessible, and only the grids corresponding to the cement pavement areas inside the substation are passable grids. In this way, the passable area of the substation can be constructed, and a passable path map can be obtained inside the substation based on the passable area.
[0077] The reason why the substation area is divided according to the eighth level of the Beidou grid is that it can be divided into different levels according to the size of the substation and the actual application scenario. The larger the level, the greater the accuracy of the grid code. For example, the ninth level is (12.0×12.0cm). In the current actual project, the eighth level is selected because the grid size corresponding to this level is more suitable for the current substation scene application. The intelligent inspection robot with a length and width of about 1 meter will not have much deviation and impact when walking within the inspection path calculated by the 0.97 meter grid. In addition, if a too large level is selected, the number of grids will increase, and the time consumed by the calculation will also increase, so a compromise is needed in actual implementation. If the seventh level is (7.73×7.73m), the grid is too large and the error will be too large, which will cause the intelligent inspection robot to deviate from the passable area when walking, posing a threat to the equipment in the substation.
[0078] The specific operation is to determine the longitude and latitude of the four vertices of the rectangular area of the substation, as well as the longitude and latitude of specific objects inside the substation, and convert the longitude and latitude into grid codes according to the national standard of the Beidou grid code to complete the grid division of the substation area (it can be understood as using the national standard of the Beidou grid code to rasterize the substation).
[0079] like Figure 2 As shown, Figure 2 The area marked by white grids is an inaccessible area, and the area marked by gray grids is a accessible area.
[0080] After obtaining a traversable path map inside the substation, the traversable path map is intelligently analyzed using technologies such as image recognition and connected component method. Combined with manual correction methods, the traversable path map can be divided into sections to obtain multiple connected traversable sections, that is, the traversable path map is divided into sections of rectangular-like sections, which are actually composed of a set of grid sets.
[0081] like Figure 3 As shown, Figure 3It is a passable road section divided on the basis of the passable area of an actual substation. Due to the construction characteristics of the substation, the passable areas inside are relatively standardized horizontal and vertical intersecting line segments, so it is relatively simple to divide the road sections. If the road section division results in multiple division results, then the method of "combining manual correction" or "direct division through manual means" can ensure that the road section division is what you want in the end. Furthermore, as long as the amount of training data is large enough, after continuous manual correction of the algorithm and repeated iterative training, the algorithm for intelligent road section division can obtain the optimal intelligent road section division algorithm adapted to the substation scenario, and then there will be no need for manual intervention and confirmation.
[0082] Another implementation method is to manually draw connected and drivable road sections on the route map.
[0083] like Figure 4 As shown, Figure 4 The area marked by white grids is an impassable area, and the areas marked by gray, blue, and green grids are multiple road sections divided on the basis of the passable area. The turning point of the path map is the split position of the two road sections. According to this division method, passable road section 1, passable road section 2, passable road section 3, passable road section 4, and passable road section 5 are obtained.
[0084] This step can determine the connectivity between road sections, providing a basis for subsequent path planning.
[0085] In a specific implementation, a passable road section is a set of grid codes. Whether two passable road sections are connected is determined by finding the intersection of the two sets of grid codes. If there is an intersection, that is, there is an overlapping area space between the two passable road sections, it can be considered that the two passable road sections are connected.
[0086] like Figure 4 It can be seen that:
[0087] (1) Passable road section 1 and passable road section 2 are connected;
[0088] (2) Passable road section 2 is connected to passable road section 1, passable road section 3, and passable road section 4;
[0089] (3) Passable road section 3 is connected to passable road section 2 and passable road section 5;
[0090] (4) Passable road section 4 is connected to passable road section 2 and passable road section 5;
[0091] (5) Passable road section 5 is connected to passable road section 3 and passable road section 4.
[0092] Step S20: Establish an association relationship between the inspection points and the passable road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections.
[0093] Specifically, when planning the inspection route of the substation, after extracting the inspection point information that needs to be inspected in this task from the inspection task, the association between the inspection points and the road section is established; the order of the inspection points in the road section is calculated, and the order of the points in the road section is sorted by calculating the distance from the grid where the point is located to the grid where the edge of the road section is located.
[0094] When planning the inspection route of the substation, after extracting the inspection point information that needs to be inspected in this task from the inspection task, establish the association relationship between the inspection point and the road section. The specific operation is to convert the longitude and latitude information in the inspection point information into a grid code, and then calculate the inspection point grid code and the grid code set of the road section to determine whether there is an inclusion relationship between the two. If there is an inclusion relationship, the inspection point and the road section are associated, that is, the inspection point is in the road section. Finally, multiple road sections to be inspected are obtained. Each road section to be inspected contains one or more inspection points, and the road section without an inspection point does not belong to the road section to be inspected.
[0095] Then the sequence of inspection points in the road section is calculated. The specific operation is to set one end of the road section as the head and the other end as the tail, and calculate the sequence of the inspection points in the middle. The specific operation is to calculate the distance from the grid code of each inspection point to the grid code of the road section head (road section edge). The shorter the distance, the higher the queue. Through this step, the inspection points can be sorted in advance. The preset sequence of inspection points in the road section will be used in subsequent path planning.
[0096] like Figure 5 As shown, we can know:
[0097] (1) Point 1, Point 2, Point 3 and Section 1 to be inspected (passable section 3) have an inclusion relationship, and a correlation relationship needs to be established; Point 4, Point 5, Point 6 and Section 2 to be inspected (passable section 4) have an inclusion relationship, and a correlation relationship needs to be established.
[0098] (2) The road sections to be inspected include: road section 1 to be inspected (passable road section 3) and road section 2 to be inspected (passable road section 4).
[0099] (3) In the section 1 to be inspected, based on the distance, the preset order of the points is: point 1, point 2, point 3; in the section 2 to be inspected, based on the distance, the preset order of the points is: point 4, point 5, point 6.
[0100] It needs to be further explained that after the relationship between the point and the road section is confirmed, combined with the size attribute of the grid code itself and the directional relationship between the grid codes, the order of the points in the road section can be sorted by calculating the distance from the grid where the point is located to the grid where the edge of the road section (that is, the edge of the above-mentioned rectangular-like side) is located.
[0101] Step S30, calculate the distance between the starting point and the nearest road section to be inspected, the shortest path from the starting point to the road section to be inspected and the last inspection point in the road section, and set the last inspection point as the new starting point.
[0102] Specifically, based on the size characteristics of the grid code, a set of grids closest to the starting grid is calculated; the shortest connection path from the starting point to the nearest section to be inspected is calculated to determine the head and tail of the section to be inspected; based on the head and tail of the nearest section to be inspected, combined with the preset order of inspection points in the section, the actual order of inspection points in the section is determined, and the last inspection point is obtained as the starting point for the next cycle.
[0103] Calculate the nearest inspection section to the starting point of the inspection task. The starting point is fixed, which is the hangar position of the robot. The hangar position is also a grid code. The specific operation is to calculate a set of grids closest to the starting grid through the size and shape characteristics of the grid code.
[0104] like Figure 6 As shown, Figure 6 The distance from the starting grid (green) to the section to be inspected 1 and the section to be inspected 2 is calculated through grids. It can be known that the starting point is closer to the section to be inspected 1, as shown by the red dotted line, only one grid away; the distance to the section to be inspected 2 is 5 grids away.
[0105] It needs to be further explained that the distance calculation from the starting grid to multiple sections to be inspected, when implemented specifically, the starting point is a grid, the section to be inspected is a group of grids, and it is actually a process of calculating the distance from one grid to multiple groups of grids and finding the group of grids with the shortest distance.
[0106] According to the data in step S20, the shortest connection path between the starting point and the nearest section to be inspected is calculated, that is, how to reach the section to be inspected from the starting point through the accessible path inside the substation.
[0107] This step also determines the head and tail of the road section to be inspected, and the first one passed is set as the head of the road section.
[0108] like Figure 7 As shown, the shortest path from the starting point to the section to be inspected is calculated as: passable section 1 -> passable section 2 -> path 1 to be inspected (passable section 3). The head and tail of path 1 to be inspected (passable section 3) can be determined.
[0109] According to the head and tail of the nearest road section obtained above, combined with the preset order of inspection points in the road section in step S20, the actual order of inspection points in the section is determined, and the last inspection point is obtained as the starting point of the next cycle.
[0110] Since the order of the shortest path from the starting point to the road section to be inspected is pre-judged based on the head and tail of the section, when planning the specific path, it is possible to enter the section from the head or from the tail. Therefore, it is necessary to rearrange the sequence of inspection points in the section in ascending or descending order according to the actual situation.
[0111] like Figure 8 As shown, after determining the head and tail of the section 1 to be inspected, it is known that the actual order of the points in it is: point 1->point 2->point 3, then point 3 is the last inspection point and serves as the starting point of the next cycle.
[0112] Step S40, taking the last inspection point in the road section as the starting point, calculating the distance from the starting point to the nearest road section to be inspected, until there are no more sections to be inspected, when the cycle is completed, a set of sections with a sequence is obtained, and the connection lines of the set of sections are calculated to obtain a complete inspection path.
[0113] Specifically, the last inspection point in the road section is taken as the starting point of the next cycle calculation, and the nearest uninspected road section to the last inspection point is calculated until there are no more sections to be inspected; when all the sections to be inspected are traversed, a complete set of inspection path segments with a sequence and inspection point data with a sequence are obtained; the connection lines of the road section set are calculated, and combined with the complete set of inspection path segments with a sequence, a complete inspection path is obtained.
[0114] The last inspection point in the road section is used as the starting point for the next cycle calculation, and the nearest uninspected road section to the inspection point is calculated until there are no more sections to be inspected.
[0115] like Fig. 9 As shown, Fig. 9 It can be seen that point 3 is the last inspection point in the section to be inspected 1 (passable section 3). As the starting point of the next cycle, judging by the grid distance, the grid is closer to the section to be inspected 2, separated by two grids, as shown by the red dotted line.
[0116] After all the sections to be inspected are traversed, a complete set of inspection path segments with a sequence is obtained, but this set is not the final inspection path, but only the inspection area. In addition, this step also obtains the inspection point data with a sequence.
[0117] The set of road sections with a sequence obtained above is not an inspection path, but an inspection area, which is a surface. That is, to instruct the intelligent inspection robot on how to walk in the substation, it is also necessary to draw a specific inspection route in the area, that is, the surface needs to be converted into a line. Only the drawn line is the inspection path.
[0118] For the existing technology, no matter whether the path is planned by using a grid or a grid, it is not a straight line, which results in the intelligent inspection robot walking path not being a straight line, such as Fig.10 As shown, the purple line is the planned path, and the grid lines along the path are curved.
[0119] The reason for this is that the traversable grid itself is not in a straight line, so no matter how it is planned, there will be some bends. Fig.11 and Fig.12 This is an example of a real substation internal grid. The yellow border is a passable grid. It can be more intuitively seen that the path connection line marked by the red grid is curved. If this data is transmitted to the intelligent inspection robot, it will also walk in a curved way on the straight road, which is obviously unacceptable in the actual inspection scenario.
[0120] The specific operation of the present invention is that the road section area divided in step S10 is a quasi-rectangle, and the head and tail of the road section are the two sides of the rectangle, such as Fig.13 As shown, the grid at the center position of the edge is obtained by grid calculation, and the center points of the two grids are calculated at the same time, and the two center points are connected to form a straight line segment that runs through the road section; when there are two intersections of road sections, the grid in the area where the two sections overlap is calculated, the center grid of the area is found, and the center point of the grid is calculated as the point for drawing a straight line, and the point is connected to the center points of the grids at the center positions of the two edges of the two intersecting sections mentioned above, forming an L-shaped line segment that runs through the two sections.
[0121] like Fig.14 As shown in the figure, through the above processing, the connected line segments are obtained, and the complete inspection path is obtained by combining the complete inspection path segment set with sequence. Because the data obtained are point data, they are passed to the intelligent inspection robot. When actually walking, it walks in a straight line from one point to another, and there will be no bending walking.
[0122] like Fig.15 As shown, it needs to be further explained that the inspection path finally sent to the intelligent inspection robot is a set of point grid data: center point 1, center point 2, center point 3, center point 6, center point 5, and center point 4.
[0123] In practical applications, the above-mentioned points are actually the codes of the grids in which they are located. If the intelligent inspection robot can complete the inspection according to the grid code itself, the grid code will be sent directly to the intelligent inspection robot. If the intelligent inspection robot cannot recognize it, the grid code can be converted into longitude and latitude information and sent to the intelligent inspection robot.
[0124] Furthermore, when a checkpoint falls on two sections at the same time, it is assigned to the section with more checkpoints, because this is more likely to reduce the number of sections, thereby reducing the amount of calculation. For example, if there is only one checkpoint on a section, and this checkpoint can also be assigned to another section with multiple checkpoints, then this checkpoint should establish an association with the section with multiple checkpoints, because after changing the assigned section, the calculation of one section will be reduced when doing path planning, achieving the purpose of reducing the amount of calculation and improving efficiency.
[0125] Furthermore, when the road section to be inspected is not at the beginning or the end of the road section, but in the middle of the road section, the method for determining which side of the road section is the beginning and which side is the end is:
[0126] Method 1: Divide the road section into two halves according to the grid of the arrival point, determine which side is shorter, and use the shorter side as the head and the other side as the tail. If it is exactly at the middle point of the section and both sides are the same length, a random side is used as the head. The specific implementation is to calculate the length of the road section according to the grid size. The advantage of method 1 is that the calculation is simple.
[0127] Method 2: When the two sides are calculated as the head or the tail, the distance between the last inspection point (end point) and the next segment is shorter, and the shorter segment is used as the tail. The advantage of method 2 is that the local shortest distance can be obtained.
[0128] The current practical application adopts method 1. It should also be noted that when the robot arrives at the road section, it will first inspect from the starting point of the road section, not from the inspection point in the middle of the road section.
[0129] Furthermore, after calculating the connection line of the road segment set, if the inspection point is not on the connection line, that is, for the path without inspection points, the grids of the center position of the path head and tail are sent to the intelligent inspection robot. When the robot walks in real time, it is a straight line between the two points; for the path with inspection points, and the inspection points are not on the straight line segment connecting the head and tail of the path, it is necessary to fine-tune the local path. The specific operation is to calculate the grid of the shortest distance from the inspection point grid to the connected line segment. When the robot reaches the grid of the shortest distance, it walks to the specific inspection point position, returns to the original connected line segment after completing the inspection, and continues to walk to the next inspection point. The actual walking inspection path of the final inspection robot is actually similar to a fishbone diagram.
[0130] like Fig.16 As shown in the figure, the final inspection path is: starting point (hangar location) -> auxiliary point 1 -> auxiliary point 2 -> point 1 -> auxiliary point 3 -> point 2 -> auxiliary point 3 -> point 3 -> auxiliary point 4 -> auxiliary point 5 -> auxiliary point 6 -> point 6 -> auxiliary point 6 -> point 5 -> auxiliary point 7 -> point 4 -> auxiliary point 7 -> auxiliary point 8.
[0131] In practical applications, the above-mentioned points are actually the codes of the grids in which they are located. If the intelligent inspection robot can complete the inspection according to the grid code itself, the grid code will be sent directly to the intelligent inspection robot. If the intelligent inspection robot cannot recognize it, the grid code can be converted into longitude and latitude information and sent to the intelligent inspection robot.
[0132] Furthermore, if the direct line calculated by drawing a line connecting the center grids of the two sides of the path passes through an inaccessible grid, the following processing is performed:
[0133] When the road section is very narrow and long, the line connecting the two sides may pass through an impassable area. In this case, the current processing method is to refine the grid level, that is, divide the area into smaller grids. For example, the original eighth level (0.97×0.97m) is used for division, and now the accuracy is increased and the ninth level (12.0cm×12.0cm) is used for division. Then, instead of only calculating the center grid of the edge, all the grids on the edge are calculated again until the connection line does not pass through the impassable area. In this way, it can be ensured that the connected line will not pass through the impassable area.
[0134] Furthermore, the distance from the starting point to the nearest section to be inspected is calculated. The final inspection path obtained by this algorithm is not necessarily the shortest inspection distance. Fig.17 As shown in the figure, the distance from point 1 to the section 2 to be inspected is shorter than the distance to the section 3 to be inspected, but the actual path from the grid position of point 1 to the grid position of point 2 (the number of grids passed is 11) is longer than the path from the grid position of point 1 to the grid position of point 3 (the number of grids passed is 7). Therefore, from this example, we can see that the final inspection path is not the shortest path.
[0135] Therefore, it should be noted that no algorithm can be all-encompassing and can both improve the calculation speed and achieve the optimal. The present invention is to find a balance point between the two. There are areas in the algorithm of the present invention that need to be further improved. For example, in the link of "dividing the passable area into multiple connected passable sections", while calculating the connectivity between the passable sections, the travel costs between them are calculated, that is, the travel distance between the passable sections is obtained by counting grids. In the link of "calculating the section to be inspected that is closest to the starting point", this can be used as a parameter to evaluate and select the section to be inspected that is closest to the starting point, so as to achieve the optimization effect of obtaining the shortest inspection path as much as possible.
[0136] In addition, the existing technology also includes positioning and path planning through RFID, and positioning and path planning through real-time video recognition by a camera on the robot.
[0137] One of the characteristics of the present invention compared with the prior art is that it uses grid codes for calculation. The main applications are:
[0138] (1) Calculation of the association relationship between inspection points and road sections, that is, calculation of the inclusion relationship between a grid and a grid set.
[0139] (2) The order of inspection points in the road section is calculated through grid operation. The grid at the beginning of the road section is used as the starting point, and the distance between each inspection point grid in the road section and the starting point grid is calculated. That is, the distance between grids is calculated.
[0140] (3) The shortest distance calculation from the inspection point to the segment to be inspected, that is, the distance calculation from a grid to a set of grids.
[0141] (4) Connection calculation of the inspection path within the road section: the grid at the center position of the edge corresponding to the head and tail of the road section is calculated through the grid, and the center points of the two grids are connected to form a straight line segment that runs through the section; if there is a place where two segments intersect, the grid set in the area where the two segments overlap is calculated, and the center grid is found as the point for drawing the straight line segment. That is, the center grid in the grid set is calculated.
[0142] The advantages of the present invention over the prior art are:
[0143] (1) The relationship between inspection points and road sections can realize segmented distributed computing to improve efficiency. Each road section independently calculates the order of inspection points within its own section.
[0144] (2) Existing path planning algorithms, such as the A* algorithm, need to calculate the shortest distances of all unreached points when calculating the next point to be reached. The present invention proposes to transform the traditional point-to-point path finding into point-to-segment path finding by constructing an association between points and road segments. It only needs to calculate the shortest distance from point to segment to obtain the path. Because the inspection order of the points in the segment has been calculated in the previous step, the points in the segment do not need to be calculated again. This method reduces the amount of calculation and improves efficiency.
[0145] (3) The existing path planning algorithm calculates the nearest next point for each point. In the actual application scenario of substation inspection, the planned inspection path may not complete the inspection points in a certain section, but turn to the adjacent section to continue the inspection, and then return to the original section, thus repeatedly walking back and forth between the two sections. This leads to low and unreasonable inspection efficiency. The method proposed in the present invention can effectively avoid this situation, reduce the repeated walking between the two sections, and reduce the possibility of backtracking.
[0146] like Fig.18 As shown, according to the traditional path planning algorithm, the point closest to point 1 is point 2, and the point closest to point 2 is point 3. Then the inspection path based on the traditional algorithm is: point 1->point 2->point 3->point 4, which eventually causes the intelligent inspection robot to walk repeatedly between the path to be inspected 1 and the path to be inspected 2. However, by adopting the path planning method of the present invention, the intelligent inspection robot will only complete the inspection of the path to be inspected 1 first, and then complete the inspection on the path to be inspected 2. The inspection path based on the algorithm of the present invention is: point 1->point 3->point 2->point 4. Such path planning is more reasonable and more in line with the actual situation.
[0147] (4) The existing path planning algorithms using grids, because the grids themselves are not in a straight line, will always have certain curvatures no matter how the planning is done. The method proposed in the present invention of drawing a line connecting the center grids of the two sides of the path achieves the effect that the inspection path is a straight line. By optimizing the path in this way, the problem of the curvature of the robot's walking path is solved.
[0148] Furthermore, if Fig.19 As shown, the specific process of the path planning method of the substation intelligent inspection robot based on the Beidou grid code of the present invention is as follows:
[0149] Step 1: Grid the substation area and construct a traversable area.
[0150] Step 2: Divide the traversable area into a plurality of connected traversable road sections.
[0151] Step three: establish an association between the inspection points and the road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections.
[0152] Step 4: Calculate the distance from the starting point to the nearest road section to be inspected.
[0153] Step 5: Calculate the shortest path from the starting point to the road section to be inspected.
[0154] Step 6: Calculate the last inspection point in the road section and set it as the new starting point.
[0155] Step 7, looping steps 4 to 6, taking the last inspection point in the road section as the starting point, and calculating the distance from the starting point to the nearest road section to be inspected, until there is no road section to be inspected, and the loop ends.
[0156] Step 8: After the loop is finished, a set of road sections with a sequence is obtained.
[0157] Step nine, calculate the connection lines of the road section set to obtain a complete inspection path.
[0158] The present invention provides a method for substation intelligent inspection robot path planning based on Beidou grid code, which utilizes Beidou grid code technology to realize gridding of substation, divides the passable area in substation into sections, combines grid operation, establishes the correlation between inspection points and sections, calculates and determines the shortest distance between inspection points and sections, obtains an ordered set of sections, and finally obtains a complete inspection path by splicing. The advantage of this method is that it uses grid code for calculation, introduces the concept of points and sections, reduces the number of inspection points that need to be found, and improves the efficiency of path calculation.
[0159] Furthermore, if Fig. 20 As shown, based on the above-mentioned Beidou grid code-based substation intelligent inspection robot path planning method, the present invention also provides a substation intelligent inspection robot path planning system based on Beidou grid code, wherein the substation intelligent inspection robot path planning system based on Beidou grid code includes:
[0160] The regional gridding module 51 is used to grid the substation area and construct a traversable area;
[0161] A road segment division module 52, used for dividing the traversable area into a plurality of connected traversable road segments;
[0162] The inspection point sorting module 53 is used to establish an association relationship between the inspection points and the passable road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections;
[0163] The first information calculation module 54 is used to calculate the nearest road section to be inspected from the starting point;
[0164] The second information calculation module 55 is used to calculate the shortest path from the starting point to the road section to be inspected;
[0165] The third information calculation module 56 is used to calculate the last inspection point in the road section and set the last inspection point as the new starting point;
[0166] The fourth information calculation module 57 is used to take the last inspection point in the road section as the starting point and calculate the distance between the starting point and the nearest road section to be inspected until there is no road section to be inspected;
[0167] A road segment set generation module 58 is used to obtain a road segment set with a sequence after the loop is completed;
[0168] The inspection path generation module 59 is used to calculate the connection lines of the road segment set to obtain a complete inspection path.
[0169] Furthermore, if Fig.21 As shown, based on the above-mentioned Beidou grid code-based substation intelligent inspection robot path planning method and system, the present invention also provides a terminal accordingly, and the terminal includes a processor 10, a memory 20 and a display 30. Fig.21 Only some components of the terminal are shown, but it should be understood that it is not required to implement all of the components shown, and more or fewer components may be implemented instead.
[0170] In some embodiments, the memory 20 may be an internal storage unit of the terminal, such as a hard disk or memory of the terminal. In other embodiments, the memory 20 may also be an external storage device of the terminal, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (SecureDigital, SD) card, a flash card (Flash Card), etc. equipped on the terminal. Further, the memory 20 may also include both an internal storage unit of the terminal and an external storage device. The memory 20 is used to store application software and various types of data installed on the terminal, such as the program code of the installation terminal. The memory 20 may also be used to temporarily store data that has been output or is to be output. In one embodiment, a path planning program 40 for a substation intelligent inspection robot based on a Beidou grid code is stored on the memory 20, and the path planning program 40 for a substation intelligent inspection robot based on a Beidou grid code can be executed by the processor 10, thereby realizing the path planning method for a substation intelligent inspection robot based on a Beidou grid code in the present application.
[0171] In some embodiments, the processor 10 can be a central processing unit (CPU), a microprocessor or other data processing chip, used to run the program code or process data stored in the memory 20, such as executing the path planning method of the substation intelligent inspection robot based on the Beidou grid code.
[0172] In some embodiments, the display 30 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch device, etc. The display 30 is used to display information on the terminal and to display a visual user interface. The components 10-30 of the terminal communicate with each other via a system bus.
[0173] In one embodiment, when the processor 10 executes the substation intelligent inspection robot path planning program 40 based on the Beidou grid code in the memory 20, the steps of the substation intelligent inspection robot path planning method based on the Beidou grid code as described above are implemented.
[0174] The present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a path planning program for a substation intelligent inspection robot based on a Beidou grid code, and when the path planning program for a substation intelligent inspection robot based on a Beidou grid code is executed by a processor, the steps of the path planning method for a substation intelligent inspection robot based on a Beidou grid code as described above are implemented.
[0175] In summary, the present invention provides a path planning method, system, terminal and storage medium for a substation intelligent inspection robot based on Beidou grid code. The method includes: gridding the substation area, constructing a passable area, and dividing the passable area into a plurality of connected passable sections; establishing an association between inspection points and passable sections to obtain a plurality of sections to be inspected, and sorting the inspection points in the sections; calculating the section to be inspected that is closest to the starting point, the shortest path from the starting point to the section to be inspected, and the last inspection point in the section, and setting the last inspection point as a new starting point; taking the last inspection point in the section as the starting point, calculating the section to be inspected that is closest to the starting point, until there is no section to be inspected. When the cycle ends, a section set with a sequence is obtained, and the connection lines of the section set are calculated to obtain a complete inspection path. Based on the gridding of the substation by using Beidou grid code technology, the passable area in the substation is divided into sections, and the association relationship between the inspection points and the sections is established in combination with grid operation. The shortest distance between the inspection points and the sections is determined by calculation to obtain an ordered set of sections, and finally a complete inspection path is obtained by splicing. The present invention divides the passable path into sections to form sections, and obtains the connecting line segments of the sections through grid calculation. The association relationship between points and sections is constructed through grid calculation, and the shortest distance path finding from points to sections is realized by grid distance calculation, thereby realizing path planning, reducing the number of inspection points that need to be path-finded, and improving the efficiency of path calculation.
[0176] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or terminal including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or terminal. In the absence of further restrictions, an element defined by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or terminal including the element.
[0177] Of course, those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing related hardware (such as a processor, a controller, etc.) through a computer program, and the program can be stored in a computer-readable storage medium that can be read by a computer, and the program can include the processes of the above-mentioned method embodiments when executed. The computer-readable storage medium can be a memory, a disk, an optical disk, etc.
[0178] It should be understood that the application of the present invention is not limited to the above examples. For ordinary technicians in this field, improvements or changes can be made based on the above description. All these improvements and changes should fall within the scope of protection of the claims attached to the present invention.
Claims
1. A path planning method for a substation intelligent inspection robot based on Beidou grid code, characterized in that: The path planning method of the substation intelligent inspection robot based on Beidou grid code includes: Grid the substation area, construct a traversable area, and divide the traversable area into multiple connected traversable sections; Establish an association between the inspection points and the passable road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections; Calculate the distance from the starting point to the nearest section to be inspected, the shortest path from the starting point to the section to be inspected, and the last inspection point in the section, and set the last inspection point as the new starting point; Take the last inspection point in the road section as the starting point, calculate the distance from the starting point to the nearest road section to be inspected, until there are no more sections to be inspected. When the cycle ends, a set of sections with a sequence is obtained, and the connection lines of the set of sections are calculated to obtain a complete inspection path.
2. The path planning method for a substation intelligent inspection robot based on Beidou grid code according to claim 1 is characterized in that: The gridding of the substation area, constructing a traversable area, and dividing the traversable area into a plurality of connected traversable sections specifically includes: Divide the substation area into grids according to the preset levels of the Beidou grid, and determine whether the corresponding grid is a passable grid based on the specific objects in the grid, construct the passable area of the substation, and obtain a passable path map inside the substation based on the passable area; The traversable path map is intelligently analyzed using image recognition and connected component method, and combined with manual correction, the traversable path map is divided into sections to obtain multiple connected traversable sections.
3. The path planning method for a substation intelligent inspection robot based on Beidou grid code according to claim 2 is characterized in that: The grid division of the substation area according to the preset level of the Beidou grid specifically includes: Determine the longitude and latitude of the four vertices of the rectangular area of the substation, as well as the longitude and latitude of specific objects inside the substation; According to the national standard of Beidou grid code, longitude and latitude are converted into grid code to complete the grid division of the substation area.
4. The path planning method for a substation intelligent inspection robot based on Beidou grid code according to claim 1 is characterized in that: The step of establishing an association between inspection points and passable road sections, obtaining multiple road sections to be inspected, and sorting the inspection points in the road sections specifically includes: When planning the inspection route of the substation, after extracting the inspection point information that needs to be inspected in this task from the inspection task, establish the association between the inspection point and the road section; The order of inspection points in the road section is calculated, and the order of points in the road section is sorted by calculating the distance from the grid where the point is located to the grid where the edge of the road section is located.
5. The path planning method for a substation intelligent inspection robot based on Beidou grid code according to claim 4 is characterized in that: When planning the inspection route of the substation, after extracting the inspection point information that needs to be inspected in this task from the inspection task, the association relationship between the inspection point and the road section is established, specifically including: The longitude and latitude information in the inspection point information is converted into a grid code, and the grid code of the inspection point and the grid code set of the road section are calculated; Determine whether there is an inclusion relationship between the inspection point grid code and the grid code set of the road section. If there is an inclusion relationship, establish an association relationship between the corresponding inspection point and the road section to obtain multiple road sections to be inspected; Each road section to be inspected includes one or more inspection points, and a road section without an inspection point does not belong to the road section to be inspected.
6. The path planning method for a substation intelligent inspection robot based on Beidou grid code according to claim 5 is characterized in that: The calculating of the distance between the starting point and the nearest road section to be inspected, the shortest path from the starting point to the road section to be inspected and the last inspection point in the road section, and setting the last inspection point as the new starting point specifically includes: According to the characteristics of the grid code in terms of size, a set of grids closest to the starting grid is calculated; Calculate the shortest connection path between the starting point and the nearest section to be inspected, and determine the head and tail of the section to be inspected; According to the head and tail of the most recent road section to be inspected, combined with the preset order of inspection points in the road section, the actual order of inspection points in the section is determined, and the last inspection point is obtained as the starting point of the next cycle.
7. The path planning method for a substation intelligent inspection robot based on Beidou grid code according to claim 6 is characterized in that: The last inspection point in the road section is taken as the starting point, and the road section to be inspected that is closest to the starting point is calculated until there is no road section to be inspected. When the cycle is completed, a road section set with a sequence is obtained, and the connection line of the road section set is calculated to obtain a complete inspection path, which specifically includes: The last inspection point in the road section is used as the starting point for the next cycle calculation, and the nearest uninspected road section to the last inspection point is calculated until there is no road section to be inspected; After all the road sections to be inspected are traversed, a complete set of inspection path sections with a sequence and inspection point data with a sequence are obtained; Calculate the connection lines of the road segment set, combine it with the complete inspection path segment set with sequence, and get the complete inspection path.
8. A substation intelligent inspection robot path planning system based on Beidou grid code, characterized in that: The substation intelligent inspection robot path planning system based on Beidou grid code includes: The regional gridding module is used to grid the substation area and construct the traversable area; A road segment division module, used for dividing the traversable area into a plurality of connected traversable road segments; The inspection point sorting module is used to establish an association between the inspection points and the passable road sections, obtain multiple road sections to be inspected, and sort the inspection points in the road sections; The first information calculation module is used to calculate the road section to be inspected that is closest to the starting point; The second information calculation module is used to calculate the shortest path from the starting point to the road section to be inspected; The third information calculation module is used to calculate the last inspection point in the road section and set the last inspection point as the new starting point; The fourth information calculation module is used to take the last inspection point in the road section as the starting point and calculate the distance between the starting point and the nearest road section to be inspected until there is no road section to be inspected; A road segment set generation module is used to obtain a road segment set with a sequence after the cycle is completed; The inspection path generation module is used to calculate the connection lines of the road section set to obtain a complete inspection path.
9. A terminal, characterized in that: The terminal includes: a memory, a processor, and a Beidou grid code-based substation intelligent inspection robot path planning program stored in the memory and runnable on the processor. When the Beidou grid code-based substation intelligent inspection robot path planning program is executed by the processor, the steps of the Beidou grid code-based substation intelligent inspection robot path planning method as described in any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a path planning program for a substation intelligent inspection robot based on a Beidou grid code. When the path planning program for a substation intelligent inspection robot based on a Beidou grid code is executed by a processor, the steps of the path planning method for a substation intelligent inspection robot based on a Beidou grid code are implemented as described in any one of claims 1 to 7.
Citation Information
Cited By
Non-contact measurement system for multi-dimensional parameters of transformer substation
CN119147050A
A non-contact measurement system for multi-dimensional parameters of substations
CN119147050B
Substation three-dimensional inspection system based on image analysis
CN120297533A
Grid code-based inspection data acquisition optimization method and system, and electronic equipment
CN120598543A
Robot motion control method and related device
CN120993916A
