Site selection method, apparatus, device, storage medium and computer program product

Abstract

The method, device, equipment, storage medium and computer program product for site selection are provided. In the scheme, first, a set of candidate stations is obtained based on a planning area and a high-precision map. Then, inter-station analysis is performed on each candidate station in the set of candidate stations, and a set of target stations is determined based on the analysis result. The inter-station analysis includes station reduction analysis and / or station addition analysis. The station reduction analysis is related to inter-station distance, and the station addition analysis is related to station attributes. In this way, the rationality of the station site structure can be improved to a certain extent, the interference between station sites can be reduced, the site selection efficiency can be improved, and the site selection cost can be reduced.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of communication, and particularly relates to a site selection method, device, equipment, storage medium and computer program product. BACKGROUND

[0002] Base station site selection is an important part of network planning and network optimization, and in related technologies, it is generally realized in an artificial site selection manner. That is, a specified location is manually selected for new station construction based on the experience of network planning and optimization personnel.

[0003] Artificial site selection has a high requirement for the experience of network planning and optimization personnel, and the network planning and optimization personnel are limited in energy and time, so artificial site selection is time-consuming and labor-intensive. More importantly, after the base station is built, the coverage effects will affect each other, and artificial site selection often cannot timely and comprehensively judge the effect after site selection, and the station has a risk of interference. SUMMARY

[0004] The present disclosure provides a site selection method, device, equipment, storage medium and computer program product to improve the rationality of station site structure to a certain extent, reduce the interference between station sites, improve the site selection efficiency, and reduce the site selection cost.

[0005] In a first aspect, the present disclosure provides a site selection method, comprising:

[0006] obtaining a set of candidate stations based on a planning area and a high-precision map;

[0007] performing inter-station analysis on each candidate station in the set of candidate stations, and determining a set of target stations based on an analysis result;

[0008] The inter-station analysis comprises station reduction analysis and / or station addition analysis, wherein the station reduction analysis is related to inter-station distance, and the station addition analysis is related to station attributes.

[0009] In a second aspect, the present disclosure provides a site selection device, comprising:

[0010] an obtaining unit configured to obtain a set of candidate stations based on a planning area and a high-precision map;

[0011] an analysis unit configured to perform inter-station analysis on each candidate station in the set of candidate stations, and determine a set of target stations based on an analysis result;

[0012] The inter-station analysis comprises station reduction analysis and / or station addition analysis, wherein the station reduction analysis is related to inter-station distance, and the station addition analysis is related to station attributes.

[0013] In a third aspect, the present disclosure provides an electronic device, comprising: a memory configured to store computer readable instructions; and a processor configured to execute the computer readable instructions, so that the electronic device performs the method according to any one of the embodiments of the first aspect.

[0014] In a fourth aspect, the present disclosure provides a non-transitory computer readable storage medium configured to store computer readable instructions, which, when executed by a processor, cause the processor to perform the method according to any one of the embodiments of the first aspect.

[0015] In a fifth aspect, the present disclosure provides a computer program product comprising a computer program, which, when executed by a processor, implements the method according to any one of the embodiments of the first aspect.

[0016] The present disclosure provides a site selection method, device, equipment, storage medium and computer program product. The present disclosure obtains existing sites through a planning area and obtains built sites through a high-precision map. Thus, the obtained candidate site set includes both existing sites and built sites. Furthermore, the present disclosure further performs site-to-site analysis on these sites, deletes and reduces sites in the candidate site set based on site-to-site distance, and adds appropriate sites in the candidate site set based on site attributes. Based on at least one of the site-to-site analysis, the site-to-site interference risk is reduced as much as possible based on the site-to-site distance and / or the site attributes, and the site-to-site interference risk in the prior art manual site selection is avoided. In addition, the present disclosure can realize automatic site selection based on the planning area and the high-precision map. Compared with the manual site selection scheme, the present disclosure has higher efficiency, lower cost and better site selection effect.

[0017] It is to be understood that both the foregoing general description and the following detailed description are exemplary, and are intended to provide further explanation of the subject technology. BRIEF DESCRIPTION OF DRAWINGS

[0018] The above and other objects, features and advantages of the present disclosure will become more apparent from the following detailed description taken in conjunction with the accompanying drawings, in which like reference characters refer to like elements in the several views. The accompanying drawings are used to provide further understanding of the present disclosure, and constitute a part of the specification, together with the present disclosure, serve to explain the present disclosure, and do not constitute a limitation on the present disclosure. In the drawings, the same reference numerals generally refer to the same parts or steps.

[0019] Figure 1 A flowchart of a site selection method provided by an embodiment of the present disclosure;

[0020] Figure 2 A schematic diagram of obtaining a candidate site set provided by the present disclosure;

[0021] Figure 3A schematic diagram of a high-precision map in which a content marked by a grid is provided in the present disclosure;

[0022] Figure 4 A schematic diagram of a station reduction analysis process provided in the present disclosure;

[0023] Figure 5 A schematic diagram of a station reduction analysis process based on a minimum station spacing provided in the present disclosure;

[0024] Figure 6 A schematic diagram of a station reduction analysis process based on an average station spacing provided in the present disclosure;

[0025] Figure 7 A schematic diagram of a station addition analysis process provided in the present disclosure;

[0026] Figure 8 A schematic diagram of a station addition analysis process provided in the present disclosure;

[0027] Figure 9 A structural block diagram of a site selection device provided in an embodiment of the present disclosure;

[0028] Figure 10 A hardware block diagram of an electronic device provided in an embodiment of the present disclosure;

[0029] Figure 11 A schematic diagram of a computer-readable storage medium provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0030] In order to make the objectives, technical solutions and advantages of the present disclosure more apparent, the following will describe example embodiments according to the present disclosure in detail with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments of the present disclosure, and it should be understood that the present disclosure is not limited by the example embodiments described herein.

[0031] The present disclosure provides a site selection scheme, which can be applied to any site selection scenario. For example, it can be applied to at least one of a base station site selection, a server site selection, a building site selection, a town and country planning site selection, and the like, without being exhaustive.

[0032] As described in the background, the existing site selection scheme is generally implemented based on manual site selection. Manual site selection has many problems, such as excessive dependence on human experience, and manual selection often cannot timely and comprehensively judge the interference between site locations, and the like. Moreover, manual site selection has a high cost and takes a long time.

[0033] Based on the foregoing problems, the present disclosure provides a design concept of a site selection scheme: by reasonably utilizing the information in the planning area and the high-precision map, and by performing simple and process-based processing on the information, in the process, the existing sites and the newly-built sites are comprehensively analyzed, and reasonable site reduction and / or site addition are performed based on the actual situation between the candidate sites, so as to obtain a target site set that meets the actual situation. The following is a specific description.

[0034] The present disclosure provides a site selection method, please refer to Figure 1 , Figure 1 A flowchart of a site selection method provided by an embodiment of the present disclosure. As shown in the figure, the method comprises the following steps: Figure 1

[0035] S102, based on the planning area and the high-precision map, obtaining a candidate site set.

[0036] Specifically, the planning area is the site coverage range based on the automatic site selection of the present disclosure. The planning area can be determined by the actual situation, and the present disclosure does not have special restrictions on the range of the planning area. For example, a country, a province, a city, a region, or any custom region can be used as a planning area to implement the present scheme. The technical scheme provided by the present disclosure can realize wide-area site selection.

[0037] The high-precision map contains building and ground features, based on which, the building and ground features in the high-precision map can be analyzed to screen out newly-built sites in the planning area that can meet the site structure. The present disclosure does not have special restrictions on the accuracy of the high-precision map. The high-precision map has building and ground features, which can implement the present scheme. In actual scenarios, the higher the accuracy, the more accurate. For example, a 5-meter-precision high-precision Planet electronic map can be used in actual scenarios, or other higher-precision electronic maps can be used, which are not described in detail.

[0038] Based on the planning area and the high-precision map, on the one hand, the existing sites in the planning area can be obtained based on the planning area, and on the other hand, the newly-built sites in the planning area can be obtained in combination with the planning area and the high-precision map. In this way, a more comprehensive candidate site set can be obtained. In other words, the candidate site set involved in the present disclosure can include but is not limited to at least one of the existing sites and the newly-built sites, and the candidate site set obtained by comprehensively considering both is a more preferred implementation manner.

[0039] ​It should be understood that in the actual implementation scenario, in this step, especially in the process of obtaining new sites determined based on the high-precision map, the process of site determination and screening is also involved to screen new sites that meet the site structure. The site structure is generally included in the site selection parameter (which can also be referred to as the site construction requirement), and the site selection parameter is generally determined by the user to limit the range of the address selected by the automatic site selection scheme.

[0040] Specifically, the site selection parameter involved in the present disclosure can include but is not limited to at least one of the following: frequency band type, site structure, inter-station distance, etc. Among them, the frequency band type is generally used to limit the frequency band type of the site to be built by the automatic site selection scheme, and is generally represented in the form of a target frequency band type. The site structure is used to limit the site structure characteristics of the new site, and is used to screen the selected sites that meet the requirements in the high-precision map. Exemplarily, it can include but is not limited to at least one of the following: height requirement, distance requirement, type requirement, etc. Further, the height requirement can include but is not limited to at least one of the following: ultra-low altitude (ULA), super elevation (S), building height difference (H_d); the distance requirement can include but is not limited to at least one of the following: ultraclose range (UCR), ultra long range (ULR), etc. And the inter-station distance is used to limit the range of the inter-station distance, which can generally include but is not limited to at least one of the following: minimum station spacing (Min_S), maximum station spacing (Max_S).

[0041] In this step, without complex calculation of all site selection parameters, only positions that can meet the site structure in the site selection parameter in the high-precision map are selected as new sites.

[0042] S104, performing inter-site analysis on each of the selected sites in the selected site set, and determining a target site set based on the analysis result; wherein the inter-site analysis includes: site reduction analysis and / or site addition analysis, wherein the site reduction analysis is related to the inter-station distance, and the site addition analysis is related to the site attribute.

[0043] The set of candidate stations determined based on S102 has already determined new sites and existing sites that can meet the site construction requirements. In other words, the candidate stations in the set of candidate stations can all meet the site structure in the site selection parameters. However, there may still be interference between these candidate stations, and there may be local gaps caused by excessively long station spacing. For this reason, the present disclosure further performs an inter-site analysis on each candidate station in the set of candidate stations based on at least one of the station spacing and site attributes in the site selection parameters, thereby being able to perform a site reduction analysis based on the station spacing between the candidate stations, and / or, being able to perform a site addition analysis based on the site attributes, and further determining the final target station set based on the inter-site analysis results.

[0044] In this way, the target site set determined in S104 fully considers the mutual influence between the candidate sites, which can reduce interference between sites to a certain extent and avoid gaps between sites to a certain extent, making it more conducive to comprehensive site selection analysis. Furthermore, the data source of this solution is only high-precision maps, and there are no special restrictions on high-precision maps, making it applicable to a wide range of areas. Compared with manual site selection, this automatic site selection method is more efficient, less costly, and has better site selection results.

[0045] The following, combined Figure 2 The implementation method of obtaining the set of stations to be selected in the present disclosure is described. Figure 2 A schematic diagram of obtaining a set of candidate stations provided by the present disclosure is shown as follows: Figure 2 As shown, the candidate station set involved in this disclosure is a set of candidate sites. The candidate station set may include, but is not limited to, at least one of the following: a mandatory station set, a co-located station set, a rooftop station set, and a ground station set. In other words, the candidate sites may include, but are not limited to, at least one of mandatory stations, co-located stations, rooftop stations, and ground stations.

[0046] A mandatory site is an existing site in the planned area, and its frequency band is the same as the target frequency band. The target frequency band refers to the frequency band required for this site selection. This information is generally included in the site construction requirements. The target frequency band can be customized and is not specifically limited in this disclosure.

[0047] Based on this, when the set of candidate stations is obtained based on the planning area and the high-precision map, it can be realized by screening the same-frequency station addresses in the area. Specifically, first, the existing station addresses in the planning area are obtained, and then, based on the target frequency band standard, the existing station addresses in the planning area are screened to obtain the selected stations in the existing station addresses, that is, the set of selected stations. In specific implementation, based on the target frequency band standard contained in the site selection parameter, the work parameter data of each existing station in the planning area is screened to obtain the work parameter containing the target frequency band standard, and the station belonging to it constitutes the set of selected stations. The set of selected stations can be represented in any form such as a list or a data set. As shown in Figure 2 , based on the screening step, the selected station list can be obtained.

[0048] Among them, the co-sited station refers to the existing station in the planning area. These existing stations are "co-sited" with the planning area. Therefore, when the set of candidate stations is obtained based on the planning area and the high-precision map, it can include the following way: obtaining each existing station address in the planning area to obtain the set of co-sited stations. It should be understood that the co-sited station and the selected station have an intersection, and the co-sited station can also contain an existing station that is inconsistent with the target frequency band standard. Therefore, the co-sited station is actually equivalent to a kind of candidate station, which needs to be combined with the subsequent processing of S104 to determine the final target station set. Therefore, as shown in Figure 2 , after reading the existing station addresses in the planning area, the co-sited station candidate list can be obtained.

[0049] Among them, the roof station is a station set at the top of the building (such as the roof). It should be noted that there can be various types of candidate stations in the existing station, which can be a roof station or a ground station. Therefore, the roof station contained in the candidate set in the present disclosure can be a newly built station newly confirmed based on the high-precision map, or a roof station in the existing station.

[0050] Based on this, when the set of candidate stations is obtained based on the planning area and the high-precision map, it can include the following way: reading the high-precision map and obtaining the buildings in the high-precision map, screening the buildings and determining the building optional points to obtain the set of roof stations. As an example, as shown in Figure 2 , based on this process, the roof station candidate list can be obtained.

[0051] Among them, the ground station is a station set on the ground, which can also be called a pole station or a tower station. Similar to the roof station, the ground station contained in the candidate set in the present disclosure can be a newly built station newly confirmed based on the high-precision map, or a ground station in the existing station.

[0052] Based on this, when the candidate station set is obtained based on the planning area and the high-precision map, the following methods can be included: reading the high-precision map and obtaining the ground selectable points in the high-precision map, screening the ground selectable points, and obtaining the ground station set. As shown in Figure 2 Based on the area map in the high-precision map, the pole station to be built point can be screened out, so that the pole station candidate list can also be obtained.

[0053] As shown in Figure 2 The above-mentioned co-site station candidate list, roof station candidate list, and pole station candidate list jointly constitute the candidate station list. The candidate station list and the mandatory station list are the candidate station set shown in S102 of the present disclosure. The candidate station set (i.e., the candidate station list and the mandatory station list) needs to be further subjected to the inter-site analysis shown in S104 to obtain the final site selection result, i.e., the target station set. Figure 3 The inter-site analysis process shown includes inter-site distance calculation and rapid site selection. It should be understood that this is a feasible implementation manner, which will be specifically described below.

[0054] In summary, in the present disclosure, the step of obtaining the candidate station set based on the planning area and the high-precision map in S102 can include at least one of the following methods:

[0055] Obtaining each existing station in the planning area to obtain the co-site station set;

[0056] Based on the target frequency band standard, screening the existing station in the planning area to obtain the mandatory station set;

[0057] Reading the high-precision map and obtaining the buildings in the high-precision map, screening the buildings and determining the building selectable points to obtain the roof station set;

[0058] Reading the high-precision map and obtaining the ground selectable points in the high-precision map, screening the ground selectable points to obtain the ground station set.

[0059] Hereinafter, the implementation manner of obtaining the roof station set and the ground station set will be specifically described.

[0060] In an exemplary embodiment, the manner of obtaining the roof station set based on the planning area and the high-precision map can include the following steps:

[0061] 1) Read the high-precision map to obtain the buildings in the planning area. 2) Delete the ultra-low buildings. Specifically, traverse the buildings, and delete the buildings with a height lower than a preset first height threshold (e.g., ULA). 3) The low buildings next to the ultra-high buildings can also be deleted. Specifically, filter the buildings with a height greater than a preset second height threshold (e.g., S), obtain the height difference between each of the buildings and each adjacent building within a preset range (any custom range of a preset shape, such as a range within a radius of 50 meters) of the building, and delete the adjacent buildings with a height difference less than a preset third height threshold (e.g., H_d and multiples thereof). 4) The buildings close to the target location (e.g., the nearest existing network base station) can also be deleted based on a distance condition. Specifically, obtain the distance between each building and the target location, and delete the buildings with a distance less than a preset first distance threshold (e.g., UCR). 5) Based on the filtering in at least one of steps 2) to 4) above, determine the specific location of the rooftop station, which can be specifically represented as latitude and longitude. For example, the specific location of the rooftop station can be the edge position of the building closer to the center of the planning area. Specifically, obtain the line between the center point of the building and the center point of the planning area, obtain the intersection point of the line and the outline of the building, and determine the latitude and longitude of the intersection point as the latitude and longitude of the rooftop station. In actual scenarios, if there are multiple intersection points, the intersection point closer to the center point of the planning area is determined as the location of the rooftop station. In addition, the height of the rooftop station can be determined as the height of the building + a preset value, where the preset value can be determined as desired, such as 2 meters.

[0062] In an exemplary embodiment, based on the planning area and the high-precision map, the way to obtain the set of rooftop stations can include the following steps:

[0063] 1) Read the high-precision map to obtain the labels of each grid in the planning area. 2) Delete the non-ground grids. Specifically, delete the grids labeled as water, sea, wet land, building, etc. In addition, refer to Figure 3 , delete the grids labeled with various objects in Figure 3 . Among them, Figure 4A schematic diagram of the marked content in the high-precision map provided by the present disclosure is shown in FIG. 3. 3) Delete the ultra-close grid to avoid the impact of the close distance station. For example, the grid close to the target location (e.g., the nearest existing network base station) can be deleted. Specifically, the distance between each building and the target location can be obtained, and the grid with a distance less than a preset first distance threshold (e.g., UCR) can be deleted. 4) Cluster the grid. Specifically, the grid clustering is performed according to a preset clustering specification (e.g., UCR*UCR, which represents multiplication), so that the number of effective grids after clustering is greater than 50% of the total number of grids. Based on the processing of at least one of steps 2) to 4) described above, the final effective grid can be obtained, and each effective grid is a ground station. The latitude and longitude of the effective grid are taken as the latitude and longitude of the ground station, and thus the ground station set is obtained.

[0064] As described above, the present disclosure can automatically obtain the candidate station set based on the preset planning area, the site selection parameter, and the high-precision map. Then, the site-to-site analysis needs to be performed on each candidate station in the candidate station set to determine the final target station set. Details are described below.

[0065] As described above, the site-to-site analysis involved in the present disclosure can include station deletion analysis and / or station addition analysis. The station deletion analysis refers to deleting the candidate stations in the candidate station set based on the site-to-site relationship (which can include but is not limited to the station spacing) to realize the station deletion of the candidate station set. The station addition analysis refers to adding appropriate stations in the candidate station set based on the site attribute information to realize the station addition of the candidate station set. In actual implementation scenarios, the site-to-site analysis process can only include the station deletion analysis or the station addition analysis, or both. In the specific implementation process, when both the station deletion analysis and the station addition analysis are performed, the execution timing of the two has no particular limitation. For example, the station deletion analysis can be performed first, and then the station addition analysis can be performed. Conversely, the station addition analysis can be performed first, and then the station deletion analysis can be performed.

[0066] Further, the station spacing generally includes the minimum station spacing and the average station spacing. Therefore, the station deletion analysis in the present disclosure can include two types: the station deletion analysis based on the minimum station spacing and the station deletion analysis based on the average station spacing. In actual implementation scenarios, the site-to-site analysis process can only include one type of station deletion analysis, or both types of station deletion analysis. When the station deletion analysis includes the station deletion analysis based on the minimum station spacing and the station deletion analysis based on the average station spacing, the station deletion analysis based on the minimum station spacing can be performed first, and then the station deletion analysis based on the average station spacing can be performed.

[0067] In an exemplary embodiment, when the site-to-site analysis process includes both types of station deletion analysis and station addition analysis, the station deletion analysis based on the minimum station spacing can be performed first, then the station deletion analysis based on the average station spacing can be performed, and finally the station addition analysis can be performed.

[0068] The following describes an embodiment of the inter-station analysis.

[0069] Referring to Figure 4 , Figure 4 A flowchart of an inter-station analysis is provided in the present disclosure. As shown in Figure 5 , when the inter-station analysis is a reduction analysis, the following steps S402-S406 can be executed in a loop until there is no station to be deleted, to obtain a target station set, when performing the inter-station analysis on each candidate station in a candidate station set:

[0070] S402, obtaining the minimum station spacing and / or the average station spacing of each candidate station in the candidate station set.

[0071] The station spacing is generally used to represent the distance between stations. In the present disclosure, when performing this step, the minimum station spacing and the average station spacing corresponding to each candidate station in the candidate station set need to be obtained. Specifically, the station spacing can represent the relationship between the candidate station and its adjacent stations.

[0072] Thus, in a possible embodiment, for any candidate station in the candidate station set, the station spacing between the candidate station and its adjacent stations is obtained based on a preset adjacent relationship. Thus, the minimum station spacing can be obtained by obtaining the minimum value in the station spacing, and / or the average station spacing can be obtained by obtaining the average value in the station spacing.

[0073] Specifically, the adjacent stations are determined based on a preset adjacent relationship. The adjacent relationship can be set in various ways. For example, the adjacent relationship can be represented by a preset range, in which case all stations within the preset range of the candidate station can be obtained as the adjacent stations of the candidate station in the foregoing flow. For another example, the adjacent relationship can be represented by whether a preset relationship is satisfied.

[0074] In an exemplary embodiment, the adjacency relationship can include, but is not limited to, a Delaunay triangle relationship. In this case, a candidate site that satisfies the Delaunay triangle relationship with a selected site can be identified as an adjacent site of the selected site. In this case, the distance between each candidate site and an adjacent site can also be calculated based on the Delaunay triangle algorithm. The Delaunay triangle is a collection of connected but non-overlapping triangles, and the circumcircle of these triangles does not contain any other points in the domain. The Delaunay triangle has two unique properties: on the one hand, the circumcircle of each Delaunay triangle does not contain any other points in the domain, which is called the empty circumcircle property of the Delaunay triangle, and this feature has been used as a criterion for creating Delaunay triangles; on the other hand, the maximum and minimum angle property of the Delaunay triangle: the minimum angle of the six internal angles of the convex quadrilateral formed by two adjacent triangles does not increase after mutual exchange of the diagonal lines.

[0075] It should be noted that the adjacent sites determined based on the adjacency relationship can be candidate sites in the candidate site set, or other sites outside the candidate site set.

[0076] S404, determining a site to be deleted based on the minimum inter-site distance of each candidate site and a first preset threshold value; and / or, determining a site to be deleted based on the average inter-site distance of each candidate site and a second preset threshold value.

[0077] In this step, the determination of the site to be deleted can be based on at least one of the minimum inter-site distance and the average inter-site distance. In fact, this site reduction analysis method can also be regarded as an analysis of the site structure. The site reduction is achieved by using the site structure.

[0078] It should be understood that when the data obtained in S402 includes the minimum inter-site distance, the minimum inter-site distance can be used to determine the site to be deleted; when the data obtained in S402 includes the average inter-site distance, the average inter-site distance can be used to determine the site to be deleted. When the minimum inter-site distance is used to achieve the site reduction analysis, the average inter-site distance can not be calculated; vice versa.

[0079] S406, deleting the site to be deleted in the candidate site set.

[0080] In each round of the loop, after the site to be deleted is determined and deleted, it returns to S2 for repeated execution. In other words, after each site deletion, the inter-site distance needs to be recalculated, and the site to be deleted needs to be reconfirmed until there is no site to be deleted that meets the conditions.

[0081] The implementation of the site reduction analysis based on the minimum inter-site distance is described in detail below.

[0082] In an embodiment of the present disclosure, the step of determining the to-be-deleted station based on the minimum station spacing of each candidate station and the first preset threshold in the foregoing S404 can be performed in the following manner:

[0083] First, the candidate stations with the minimum station spacing less than the first preset threshold are filtered out from the candidate station set to obtain the to-be-confirmed stations. In this step, the first preset threshold can be self-defined, and in actual scenarios, can be specifically the ultra-close range UCR. In this step, the stations with too close station spacing are combined for unilateral deletion to avoid the risk of station interference caused by too close station spacing.

[0084] Thus, when there are at least two to-be-confirmed stations with the same minimum station spacing in the to-be-confirmed stations, it is determined whether the station types of the at least two to-be-confirmed stations are both mandatory stations. It can be understood that when there are at least two to-be-confirmed stations with the same minimum station spacing in the to-be-confirmed stations, it indicates that there are at least one pair of station combinations in the to-be-confirmed stations, the station spacing between the station combinations is the minimum station spacing, and the minimum station spacing is less than the first preset threshold. In this case, the distances between the to-be-confirmed stations are too close, and therefore, one to-be-confirmed station needs to be deleted. In this case, the station type needs to be further considered. If the stations are all mandatory stations, it indicates that the stations are existing stations, and the station conditions of the existing stations are within a reasonable range, and therefore, no deletion processing is needed. Conversely, if not all of the stations are mandatory stations, appropriate station reduction processing needs to be performed.

[0085] Further, when the station types of the at least two to-be-confirmed stations are not both mandatory stations, one to-be-confirmed station of the at least two to-be-confirmed stations is confirmed as a to-be-deleted station. In this case, station reduction needs to be performed. In the present disclosure, not all of the to-be-confirmed stations are deleted, but one to-be-confirmed station is deleted. In this way, the situation of blank site selection caused by excessive station reduction can be avoided.

[0086] In addition, in this embodiment, when there is only one to-be-confirmed station with the minimum station spacing less than the first preset threshold, it indicates that the adjacent station of the to-be-confirmed station is not in the candidate station set, and the to-be-confirmed station can be directly confirmed as a to-be-deleted station and subjected to deletion processing.

[0087] Furthermore, in this implementation, if there are at least two sites with the same minimum inter-station distance among the sites to be confirmed, and if the site types of these sites are all mandatory, no processing is performed, and it is confirmed that there are no sites to be deleted in this case. For example, in one embodiment, if the minimum inter-station distances of sites 1 and 2 are equal and less than the UCR, and the minimum inter-station distance of site 3 is also less than the UCR, and it is further confirmed that sites 1 and 2 are both mandatory, then only site 3 is confirmed as a site to be deleted and deleted.

[0088] Furthermore, in this embodiment, when confirming a site to be deleted from at least two sites to be confirmed, various implementations are possible. For example, any one of the at least two sites to be confirmed can be confirmed as the site to be deleted. Alternatively, for another example, a site to be confirmed that is farther from the planning center can be confirmed as the site to be deleted. Alternatively, for another example, the site to be deleted can be confirmed based on site attribute information.

[0089] In an exemplary embodiment, the site to be deleted can be determined based on the site priority, or further, when the site priorities are the same, the site to be deleted can be further confirmed based on the average station distance. When this embodiment is specifically implemented, the following method can be adopted: when the site priorities of at least two sites to be confirmed are inconsistent, according to the preset site priority, the site to be confirmed with a lower site priority among the at least two sites to be confirmed is confirmed as the site to be deleted; thus, when the site priorities of at least two sites to be confirmed are consistent, the site to be confirmed with a smaller average station distance among the at least two sites to be confirmed is confirmed as the site to be deleted.

[0090] In the disclosed embodiments, based on the various types of sites mentioned above, in an exemplary embodiment, the site priority can be: mandatory site > co-located site > rooftop site > ground site. Therefore, when confirming sites to be deleted based on site priority, sites with higher priority are retained first, and sites with lower priority are deleted.

[0091] For a clearer explanation of this solution, please refer to Figure 5 , Figure 5 This is a flow chart of a station reduction analysis based on minimum station spacing provided by the present disclosure. Figure 5 As shown, the station reduction analysis includes the following steps:

[0092] First, calculate the candidate station set ( Figure 5 The minimum and average station spacing of each candidate site in the candidate site list is represented in (represented in the candidate site list).

[0093] Afterwards, it is judged whether there is a station with a minimum station spacing less than the UCR in the set of candidate stations; if yes, the subsequent judgment is performed; if no, the loop ends and the set of target stations is outputted. Figure 6 which is represented as the candidate station site after the minimum station spacing is deleted.

[0094] Afterwards, for the station with the minimum station spacing less than the UCR, it is further judged whether the number of stations with the minimum station spacing equal to and less than the UCR is 2; if yes, it is judged whether the station site priorities are the same; if no, the station with the minimum station spacing less than the UCR is deleted and the next loop is entered to recalculate the minimum station spacing and the average station spacing and perform the subsequent judgment.

[0095] Afterwards, the judgment of whether the station site priorities are the same is performed; if yes, the deletion is performed according to the priorities and the next loop is entered after the deletion; if no, it is judged whether the station site priority is a mandatory station.

[0096] Finally, the judgment of whether the station site priority is a mandatory station is performed; if yes, no deletion is needed and the next loop is directly entered; if no, the station deletion is performed according to the average station spacing and the next loop is entered after the deletion.

[0097] Based on the foregoing processing, the reasonable station reduction processing of the set of candidate stations can be realized based on the minimum station spacing. After the foregoing processing, there is no non-mandatory station with a minimum station spacing less than the first preset threshold in the set of candidate stations, which ensures that the station-to-station interference in the finally obtained set of target stations is low.

[0098] The implementation manner of the station reduction analysis based on the average station spacing is specifically described below.

[0099] In an embodiment of the present disclosure, the step of determining the station to be deleted based on the average station spacing of each candidate station and the second preset threshold in the foregoing S404 can be performed in the following manner:

[0100] First, the candidate stations with an average station spacing less than the second preset threshold are screened in the set of candidate stations to obtain the stations to be confirmed. In this step, the second preset threshold can be self-defined and set, and in an actual scenario, can be specifically Min_S in the site selection parameter. In this step, the stations with a station spacing still close to each other can be locally deleted based on the relationship between the average station spacing and Min_S.

[0101] Secondly, based on the station priority of each to-be-confirmed station, one to-be-confirmed station with a lower station priority is confirmed as a to-be-deleted station. In other words, for each to-be-confirmed station with an average station spacing less than Min_S, in each loop process of the station reduction analysis based on the average station spacing, only one type of station is deleted, specifically, only the station with a lower priority is deleted each time, to realize a local deletion. After each deletion, the next loop is entered, the average station spacing is recalculated, and the deletion is performed in turn until there is no to-be-deleted station.

[0102] For example, please refer to Figure 6 , Figure 6 A flowchart of a station reduction analysis based on an average station spacing is provided for the present disclosure. It should be noted that the scheme shown in Figure 6 may be performed after the station reduction processing based on the minimum station spacing, for example, Figure 5 the embodiment shown can be performed after the embodiment shown in Figure 6 . Of course, Figure 6 is only exemplary, and in actual scenarios, the scheme shown in Figure 6 may also be directly performed.

[0103] As shown in Figure 7 , the station reduction analysis process shows multiple station reduction analysis loops. Specifically, it includes:

[0104] In the first loop, for the to-be-selected station set, it is judged whether there is a station with an average station spacing less than Min_S; if yes, based on the station priority, the to-be-selected station marked as a pole station is deleted; if no, there is no to-be-deleted station, and the to-be-selected station set after deletion is directly output (if no other analysis process is performed, the output at this time is the target station set).

[0105] At this time, one loop of the station reduction analysis based on the average station spacing is completed. After the to-be-selected station marked as a pole station is deleted, the next loop is directly entered. It should be understood that if there is no to-be-selected station marked as a pole station in this step, the to-be-selected stations with lower priorities are confirmed as to-be-deleted stations and are deleted in turn based on the order from low to high of the station priority.

[0106] In the second loop, the average station spacing in the to-be-selected station set is still calculated, and it is judged whether there is a station with an average station spacing less than Min_S; if yes, based on the station priority, the to-be-selected station marked as a roof station is deleted; if no, there is no to-be-deleted station, and the to-be-selected station set after deletion is directly output.

[0107] After the to-be-selected station marked as a roof station is deleted, the next loop is directly entered.

[0108] In the third cycle, the average station spacing in the candidate station set is still calculated first, and it is judged whether there is a station with an average station spacing less than Min_S; if so, based on the station priority, the candidate station marked as a co-sited station is deleted; if not, there is no station to be deleted, and the candidate station set after deletion is directly output.

[0109] After deleting the candidate station marked as a roof station, no further judgment and deletion are performed on the mandatory station, and the result of the candidate station after deletion, i.e., the target station set, is directly output.

[0110] Based on the foregoing processing, reasonable station reduction processing of the candidate station set can be realized based on the average station spacing. After the foregoing processing, there is no non-mandatory station in the candidate station set with an average station spacing less than the second preset threshold, which ensures that the station-to-station interference in the target station set obtained finally is low.

[0111] Moreover, if the two station reduction methods are used at the same time, it is more conducive to realize reasonable station reduction, avoid station-to-station interference, and also avoid the occurrence of site blanking.

[0112] Hereinafter, an embodiment of station addition analysis is specifically described.

[0113] Please refer to Figure 7 , Figure 7 for a flowchart of station addition analysis provided by the present disclosure. As shown in Figure 7 , when the station-to-station analysis is station addition analysis, the station-to-station analysis of each candidate station in the candidate station set can include the following steps:

[0114] S702, obtaining a candidate station in the candidate station set with a minimum station spacing greater than a third preset threshold.

[0115] Specifically, the station addition analysis is to avoid the case of site blanking, and based on this, the candidate station set also needs to be subjected to station addition analysis to avoid this case.

[0116] Specifically, the third preset threshold can be self-defined and set, and in an actual scenario, can be specifically the ULR in the site selection parameters. When there is a candidate station with a minimum station spacing greater than the ULR, it indicates that there is a candidate station with a long interval distance, and at this time, further station addition analysis is performed on the candidate station.

[0117] S704, obtaining a selectable station within a preset range of the candidate station.

[0118] The preset range can be set as desired. In actual scenarios, the optional stations can be screened based on the center of the candidate station, or the optional stations can be screened based on the center of another position associated with the candidate station. In an exemplary embodiment, the preset range can be a range extending outward by a certain area from a midpoint between the candidate station and another position (for example, another candidate station closest to the candidate station or another candidate station with an average distance greater than the ULR) as the center. The shape and size of the preset range can be designed as desired, and the present disclosure does not have particular limitations in this regard. For example, the preset range can be a range with the midpoint as the center and C (any value greater than 0) as the radius. Alternatively, for example, the preset range can be a rectangular range with the midpoint as the center, without being exhaustive.

[0119] This step is used to screen the optional stations in the preset range of the midpoint, and the station adding analysis provided by the present disclosure is implemented based on the attributes of the optional stations. The optional stations determined in this step need to meet the preset station site structure, and the optional stations are irrelevant to the current candidate station set, for example, the optional stations can be the stations deleted in the previous analysis and are not in the current candidate station set.

[0120] S706, based on the attributes of each optional station, performing station evaluation on each optional station to determine a new station.

[0121] As shown in the station adding analysis shown in Figure 8 The purpose of the station adding analysis is to evaluate whether to add a new station to the candidate station set, and based on this, the type of the new station and the distance between the new station and other stations need to be further considered. The construction cost, construction difficulty, construction period and other actual construction information of the new station of different types are different, and in addition, as described above, the distance between stations is also a necessary item to be considered.

[0122] Based on this, the station attributes involved in the present disclosure can include but are not limited to at least one of a type attribute and a distance attribute. The type attribute is related to the actual construction information, and the distance attribute is related to the position of the planning center.

[0123] S708, adding the new station to the candidate station set to obtain a target station set.

[0124] Based on the foregoing station adding process, the phenomenon of long-distance station blank can be compensated, and problems such as poor signal caused by station blank can be avoided.

[0125] Based on the embodiment shown in Figure 8 The present disclosure further provides a station evaluation method for the optional stations in S706, which can include the following steps:

[0126] In one aspect, a type evaluation score of each optional site is obtained based on a site type attribute of each optional site. In another aspect, a distance evaluation score of each optional site is obtained based on a distance attribute of each optional site. Then, the type evaluation score and the distance evaluation score are weighted to obtain a site evaluation score of each optional site. Thus, one of the optional sites with the highest site evaluation score is determined as the new site.

[0127] The embodiment can be represented by the following formula:

[0128] Site evaluation score = a type evaluation score + b distance evaluation score

[0129] wherein a and b are preset weights, which can be designed by the actual scene, for example, the values of a and b can both be 1, and in this case, the site evaluation score is the sum of the type evaluation score and the distance evaluation score.

[0130] Specifically, the site type attribute can include but is not limited to at least one of the following: construction cost, construction difficulty, construction period. In this way, when the type evaluation score is obtained based on the site type attribute, the type evaluation score can be obtained based on the site type attribute corresponding to the site type of each optional site.

[0131] In an exemplary embodiment, the type evaluation score (which can also be referred to as a site type weight, a site type score, etc., without limitation) can satisfy the following formula:

[0132] Type evaluation score = W1*construction cost + W2*construction difficulty + W3*construction period

[0133] wherein W1, W2, and W3 are self-defined weights. It should be understood that the smaller the construction cost, construction difficulty, and construction period, the higher the type evaluation score, and in this case, the self-defined weights can be negative.

[0134] Specifically, the distance attribute can include but is not limited to the distance between the site and the center of the planning area. In this way, when the distance evaluation score of the midpoint is obtained based on the distance attribute, the distance between each optional site and the planning center can be obtained, and the distance evaluation score can be determined accordingly. Specifically, the distance evaluation score can be weighted and calculated according to the Euclidean distance or the distance between the latitude and longitude converted to the plane coordinate.

[0135] In an exemplary embodiment, the distance evaluation score (which can also be referred to as a site distance weight, a site distance score, etc., without limitation) can satisfy the following formula:

[0136] Distance evaluation score = W4*(earth radius*arcos[cos(midpoint latitude)*cos(site latitude)*cos(midpoint longitude-site longitude)+sin(midpoint latitude)*sin(site latitude)])

[0137] wherein, W4 is a self-defined weight. It should be understood that the closer the site is to the planning center, the better, the closer the distance, the higher the distance evaluation score.

[0138] For examples, refer to Figure 8 , Figure 8 A flowchart of a station adding analysis process provided by the present disclosure. It should be noted that the scheme shown in Figure 6 may be performed after the station reduction processing based on the average station spacing, for example, Figure 8 The embodiment shown in Figure 8 may be performed after the embodiment shown in Figure 8 Of course, Figure 9 is only exemplary, in actual scenarios, the may also be directly executed.

[0139] Figure 9 As shown in

[0140] First, the minimum station spacing and the average station spacing of each candidate site in the candidate station set are calculated.

[0141] Secondly, it is judged whether there is a candidate site with a minimum station spacing greater than ULR; if yes, the subsequent steps are executed; if no, the station adding analysis is ended, and the target station set is output.

[0142] Based on the previous step, if there is a candidate site with a minimum station spacing greater than ULR, the midpoint of the site and the nearest site is calculated.

[0143] Then, it is judged whether there is a candidate site within the preset range of the midpoint expanded by C; if yes, the station evaluation is performed on each candidate site and the new added station is determined.

[0144] Then, the station set added with the new added station is output, that is, the target station set is output.

[0145] Based on the at least one station analysis described above, the final target station set can be determined, and then the target station set can be output so that the user can build a station based on the target station set.

[0146] To sum up, the automatic site selection scheme provided by the present disclosure can realize automatic site selection based on an electronic map, support automatic output of site selection results of a planning area, and reduce labor cost and time cost in site selection. Moreover, the present disclosure can realize automatic site selection of four kinds of sites based on a mandatory site, a co-sited site, a roof site, and a pole site. In the site selection process, two site reduction analyses and one site addition analysis are specifically included. These analysis means support the use of all data and processes, and one or several sites can be reduced according to actual conditions, for example, only a co-sited site is used for site selection, only a roof site is used for site selection, and the like. In addition, only a site reduction algorithm or only a site addition algorithm can be used for specific inter-site analysis. The present disclosure can be used according to actual conditions and has high flexibility.

[0147] Moreover, the inter-site analysis means used by the present disclosure does not involve pre-training of a data model, and can realize fast automatic site selection directly using the foregoing process and simple mathematical calculation, which is lower in cost and faster in speed than using AI or a trained model.

[0148] Moreover, the only complex data involved in the present disclosure is a high-precision map. In the case where a map condition is met or construction of a roof site or a tower site is not needed, the present disclosure can support output of a site selection scheme at a provincial or regional level or even within the entire national outline, that is, the present disclosure can support output of a wide-area single-frequency site selection scheme, which has a wide application range.

[0149] The present disclosure also provides a site selection device. Figure 10 A structural block diagram of a site selection device provided by an embodiment of the present disclosure is shown in Figure 10 As shown in the figure, the site selection device 900 includes:

[0150] An acquisition unit 910 is configured to acquire a set of candidate sites based on a planning area and a high-precision map.

[0151] An analysis unit 920 is configured to perform inter-site analysis on each candidate site in the set of candidate sites and determine a set of target sites based on an analysis result.

[0152] The inter-site analysis includes site reduction analysis and / or site addition analysis. The site reduction analysis is related to inter-site distance, and the site addition analysis is related to site attributes.

[0153] In an exemplary embodiment, when the inter-site analysis is the site reduction analysis, the analysis unit 920 is specifically configured to: cyclically execute the following steps until there is no candidate site to be deleted, and obtain the set of target sites.

[0154] The acquisition unit 910 is configured to acquire minimum inter-site distance and / or average inter-site distance of each candidate site in the set of candidate sites.

[0155] determine the to-be-deleted station based on the minimum station distance of each to-be-selected station and a first preset threshold; and / or determine the to-be-deleted station based on the average station distance of each to-be-selected station and a second preset threshold;

[0156] delete the to-be-deleted station from the set of to-be-selected stations.

[0157] In an exemplary embodiment, the analysis unit 920 is specifically configured to:

[0158] select, from the set of to-be-selected stations, to-be-confirmed stations that have a minimum station distance less than the first preset threshold;

[0159] when there are at least two to-be-confirmed stations that have an equal minimum station distance in the to-be-confirmed stations, determine whether the station types of the at least two to-be-confirmed stations are both optional stations;

[0160] when the station types of the at least two to-be-confirmed stations are not both optional stations, confirm one to-be-confirmed station in the at least two to-be-confirmed stations as the to-be-deleted station.

[0161] In an exemplary embodiment, the analysis unit 920 is specifically configured to:

[0162] when the station priorities of the at least two to-be-confirmed stations are inconsistent, confirm, according to a preset station priority, one to-be-confirmed station in the at least two to-be-confirmed stations that has a lower station priority as the to-be-deleted station;

[0163] when the station priorities of the at least two to-be-confirmed stations are consistent, confirm one to-be-confirmed station in the at least two to-be-confirmed stations that has a smaller average station distance as the to-be-deleted station.

[0164] In an exemplary embodiment, the analysis unit 920 is specifically configured to:

[0165] select, from the set of to-be-selected stations, to-be-confirmed stations that have an average station distance less than the second preset threshold;

[0166] confirm, based on station priorities of the to-be-confirmed stations, one to-be-confirmed station in the to-be-confirmed stations that has a lower station priority as the to-be-deleted station.

[0167] In an exemplary embodiment, the analysis unit 920 is specifically configured to:

[0168] for any to-be-selected station in the set of to-be-selected stations, obtain a station distance between the to-be-selected station and a neighboring station based on a preset neighboring relationship; the neighboring relationship includes a Delaunay triangle relationship;

[0169] obtaining a minimum value of the station distances, to obtain the minimum station distance; and / or, obtaining an average value of the station distances, to obtain the average station distance.

[0170] In an example embodiment, when the inter-site analysis is the station adding analysis, the analysis unit 920 is specifically configured to:

[0171] obtaining candidate stations with a minimum station distance greater than a third preset threshold value in the candidate station set;

[0172] obtaining optional stations within a preset range of the candidate stations;

[0173] performing station evaluation on each optional station based on attributes of each optional station, to determine a new station to be added;

[0174] adding the new station to be added to the candidate station set, to obtain the target station set.

[0175] In an example embodiment, the analysis unit 920 is specifically configured to:

[0176] obtaining a type evaluation score of each optional station based on a station type attribute of each optional station;

[0177] obtaining a distance evaluation score of each optional station based on a distance attribute of each optional station;

[0178] performing weighted processing on the type evaluation score and the distance evaluation score, to obtain a station evaluation score of each optional station;

[0179] confirming an optional station with the highest station evaluation score as the new station to be added.

[0180] In an example embodiment, the candidate station set includes at least one of the following: a mandatory station set, a co-sited station set, a roof station set, and a ground station set.

[0181] In an example embodiment, the obtaining unit 910 is specifically configured to:

[0182] obtaining each existing station site in the planning area, to obtain the co-sited station set;

[0183] performing filtering on the existing station sites in the planning area based on a target frequency band mode, to obtain the mandatory station set;

[0184] reading the high-precision map and obtaining buildings in the high-precision map, performing filtering on the buildings and determining building optional points, to obtain the roof station set;

[0185] The high-precision map is read and ground optional points in the high-precision map are obtained, and the ground optional points are clustered to obtain the ground station set.

[0186] Figure 11 The hardware block diagram of an electronic device provided in an embodiment of the present disclosure is shown. The electronic device 1000 according to an embodiment of the present disclosure includes at least a processor and a memory for storing computer-readable instructions. When the computer-readable instructions are loaded and executed by the processor, the processor executes the address selection method described in any of the preceding embodiments of the present disclosure.

[0187] Figure 11 The electronic device 1000 shown specifically includes: a central processing unit (CPU) 1001, a graphics processing unit (GPU) 1002, and a memory 1003. These units are interconnected via a bus 1004. The central processing unit (CPU) 1001 and / or the graphics processing unit (GPU) 1002 can be used as the above-mentioned processor, and the main memory 1003 can be used as the above-mentioned memory for storing computer-readable instructions. In addition, the electronic device 1000 may also include a communication unit 1005, a storage unit 1006, an output unit 1007, an input unit 1008, and an external device 1009, which are also connected to the bus 1004.

[0188] ​ A schematic diagram of a computer-readable storage medium provided in an embodiment of the present disclosure. ​ As shown, a computer-readable storage medium 1100 according to an embodiment of the present disclosure has computer-readable instructions 1101 stored thereon. When the computer-readable instructions 1101 are executed by a processor, the address selection method described with reference to the above figures according to any of the above embodiments of the present disclosure is executed. The computer-readable storage medium includes, but is not limited to, volatile memory and / or non-volatile memory. Volatile memory may include, for example, random access memory (RAM) and / or cache memory. Non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, optical disk, magnetic disk, etc.

[0189] The present disclosure further provides a computer program product, including a computer program, which, when executed by a processor, implements the site selection method described in any of the foregoing embodiments of the present disclosure.

[0190] Those skilled in the art can realize combined units or algorithm steps of each example described in connection with the embodiments disclosed herein can be realized by electronic hardware, or a combination of computer software and electronic hardware. Whether the functions are performed in hardware or software depends on the specific application and design constraints of the technical solutions. Those skilled in the art can use different methods to implement the described functions for each specific application, but the implementation should not be considered to be beyond the scope of the present disclosure.

[0191] The above describes the basic principles of the present disclosure in combination with specific embodiments, but it should be noted that the advantages, benefits, effects and the like mentioned in the present disclosure are only examples and are not limiting, and these advantages, benefits, effects and the like cannot be considered as the various embodiments of the present disclosure must have. In addition, the above specific details disclosed are only for the purpose of example and for the purpose of understanding, and the above details do not limit the present disclosure to the above specific details.

[0192] The block diagrams of the devices, apparatuses, equipment, systems involved in the present disclosure are only illustrative examples and are not intended to require or imply the connection, arrangement, configuration shown in the block diagram. As those skilled in the art will recognize, these devices, apparatuses, equipment, systems can be connected, arranged, configured in any way. Words such as "include", "contain", "have" and the like are open-ended words, which mean "including but not limited to", and can be used interchangeably. The words "or" and "and" used herein mean the word "and / or", and can be used interchangeably unless the context clearly indicates otherwise. The word "such as" used herein means the phrase "such as but not limited to", and can be used interchangeably.

[0193] In addition, as used herein, "or" used in the list of items starting with "at least one of indicates a separate list, so that, for example, "at least one of A, B, or C" means A or B or C, or AB or AC or BC, or ABC (i.e. A and B and C). In addition, the phrase "exemplary" does not mean that the described example is preferred or better than other examples.

[0194] It should also be noted that in the systems and methods of the present disclosure, each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be considered as equivalent solutions of the present disclosure.

[0195] Various changes, modifications, and alterations to the techniques described herein can be made without departing from the teachings of the attached claims. Moreover, the scope of the claims of the present disclosure is not limited to the particular aspects described herein. Rather, the scope of the claims of the present disclosure includes all alternatives, modifications, and equivalents falling within the scope of the claims of the present disclosure. Accordingly, the attached claims are incorporated into this Detailed Description by reference.

[0196] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein can be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0197] The above description has been presented for the purpose of illustration and description. Furthermore, this description is not intended to limit the embodiments of the present disclosure to the forms disclosed herein. Although various example aspects and embodiments have been discussed above, those of ordinary skill in the art will appreciate a variety of modifications, alternatives, permutations, and equivalents thereof. Accordingly, the disclosure is intended to embrace all such alterations, modifications, and permutations of the aspects described herein, including other aspects falling within the scope of the appended claims.

Claims

1. A siting method characterized by, The method comprises the following steps: obtaining a set of candidate stations based on a planning area and a high-precision map; performing inter-station analysis on each candidate station in the set of candidate stations, and determining a set of target stations based on the analysis result; wherein the inter-station analysis comprises station reduction analysis and / or station addition analysis, wherein the station reduction analysis is related to inter-station distance, and the station addition analysis is related to station attributes; when the inter-station analysis is the station reduction analysis, the inter-station analysis on each candidate station in the set of candidate stations comprises the following steps, which are repeatedly performed until there is no station to be deleted, and the set of target stations is obtained: obtaining the minimum inter-station distance and / or the average inter-station distance of each candidate station in the set of candidate stations; determining a station to be deleted based on the minimum inter-station distance of each candidate station and a first preset threshold value, and / or determining a station to be deleted based on the average inter-station distance of each candidate station and a second preset threshold value; deleting the station to be deleted in the set of candidate stations; when the inter-station analysis is the station addition analysis, the inter-station analysis on each candidate station in the set of candidate stations comprises: obtaining a candidate station in the set of candidate stations whose minimum inter-station distance is greater than a third preset threshold value; obtaining selectable stations within a preset range of the candidate station; performing station evaluation on each selectable station based on the attributes of each selectable station to determine a new added station; adding the new added station to the set of candidate stations to obtain the set of target stations.

2. The method of claim 1, wherein, The determination of the station to be deleted based on the minimum inter-station distance of each candidate station and the first preset threshold value comprises: screening the candidate stations in the set of candidate stations whose minimum inter-station distance is less than the first preset threshold value to obtain stations to be confirmed; when there are at least two stations to be confirmed whose minimum inter-station distance is equal in the stations to be confirmed, determining whether the station types of the at least two stations to be confirmed are all optional stations; when the station types of the at least two stations to be confirmed are not all optional stations, confirming one of the at least two stations to be confirmed as the station to be deleted.

3. The method of claim 2, wherein, The confirmation of one of the at least two stations to be confirmed as the station to be deleted comprises: when the station priorities of the at least two stations to be confirmed are inconsistent, confirming the station to be confirmed with a lower station priority as the station to be deleted according to a preset station priority; when the station priorities of the at least two stations to be confirmed are consistent, confirming the station to be confirmed with a smaller average inter-station distance as the station to be deleted.

4. The method of claim 1, wherein, The determination of the station to be deleted based on the average inter-station distance of each candidate station and the second preset threshold value comprises: screening the candidate stations in the set of candidate stations whose average inter-station distance is less than the second preset threshold value to obtain stations to be confirmed; confirming one of the stations to be confirmed with a lower station priority as the station to be deleted based on the station priorities of the stations to be confirmed.

5. The method of claim 1, wherein, The obtaining of the minimum inter-station distance and / or the average inter-station distance of each candidate station in the set of candidate stations comprises: For any one of the candidate station set, based on the preset adjacent relationship, the station spacing between the candidate station and the adjacent station is obtained; the adjacent relationship includes: Delaunay triangle relationship; Obtain the minimum value of the station spacing to obtain the minimum station spacing; and / or, obtain the average value of the station spacing to obtain the average station spacing.

6. The method of claim 1, wherein, The station evaluation of each optional station based on the attribute of each optional station is performed to determine the new station, including: Based on the type attribute of each optional station, the type evaluation score of each optional station is obtained; Based on the distance attribute of each optional station, the distance evaluation score of each optional station is obtained; The type evaluation score and the distance evaluation score are weighted to obtain the station evaluation score of each optional station; The optional station with the highest station evaluation score is determined as the new station.

7. The method according to any one of claims 1 to 6, characterized in that, The candidate station set includes at least one of the following: a required station set, a co-site station set, a roof station set, and a ground station set.

8. The method of claim 7, wherein, Based on the planning area and the high-precision map, the candidate station set is obtained, including at least one of the following: Obtain each existing station address in the planning area to obtain the co-site station set; Based on the target frequency band, the existing station addresses in the planning area are filtered to obtain the required station set; Read the high-precision map and obtain the buildings in the high-precision map, filter the buildings and determine the building optional points to obtain the roof station set; Read the high-precision map and obtain the ground optional points in the high-precision map, cluster the ground optional points to obtain the ground station set.

9. A siting apparatus, characterized by includes: An acquisition unit is configured to obtain a candidate station set based on a planning area and a high-precision map; An analysis unit is configured to perform inter-station analysis on each candidate station in the candidate station set and determine a target station set based on the analysis result; The inter-station analysis includes a station reduction analysis and / or a station addition analysis, wherein the station reduction analysis is related to the station spacing, and the station addition analysis is related to the station attribute; When the inter-station analysis is the station reduction analysis, the inter-station analysis of each candidate station in the candidate station set includes: performing the following steps in a loop until there is no station to be deleted to obtain the target station set: Obtain the minimum station spacing and / or the average station spacing of each candidate station in the candidate station set; Determine the station to be deleted based on the minimum station spacing of each candidate station and a first preset threshold; and / or, determine the station to be deleted based on the average station spacing of each candidate station and a second preset threshold; Delete the station to be deleted in the candidate station set; When the inter-station analysis is the station addition analysis, the inter-station analysis of each candidate station in the candidate station set includes: Obtain the candidate station with a minimum station spacing greater than a third preset threshold in the candidate station set; Obtain the optional station within the preset range of the candidate station; Perform station evaluation on each optional station based on the attribute of each optional station to determine a new station; Add the new station to the candidate station set to obtain the target station set.

10. An electronic device, comprising: includes: a memory for storing computer readable instructions; and a processor for running the computer readable instructions to cause the electronic device to perform the method of any one of claims 1-8.

11. A non-transitory computer-readable storage medium storing computer-readable instructions, the computer-readable instructions comprising: the computer readable instructions, when executed by the processor, cause the processor to perform the method of any one of claims 1-8.

12. A computer program product, characterised in that, a computer program that, when executed by a processor, implements the method of any one of claims 1-8.

Images