Search

CN-117171595-B - Road generation method, device, equipment and storage medium

CN117171595BCN 117171595 BCN117171595 BCN 117171595BCN-117171595-B

Abstract

The disclosure provides a road generation method, a device, equipment and a storage medium, relates to the field of data processing, and particularly relates to the technical fields of electronic maps, cloud computing and big data. The method comprises the steps of obtaining position data to be processed, carrying out clustering analysis on the position data by adopting a clustering algorithm based on density to obtain a data cluster, obtaining longitude and latitude coordinates serving as boundary points in the data cluster to obtain a boundary point set, connecting the longitude and latitude coordinates in the boundary point set in sequence by adopting a boundary point discovery algorithm, and drawing a road map according to the boundary points with the connected boundary points. Through the scheme, development, operation and maintenance cost is saved, and flexibility and applicability of road generation are guaranteed.

Inventors

  • GUO XIAOKANG

Assignees

  • 阿波罗智联(北京)科技有限公司

Dates

Publication Date
20260512
Application Date
20230908

Claims (20)

  1. 1. A road generation method, comprising: Acquiring position data to be processed, wherein the position data comprises longitude and latitude coordinates of a plurality of vehicles; Performing cluster analysis on the position data by adopting a density-based clustering algorithm to obtain a data cluster, wherein the data cluster comprises a plurality of longitude and latitude coordinates meeting parameter conditions set by the clustering algorithm; Acquiring longitude and latitude coordinates serving as boundary points in the data cluster to obtain a boundary point set; Sequentially connecting longitude and latitude coordinates in the boundary point set by adopting a boundary point discovery algorithm, and drawing a road map according to the boundary points with the connected boundary points, wherein the boundary point discovery algorithm is an algorithm for boundary point screening according to a set range radius and an angle threshold; The adopting the boundary point discovery algorithm to connect the longitude and latitude coordinates in the boundary point set in turn comprises the following steps: selecting any boundary point from the boundary point set as a starting point; According to longitude and latitude coordinates of each boundary point in the boundary point set, acquiring a target boundary point closest to the starting point from the boundary point set, and connecting the target boundary point with the starting point to obtain a target line segment; And obtaining a boundary point with the smallest angle formed by the boundary point and the target line segment in the angle threshold range from the boundary point set in a circular range taking the target boundary point as the center and the range radius as the radius as a new target boundary point, connecting the target boundary point with the new target boundary point to obtain a new target line segment, and repeating the steps until all boundary points in the boundary point set are connected.
  2. 2. The method according to claim 1, wherein the obtaining, from the set of boundary points, a boundary point with the smallest angle formed by the boundary point segment within the angle threshold range as a new target boundary point, in a circular range with the target boundary point as a center and the range radius as a radius, includes: obtaining a boundary point with the smallest clockwise angle formed by the boundary point set and the target line segment within the angle threshold range from a circular range taking the target boundary point as a circle center and the range radius as a new target boundary point; Or alternatively And obtaining a boundary point with the minimum anticlockwise angle formed by the boundary point set and the target line segment within the angle threshold range from the circular range taking the target boundary point as the center and the range radius as the radius as a new target boundary point.
  3. 3. The method of any one of claims 1 to 2, further comprising: The range radius and the angle threshold are configured in response to an algorithm parameter configuration operation by a user.
  4. 4. The method according to claim 1, wherein if the boundary point sending algorithm further configures a path length threshold between boundary points, the obtaining, from the set of boundary points, a new target boundary point that is a circular range with the target boundary point as a center and the range radius as a radius, a boundary point that forms a minimum angle with the target line segment within the angle threshold range includes: and obtaining a boundary point which is smaller than the path length threshold value and has the smallest angle with the target line segment within the angle threshold value range from the boundary point set and is in a circular range taking the target boundary point as a circle center and the range radius as a radius, wherein the distance between the boundary point and the target boundary point is smaller than the path length threshold value, and the boundary point is formed as a new target boundary point.
  5. 5. The method according to claim 4, wherein obtaining, from the set of boundary points, a boundary point having a distance from the target boundary point smaller than the path length threshold and having a smallest angle with the target line segment within the angle threshold range, as a new target boundary point, from a circular range having the target boundary point as a center and the range radius as a radius, comprises: Obtaining a boundary point which is smaller than the path length threshold value and has the smallest clockwise angle formed by the boundary point set and the target line segment within the angle threshold value range from the boundary point set and takes the target boundary point as a circle center and the range radius as a radius, wherein the boundary point is the new target boundary point; Or alternatively And obtaining a boundary point which is smaller than the path length threshold value and has the smallest anticlockwise angle with the target line segment within the angle threshold value range from the boundary point set and is in a circular range taking the target boundary point as a circle center and the range radius as a radius, wherein the boundary point is formed by the boundary point with the minimum distance from the target boundary point and the target line segment within the angle threshold value range.
  6. 6. The method of claim 4 or 5, the method further comprising: The range radius, the angle threshold, and the path length threshold are configured in response to an algorithm parameter configuration operation by a user.
  7. 7. The method according to any one of claims 1to 2, wherein the clustering analysis of the location data using a density-based clustering algorithm to obtain clusters of data comprises: and inputting longitude and latitude coordinates in the position data into a DBSCAN algorithm which is preconfigured with the radius around each point and the minimum point around each point to perform cluster analysis, so as to obtain the data cluster comprising the core point, the boundary point and the noise point.
  8. 8. The method of claim 7, the method further comprising: performing format conversion processing on the position data according to the input data format corresponding to the DBSCAN algorithm to obtain processed position data; Correspondingly, inputting longitude and latitude coordinates in the position data into a DBSCAN algorithm which is preconfigured with the radius around each point and the minimum point around each point for cluster analysis, and the method comprises the following steps: And inputting longitude and latitude coordinates in the processed position data into the DBSCAN algorithm which is preconfigured with the radius around each point and the minimum point number around each point to perform cluster analysis.
  9. 9. The method according to any one of claims 1 to 2, wherein the acquiring position data to be processed comprises: receiving position information of vehicles reported by a plurality of vehicles and/or vehicle-mounted equipment to obtain a vehicle position set, wherein the position information of each vehicle comprises longitude and latitude coordinates of the vehicle; And cleaning the abnormal data in the vehicle position set to obtain the position data to be processed.
  10. 10. A road generating device, comprising: the first acquisition unit is used for acquiring position data to be processed, wherein the position data comprises longitude and latitude coordinates of a plurality of vehicles; the analysis unit is used for carrying out cluster analysis on the position data by adopting a density-based clustering algorithm to obtain a data cluster, wherein the data cluster comprises a plurality of longitude and latitude coordinates meeting parameter conditions set by the clustering algorithm; the second acquisition unit is used for acquiring longitude and latitude coordinates serving as boundary points in the data cluster to obtain a boundary point set; the connecting unit is used for sequentially connecting longitude and latitude coordinates in the boundary point set by adopting a boundary point discovery algorithm, and drawing a road map according to the boundary points after connection, wherein the boundary point discovery algorithm is an algorithm for boundary point screening according to a set range radius and an angle threshold; Wherein, the connection unit includes: A selecting module, configured to select any boundary point from the set of boundary points as a starting point; The first acquisition module is used for acquiring a target boundary point closest to the starting point from the boundary point set according to longitude and latitude coordinates of each boundary point in the boundary point set, and connecting the target boundary point with the starting point to obtain a target line segment; And the second acquisition module is used for acquiring a boundary point with the smallest angle formed by the boundary point and the target line segment in the angle threshold range from the circular range taking the target boundary point as the circle center and the range radius as the radius as a new target boundary point, connecting the target boundary point with the new target boundary point to obtain a new target line segment, and repeating the step until all the boundary points in the boundary point set are connected.
  11. 11. The apparatus of claim 10, the second acquisition module comprising: The first acquisition submodule is used for acquiring a boundary point with the smallest clockwise angle formed by the boundary point set and the target line segment in the angle threshold range from the circular range taking the target boundary point as the circle center and the range radius as the radius as a new target boundary point; Or alternatively And the second acquisition submodule is used for acquiring a boundary point with the minimum anticlockwise angle formed by the boundary point and the target line segment in the angle threshold range from the boundary point set in a circular range taking the target boundary point as the circle center and the range radius as the radius as a new target boundary point.
  12. 12. The apparatus according to any one of claims 10 to 11, wherein the apparatus further comprises: and the first configuration unit is used for responding to the algorithm parameter configuration operation of the user and configuring the range radius and the angle threshold.
  13. 13. The apparatus of claim 10, wherein the second obtaining module, if a path length threshold between boundary points is further configured in the boundary point discovery algorithm, comprises: And the third acquisition submodule is used for acquiring a boundary point which is smaller than the path length threshold value and has the smallest angle with the target line segment within the angle threshold value range from the boundary point set and is in a circular range which takes the target boundary point as a circle center and the range radius as a radius, and the boundary point is taken as a new target boundary point.
  14. 14. The apparatus of claim 13, wherein the third acquisition sub-module is specifically configured to: And obtaining a boundary point with a minimum clockwise angle formed by the boundary point and the target line segment within the angle threshold range from the boundary point set within a circular range with the target boundary point as a circle center and the range radius as a radius, wherein the distance between the boundary point and the target boundary point is smaller than the path length threshold value, and the boundary point with the minimum clockwise angle formed by the boundary point and the target line segment within the angle threshold value range is taken as a new target boundary point, or obtaining a boundary point with a minimum anticlockwise angle formed by the boundary point and the target line segment within the angle threshold value range from the boundary point set within a circular range with the target boundary point as a circle center and the range radius as a radius, and the boundary point with the distance between the boundary point and the target boundary point is smaller than the path length threshold value.
  15. 15. The apparatus according to claim 13 or 14, wherein the apparatus further comprises: And the second configuration unit is used for responding to the algorithm parameter configuration operation of the user and configuring the range radius, the angle threshold and the path length threshold.
  16. 16. The apparatus according to any one of claims 10 to 11, wherein the analysis unit comprises: And the cluster analysis module is used for inputting longitude and latitude coordinates in the position data into a DBSCAN algorithm which is preconfigured with the radius around each point and the minimum point around each point to perform cluster analysis, so as to obtain the data cluster comprising the core point, the boundary point and the noise point.
  17. 17. The apparatus of claim 16, wherein the analysis unit further comprises: The format conversion module is used for carrying out format conversion processing on the position data according to the input data format corresponding to the DBSCAN algorithm to obtain the processed position data; correspondingly, the cluster analysis module is specifically configured to: And the cluster analysis sub-module is used for inputting longitude and latitude coordinates in the processed position data into the DBSCAN algorithm which is preconfigured with the radius around each point and the minimum point around each point to perform cluster analysis.
  18. 18. The apparatus according to any one of claims 10 to 11, wherein the first acquisition unit comprises: The receiving module is used for receiving the position information of the vehicles reported by the vehicles and/or the vehicle-mounted equipment to obtain a vehicle position set, and the position information of each vehicle comprises longitude and latitude coordinates of the vehicle; And the cleaning processing module is used for cleaning the abnormal data in the vehicle position set to obtain the position data to be processed.
  19. 19. An electronic device, comprising: at least one processor, and A memory communicatively coupled to the at least one processor, wherein, The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-9.
  20. 20. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-9.

Description

Road generation method, device, equipment and storage medium Technical Field The disclosure relates to electronic maps, cloud computing, big data technology in the field of data processing, and in particular relates to a road generation method, a device, equipment and a storage medium. Background Electronic maps, i.e., digital maps, are maps that are stored and referred to digitally using computer technology. The electronic map may serve as a carrier of information to provide data information to the user. At present, an electronic map becomes a necessary means for people to know life, so that the needs of people on the precision and accuracy of the electronic map are also higher and higher, and the electronic map is usually drawn by manually acquiring area information. However, manually acquiring the area information through the third party tool may result in a higher cost of drawing the map road. Disclosure of Invention The disclosure provides a road generation method, a device, equipment and a storage medium for map drawing. According to a first aspect of the present disclosure, there is provided a road generation method including: Acquiring position data to be processed, wherein the position data comprises longitude and latitude coordinates of a plurality of vehicles; Performing cluster analysis on the position data by adopting a density-based clustering algorithm to obtain a data cluster, wherein the data cluster comprises a plurality of longitude and latitude coordinates meeting parameter conditions set by the clustering algorithm; Acquiring longitude and latitude coordinates serving as boundary points in the data cluster to obtain a boundary point set; And sequentially connecting longitude and latitude coordinates in the boundary point set by adopting a boundary point discovery algorithm, and drawing a road map according to the boundary points after connection, wherein the boundary point algorithm is an algorithm for filtering boundary points according to the set range radius and the angle threshold. According to a second aspect of the present disclosure, there is provided a road generating apparatus including: the first acquisition unit is used for acquiring position data to be processed, wherein the position data comprises longitude and latitude coordinates of a plurality of vehicles; the analysis unit is used for carrying out cluster analysis on the position data by adopting a density-based clustering algorithm to obtain a data cluster, wherein the data cluster comprises a plurality of longitude and latitude coordinates meeting parameter conditions set by the clustering algorithm; the second acquisition unit is used for acquiring longitude and latitude coordinates serving as boundary points in the data cluster to obtain a boundary point set; and the connecting unit is used for sequentially connecting longitude and latitude coordinates in the boundary point set by adopting a boundary point algorithm and drawing a road map according to the boundary points after connection, wherein the boundary point algorithm is an algorithm for filtering boundary points according to the set range radius and the angle threshold. According to a third aspect of the present disclosure, there is provided an electronic device comprising: at least one processor, and A memory communicatively coupled to the at least one processor, wherein, The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect. According to a fourth aspect of the present disclosure, there is provided a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of the first aspect. According to a fifth aspect of the present disclosure there is provided a computer program product comprising a computer program stored in a readable storage medium, the computer program being readable from the readable storage medium by at least one processor of an electronic device, the at least one processor executing the computer program causing the electronic device to perform the method of the first aspect. The technology according to the disclosure solves the problem of high map road drawing cost. The acquired position data is subjected to clustering analysis through a clustering algorithm based on density to obtain a data cluster, longitude and latitude coordinates of boundary points in the data cluster are connected through a boundary point discovery algorithm, so that the drawing of a road is realized, the position data is analyzed through the algorithm, the dependence on a data processing tool is eliminated, and the drawing cost is further reduced. It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will be