Photovoltaic field in-station path navigation method based on GeoTiff
Through the GeoTiff-based path navigation method, the problem of complex paths in the photovoltaic site is solved, and the navigation of staff quickly find abnormal equipment is realized, improving patrol efficiency and maintenance process optimization.
Patent Information
- Application Number
- CN202411154656.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-21
- Publication Date
- 2024-12-03
AI Technical Summary
The path network in the photovoltaic site is complex, and the existing technology cannot provide effective navigation services, making it difficult for staff to quickly find abnormal equipment during inspection and maintenance.
Using the GeoTiff-based path navigation method, the GeoTiff map of the photovoltaic site path layout is produced by obtaining geographic information data, and the image processing technology and geographical coordinate system are used to convert it into a binary map of the black background white route to determine the starting point and the end point. GPS coordinates, use the image path search method to find the optimal path, and convert the pixel coordinate sequence into a GPS coordinate sequence for navigation.
It realizes accurate and fast navigation within the photovoltaic site, improves the work efficiency of staff, and optimizes the operation and maintenance process of the photovoltaic power generation system.
Smart Images

Figure CN119063751A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of map navigation, and specifically relates to a path navigation method within a photovoltaic station based on GeoTiff, mainly for navigation between two points within a photovoltaic station, that is, navigation of personnel to abnormal equipment. Background Art
[0002] Photovoltaic power generation, as an important component of clean energy, has been widely used and promoted. However, with the continuous increase in the scale of photovoltaic stations, the path network within the stations has become increasingly large and complex, bringing certain challenges to the inspection and maintenance work of staff.
[0003] In the operation and maintenance scenario of a photovoltaic station, when the drone inspection system sends abnormal information about photovoltaic panels to the staff, since the map software does not provide internal path navigation services in the station, the staff needs to determine the abnormal equipment and their own location based on the alarm information displayed on the terminal and the actual situation on site, and then go to the abnormal equipment for inspection based on experience. Therefore, it is of great significance to develop an efficient path navigation method within a photovoltaic station, which can help inspection staff quickly and efficiently go to the abnormal equipment.
[0004] CN107478242A discloses a navigation method and system, and the technical problem to be solved is: if a user is located in a closed area, such as a community with a wall, the existing navigation software will directly pass through the wall to match the user's current location to the road outside the closed area closest to the user's current location. However, even if the matched road is closest to the user, the user cannot directly break through the wall because of the wall. Therefore, it is impossible to provide reasonable navigation guidance to the user.
[0005] The method disclosed in CN107478242A mainly solves the problem of planning results penetrating walls during navigation, while the method proposed in the present invention mainly solves the problem of finding the optimal path between points on a specified path in the scenario of a photovoltaic station. The technical problems solved and the methods used to solve the problems are different from those of the present invention.
[0006] CN108073176A The invention discloses an improved D*Lite vehicle dynamic path planning method, comprising the following steps: 1) obtaining the current state and target state of the vehicle, and obtaining the current environment map information, and then using morphological operations to expand the obstacles in the current environment map; 2) constructing a vehicle operation model; 3) based on the restrictions of the vehicle kinematic model, using the D*Lite algorithm to search for a path on the expanded environment map; 4) adjusting the orientation angle of the vehicle when reaching the end point according to the Reeds-Shepp curve; 5) constructing a final path according to the shortest path generated in step 3) and the Reeds-Shepp curve in step 4), and then using an energy function and a gradient descent method to smooth the final path, and completing the improved D*Lite vehicle dynamic path planning. The method can realize path planning in a dynamic environment.
[0007] The method disclosed in CN108073176A mainly solves the problem of local path planning of vehicles in the automatic driving solution, that is, how to make the vehicle run more smoothly and smoothly. The method focuses on the movement of the vehicle itself, and the technical problems solved and the methods used to solve the problems are different from those of the present invention.
[0008] In summary, the technical problems solved by the present invention and the methods used to solve the problems are essentially different from the disclosed inventions. There is currently no invention in the art that provides a path search method based on GeoTiff graphs to solve navigation problems in scenarios within photovoltaic stations. Summary of the invention
[0009] The purpose of the present invention is to overcome the deficiencies of the prior art and provide a path navigation method within a photovoltaic station based on GeoTiff.
[0010] In order to solve the technical problem, the technical method of the present invention is: a path navigation method within a photovoltaic station based on GeoTiff, comprising the following steps:
[0011] S1. Obtain geographic information data, manually annotate, and produce GeoTiff map of photovoltaic station path layout;
[0012] S2, based on the GeoTiff map, using image processing technology and geographic coordinate system, extract its geographic information and store it in the configuration file, and convert it into a binary map with a black background and white routes;
[0013] S3. Determine the GPS coordinates of the personnel and equipment, i.e. the starting point and the end point, based on the terminal information of the inspection personnel and the alarm information of the abnormal equipment;
[0014] S4, according to the geographic information in S2, converting the GPS coordinates of the starting point and the end point into image coordinate information, and determining their positions in the binary map;
[0015] S5. Find the optimal path from the starting point to the end point through an image path search method, and record pixel coordinate sequence information on the path;
[0016] S6. According to the geographic information in S2, the pixel coordinate sequence of the optimal path is converted into a GPS coordinate sequence, and displayed on the terminal map.
[0017] Preferably, S1 specifically includes: obtaining high-resolution geographic information data from satellite images or drone aerial images, and producing a GeoTiff map of the photovoltaic station path layout by manual annotation.
[0018] Preferably, the manual marking specifically includes: combining the actual situation and user needs, manually marking the passable paths without safety hazards in the GIS software, and then exporting the marked path layer to generate a GeoTiff format file with geographic information.
[0019] Preferably, S2 is specifically as follows: using OpenCV to read the GeoTiff image, converting it into a binary map, with the marked path in white and the other parts in a black background, storing it as a .png format map, and recording the image width and height; using GDAL to read the key geographic information in the GeoTiff image, including the GPS coordinates of the upper left corner, ground resolution, and information about the location in the northern and southern hemispheres; finally, storing the read key geographic information in a configuration file, and storing it in the same path as the .png format map.
[0020] Preferably, S4 specifically includes: reading the configuration file stored in S2, converting the GPS coordinates of the starting point and the end point into pixel coordinates according to the ground resolution, determining the pixel coordinates of the starting point and the end point in the binary map, and the conversion relationship between GPS coordinates and pixel coordinates is as follows:
[0021]
[0022] Where:
[0023] pixel is the pixel coordinate;
[0024] GPS is the GPS coordinates;
[0025] GPS(upper left corner) is the GPS coordinate of the upper left corner.
[0026] Preferably, S5 is specifically as follows: after reading the binary map produced in S2, path retrieval is performed according to the pixel coordinates of the starting point and the end point in S4, and the nearest white points around the corresponding pixel coordinates of the starting point and the end point are searched respectively, that is, the points on the path closest to the starting point and the end point are searched, and the two points are recorded as A and B respectively, and the straight line coordinates from the starting point to its nearest white point are recorded as line a, and the straight line coordinates from the nearest white point of the end point to the end point are recorded as line b, that is, the task of navigating people to the nearest path and navigating from the path to the end point is completed, and the Dijkstra algorithm is used to search for the shortest path from point A to point B based on the white pixel points in the binary map, and each pixel along the line from A to B is recorded in the form of a pixel coordinate sequence, and this line is recorded as c, and the three segments of the line are merged in the order of acb, which is the optimal path pixel coordinate sequence from the starting point to the end point.
[0027] Preferably, the Dijkstra algorithm declares an array dis to save the shortest distance from the source point to each vertex and a set of vertices for which the shortest path has been found: T. Initially, the path weight of the origin s is assigned to 0, dis[s] = 0. If there is an edge (s, m) that can be directly reached for vertex s, dis[m] is set to w(s, m), and the path lengths of all other vertices are set to infinity. Initially, the set T has only vertex s, and then the minimum value is selected from the dis array. This value is the shortest path from the source point s to the vertex corresponding to the value, and the point is added to T to complete a vertex. Then, it is determined whether the newly added vertex can reach other vertices and whether the path length through the vertex to reach other points is shorter than that directly reaching the source point. If so, the values of these vertices in dis are replaced. Then, the minimum value is found from dis, and the above actions are repeated until all vertices of the binary map are included in T.
[0028] Preferably, the step S6 is specifically as follows: according to the ground resolution and the upper left corner GPS coordinates stored in S2, the pixel coordinate sequence of the traversed path is converted into a GPS coordinate sequence, and a navigation path with a starting point to an end point and a direction is directly determined to be displayed in the map software. The relationship between the pixel coordinates and the GPS coordinates is as follows:
[0029] GPS = (pixel*ground resolution) + GPS (upper left corner)
[0030] Where:
[0031] GPS is the GPS coordinates;
[0032] ppixel is the pixel coordinate;
[0033] GPS(upper left corner) is the GPS coordinate of the upper left corner.
[0034] Compared with the prior art, the advantages of the present invention are:
[0035] (1) The present invention discloses a path navigation method within a photovoltaic station based on GeoTiff. The method utilizes geographic information data and image processing technology within the photovoltaic station to realize intelligent navigation of paths within the photovoltaic station. By providing accurate navigation guidance, the work efficiency of the staff within the photovoltaic station can be greatly improved, and the operation and maintenance process of the photovoltaic power generation system can be optimized.
[0036] (2) The present invention firstly produces a GeoTiff map of the photovoltaic station path layout, and then uses image processing technology and geographic coordinate system to convert it into a binary map of a black background and a white route. Then, the GPS coordinates of the starting point and the end point are converted into pixel coordinate information. The optimal path from the starting point to the end point is found through the image path search method. In this way, navigation is more accurate and faster, and navigation of personnel to abnormal equipment is realized;
[0037] (3) The navigation method of the present invention has strong universality and is suitable for path navigation within photovoltaic stations, and is also suitable for path navigation in other scenarios. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 It is a flow chart of a path navigation method within a photovoltaic station based on GeoTif of the present invention;
[0039] Figure 2 The manually marked photovoltaic station road map in Example 1 of the present invention;
[0040] Figure 3 It is the black and white binary map in Embodiment 1 of the present invention;
[0041] Figure 4 It is the path search result graph in Embodiment 1 of the present invention, which is a complete route from the starting point to the end point composed of acb. DETAILED DESCRIPTION
[0042] The specific implementation mode of the present invention is described below in conjunction with embodiments:
[0043] It should be noted that the contents shown in the drawings of this specification are only used to cooperate with the principles, features and content descriptions disclosed in the specification for people familiar with this technology to understand and read, and are not used to limit the conditions under which the present invention can be implemented. Without affecting the effects and purposes that can be achieved by the present invention, they should still fall within the scope of the technical contents disclosed in the present invention.
[0044] It should be pointed out that, for those skilled in the art, several modifications and improvements can be made without departing from the concept of the present invention, such as changes in the format of the basic map, the reading method, the conversion method of geographic coordinates and pixel coordinates, etc., which all fall within the scope of protection of the present invention.
[0045] like Figure 1 As shown, in order to solve the navigation problem in a photovoltaic station in a targeted manner, combined with actual application conditions, the present invention discloses a path navigation method in a photovoltaic station based on GeoTif, comprising the following steps:
[0046] S1. Obtain geographic information data, manually annotate, and produce GeoTiff map of photovoltaic station path layout;
[0047] S2, based on the GeoTiff map, using image processing technology and geographic coordinate system, extract its geographic information and store it in the configuration file, and convert it into a binary map with a black background and white routes;
[0048] S3. Determine the GPS coordinates of the personnel and equipment, i.e. the starting point and the end point, based on the terminal information of the inspection personnel and the alarm information of the abnormal equipment;
[0049] S4, according to the geographic information in S2, converting the GPS coordinates of the starting point and the end point into image coordinate information, and determining their positions in the binary map;
[0050] S5. Find the optimal path from the starting point to the end point through an image path search method, and record pixel coordinate sequence information on the path;
[0051] S6. According to the geographic information in S2, the pixel coordinate sequence of the optimal path is converted into a GPS coordinate sequence, and displayed on the terminal map.
[0052] The S1-S2 belong to the mapping part, and S3-S6 belong to the navigation part.
[0053] Preferably, S1 specifically includes: obtaining high-resolution geographic information data from satellite images or drone aerial images, and producing a GeoTiff map of the photovoltaic station path layout by manual annotation.
[0054] High-resolution geographic information data is obtained from satellite images or drone aerial images. Taking into account the actual situation that the road structure of the photovoltaic station is simple and does not change for a long time, and in order to obtain a more accurate layout of the photovoltaic station, road network, etc., manual annotation is used in the early stage to produce the GeoTiff map of the path.
[0055] Preferably, the manual marking specifically includes: combining the actual situation and user needs, manually marking the passable paths without safety hazards in the GIS software, and then exporting the marked path layer to generate a GeoTiff format file with geographic information.
[0056] Generally, based on satellite maps, it is sufficient to roughly mark the path manually in GIS software (such as global_mapper14) without ensuring that the endpoints of each path are completely connected and overlapped. Export the marked path layer to generate a GeoTiff format file with geographic information.
[0057] Preferably, S2 is specifically as follows: using OpenCV to read the GeoTiff image, converting it into a binary map, with the marked path in white and the other parts in a black background, storing it as a .png format map, and recording the image width and height; using GDAL to read the key geographic information in the GeoTiff image, including the GPS coordinates of the upper left corner, ground resolution, and information about the location in the northern and southern hemispheres; finally, storing the read key geographic information in a configuration file, and storing it in the same path as the .png format map.
[0058] Preferably, if the map is in UTM format, the UTM coordinates of the upper left corner, the UTM zone and other information are read.
[0059] At this point, the mapping process in the present invention ends. For photovoltaic stations whose paths remain unchanged for a long time, the mapping process in the same area is generally only once. In subsequent navigation tasks, only the stored maps and configuration files corresponding to the personnel's location are read to complete the navigation process.
[0060] Preferably, S4 specifically includes: reading the configuration file stored in S2, converting the GPS coordinates of the starting point and the end point into pixel coordinates according to the ground resolution, determining the pixel coordinates of the starting point and the end point in the binary map, and the conversion relationship between GPS coordinates and pixel coordinates is as follows:
[0061]
[0062]
[0063] Where:
[0064] pixel is the pixel coordinate;
[0065] GPS is the GPS coordinates;
[0066] GPS(upper left corner) is the GPS coordinate of the upper left corner.
[0067] Preferably, S5 is specifically as follows: after reading the binary map produced in S2, path retrieval is performed according to the pixel coordinates of the starting point and the end point in S4, and the nearest white points around the corresponding pixel coordinates of the starting point and the end point are searched respectively, that is, the points on the path closest to the starting point and the end point are searched, and the two points are recorded as A and B respectively, and the straight line coordinates from the starting point to its nearest white point are recorded as line a, and the straight line coordinates from the nearest white point of the end point to the end point are recorded as line b, that is, the task of navigating people to the nearest path and navigating from the path to the end point is completed, and the Dijkstra algorithm is used to search for the shortest path from point A to point B based on the white pixel points in the binary map, and each pixel along the line from A to B is recorded in the form of a pixel coordinate sequence, and this line is recorded as c, and the three segments of the line are merged in the order of acb, which is the optimal path pixel coordinate sequence from the starting point to the end point.
[0068] Preferably, the Dijkstra algorithm adopts a greedy strategy, declaring an array dis to save the shortest distance from the source point to each vertex and a set of vertices for which the shortest path has been found: T. Initially, the path weight of the origin s is assigned to 0, dis[s] = 0. If there is an edge (s, m) that can be directly reached for vertex s, then dis[m] is set to w(s, m), and the path lengths of all other vertices are set to infinity. Initially, the set T has only vertex s, and then the minimum value is selected from the dis array, which is the shortest path from the source point s to the vertex corresponding to the value, and the point is added to T to complete a vertex. Then, it is determined whether the newly added vertex can reach other vertices and whether the path length through the vertex to reach other points is shorter than that directly reaching the source point. If so, the values of these vertices in dis are replaced. Then, the minimum value is found from dis, and the above actions are repeated until all vertices of the binary map are included in T.
[0069] Preferably, the step S6 is specifically as follows: according to the ground resolution and the upper left corner GPS coordinates stored in S2, the pixel coordinate sequence of the traversed path is converted into a GPS coordinate sequence, and a navigation path with a starting point to an end point and a direction is directly determined to be displayed in the map software. The relationship between the pixel coordinates and the GPS coordinates is as follows:
[0070] GPS = (pixel*ground resolution) + GPS (upper left corner)
[0071] Where:
[0072] GPS is the GPS coordinates;
[0073] ppixel is the pixel coordinate;
[0074] GPS(upper left corner) is the GPS coordinate of the upper left corner.
[0075] Example 1
[0076] like Figure 1 As shown, a path navigation method within a photovoltaic station based on GeoTif includes the following steps:
[0077] S1. We obtain high-resolution geographic information data from satellite images. Considering the simple structure of the roads in the photovoltaic station and the fact that they do not change for a long time, and in order to obtain a more accurate layout of the photovoltaic station and the road network, we use manual annotation to make GeoTiff maps of the photovoltaic station path layout, such as Figure 2 shown.
[0078] S2, based on GeoTiff, using image processing technology and geographic coordinate system, extract its geographic information and store it in the configuration file, and convert it into a binary map (.png) with a black background and white routes, such as Figure 3 shown.
[0079] S3. Determine the GPS coordinates of the personnel and equipment, i.e., the starting point and the end point, based on the terminal information of the inspection personnel and the alarm information of the abnormal equipment.
[0080] S4. According to the geographic information in S2, the coordinates of the starting point and the end point are converted into image coordinate information, and their positions are determined in the binary map.
[0081] S5. Find the optimal path from the starting point to the end point through an image path search method, and record pixel coordinate sequence information on the path.
[0082] S6. According to the geographic information in S2, the pixel coordinate sequence of the optimal path is converted into a GPS coordinate sequence, and displayed on the terminal map.
[0083] In this embodiment, in step S1, through manual marking, combined with actual conditions and user needs, the roads that are passable on site and have no safety hazards are marked.
[0084] like Figure 2 The figure shows a manually annotated photovoltaic station road map based on satellite maps. Without ensuring that the endpoints of each path are completely connected and overlapped, the GIS software (such as global _ Mapper14) can be used to roughly mark the path manually. Export the marked path layer to generate a GeoTiff format file with geographic information.
[0085] In this embodiment, in step S2, if Figure 3As shown, it is a black and white binary map. The GeoTiff image is read using OpenCV and converted into a binary map. The marked route is white, and the rest is a black background. It is stored in .png format and the image width and height are recorded.
[0086] Use GDAL to read the geographic information in GeoTiff, including the upper left corner GPS coordinates, ground resolution, and key information such as the northern and southern hemispheres.
[0087] The key map information read is saved in a configuration file, which is stored in the same path as the previous .png format map.
[0088] In this embodiment, the mapping phase of the photovoltaic station is completed. For photovoltaic stations whose paths remain unchanged for a long time, the mapping phase is generally only performed once. In subsequent navigation tasks, only the stored maps and configuration files corresponding to the location of the personnel are read to complete the navigation phase.
[0089] In this embodiment, in step S4, the configuration file stored in S2 is read, and the pixel coordinates of the starting point and the end point in the binary map are determined according to the ground resolution conversion. The GPS coordinates are converted to pixel coordinates as follows:
[0090]
[0091]
[0092] In this embodiment, in step S5, after reading the binary map produced in S2, a path search is performed according to the starting point and end point coordinates in S4.
[0093] Search for the nearest white point around the pixel coordinates corresponding to the starting point and the end point, that is, search for the point on the path closest to the starting point and the end point, record the two points as A and B, record the straight line coordinates from the starting point to its nearest white point, record it as line a (blue line), record the straight line coordinates from the nearest white point of the end point to the end point, record it as line b (yellow line). This completes the task of navigating people to the nearest path and navigating from the path to the end point.
[0094] Using the Dijkstra algorithm, based on the white pixels in the figure, search for the shortest path from point A to point B. Record each pixel along the line from A to B in the form of a pixel coordinate sequence, and record this line as c (green line).
[0095] Merge the three segments of the line in the order of acb to obtain the optimal path pixel coordinate sequence from the start point to the end point.
[0096] like Figure 4As shown in the figure, it is the path search result diagram, point A is the personnel location, point B is the photovoltaic equipment location, and each coordinate on acb is displayed, which is the final result of the path search.
[0097] The principle of the present invention is as follows:
[0098] like Figure 1 As shown, the present invention discloses a path navigation method in a photovoltaic station based on GeoTiff, the method comprising the following steps: obtaining geographic information data, manually annotating, and making a GeoTiff map of the path layout of the photovoltaic station; extracting its geographic information and storing it in a configuration file, and converting it into a binary map; determining the GPS coordinates of personnel and equipment, that is, the starting point and the end point, according to the terminal information of the inspection personnel and the alarm information of the abnormal equipment; according to the geographic information in S2, converting the coordinates of the starting point and the end point into image coordinate information (pixel coordinates), and determining its position in the binary map; finding the optimal path from the starting point to the end point through an image path search algorithm, and recording the pixel coordinate sequence information on the path; according to the geographic information in S2, converting the pixel coordinate sequence of the optimal path into a GPS coordinate sequence, and displaying it in the terminal map. The present invention utilizes high-resolution geographic information data and image processing technology to realize intelligent navigation of various paths in the photovoltaic station, provide accurate navigation guidance for staff, and optimize the operation and maintenance process of the photovoltaic power generation system.
[0099] The preferred embodiments of the present invention are described in detail above, but the present invention is not limited to the above embodiments. Various changes can be made within the knowledge of ordinary geologists in this field without departing from the purpose of the present invention.
[0100] Many other changes and modifications may be made without departing from the concept and scope of the present invention.It should be understood that the present invention is not limited to the specific embodiments, and the scope of the present invention is defined by the appended claims.
Claims
1. A path navigation method within a photovoltaic station based on GeoTiff, characterized in that: The following steps are involved: S1. Obtain geographic information data, manually annotate, and produce GeoTiff map of photovoltaic station path layout; S2, based on the GeoTiff map, using image processing technology and geographic coordinate system, extract its geographic information and store it in the configuration file, and convert it into a binary map with a black background and white routes; S3. Determine the GPS coordinates of the personnel and equipment, i.e. the starting point and the end point, based on the terminal information of the inspection personnel and the alarm information of the abnormal equipment; S4, according to the geographic information in S2, converting the GPS coordinates of the starting point and the end point into image coordinate information, and determining their positions in the binary map; S5. Find the optimal path from the starting point to the end point through an image path search method, and record pixel coordinate sequence information on the path; S6. According to the geographic information in S2, the pixel coordinate sequence of the optimal path is converted into a GPS coordinate sequence, and displayed on the terminal map.
2. A method for path navigation within a photovoltaic station based on GeoTiff according to claim 1, characterized in that: The S1 specifically includes: obtaining high-resolution geographic information data from satellite images or drone aerial images, and using manual annotation to produce a GeoTiff map of the photovoltaic station path layout.
3. A method for path navigation within a photovoltaic station based on GeoTiff according to claim 2, characterized in that: The manual marking specifically includes: combining the actual situation and user needs, manually marking the passable and potential safety hazard-free paths in the GIS software, and then exporting the marked path layer to generate a GeoTiff format file with geographic information.
4. The method for path navigation within a photovoltaic station based on GeoTiff according to claim 1, characterized in that: The S2 is specifically as follows: using OpenCV to read the GeoTiff image, converting it into a binary map, marking the path in white, the other parts in black background, storing it in .png format, and recording the image width and height; GDAL is used to read the key geographic information in the GeoTiff map, including the GPS coordinates of the upper left corner, ground resolution, and information about the northern and southern hemispheres. Finally, the key geographic information read is saved in a configuration file and stored in the same path as the .png format map.
5. A method for path navigation within a photovoltaic station based on GeoTiff according to claim 4, characterized in that: The S4 specifically includes: reading the configuration file stored in S2, converting the GPS coordinates of the starting point and the end point into pixel coordinates according to the ground resolution, and determining the pixel coordinates of the starting point and the end point in the binary map. The GPS coordinates are converted to pixel coordinates as follows: Where: pixel is the pixel coordinate; GPS is the GPS coordinates; GPS(upper left corner) is the GPS coordinate of the upper left corner.
6. A method for path navigation within a photovoltaic station based on GeoTiff according to claim 5, characterized in that: Specifically, S5 is as follows: after reading the binary map produced in S2, path retrieval is performed according to the pixel coordinates of the starting point and the end point in S4, and the nearest white points around the corresponding pixel coordinates of the starting point and the end point are searched respectively, that is, the points on the path closest to the starting point and the end point are searched, and the two points are recorded as A and B respectively, and the straight line coordinates from the starting point to its nearest white point are recorded as line a, and the straight line coordinates from the nearest white point of the end point to the end point are recorded as line b, that is, the task of navigating people to the nearest path and navigating from the path to the end point is completed, and the Dijkstra algorithm is used to search for the shortest path from point A to point B based on the white pixel points in the binary map, and each pixel along the line from A to B is recorded in the form of a pixel coordinate sequence, and this line is recorded as c, and the three segments of the line are merged in the order of acb, which is the optimal path pixel coordinate sequence from the starting point to the end point.
7. A method for path navigation within a photovoltaic station based on GeoTiff according to claim 6, characterized in that: The Dijkstra algorithm is to declare an array dis to save the shortest distance from the source point to each vertex and a set of vertices for which the shortest path has been found: T. Initially, the path weight of the origin s is assigned to 0, dis[s] = 0. If there is an edge (s, m) that can be directly reached for vertex s, then dis[m] is set to w(s, m), and the path lengths of all other vertices are set to infinity. Initially, the set T has only vertex s, and then the minimum value is selected from the dis array. This value is the shortest path from the source point s to the vertex corresponding to the value, and the point is added to T to complete a vertex. Then, it is determined whether the newly added vertex can reach other vertices and whether the path length through the vertex to reach other points is shorter than that directly reaching the source point. If so, the values of these vertices in dis are replaced. Then, the minimum value is found from dis, and the above actions are repeated until all vertices of the binary map are included in T.
8. The method for path navigation within a photovoltaic station based on GeoTiff according to claim 4, characterized in that: The step S6 is specifically as follows: according to the ground resolution and the upper left corner GPS coordinates stored in S2, the pixel coordinate sequence of the traversed path is converted into a GPS coordinate sequence, and a navigation path with a starting point to an end point and a direction is directly determined to be displayed in the map software. The relationship between the pixel coordinates and the GPS coordinates is as follows: GPS = (pixel*ground resolution) + GPS (upper left corner) Where: GPS is the GPS coordinates; pixel is the pixel coordinate; GPS(upper left corner) is the GPS coordinate of the upper left corner.
