WO2017193554A1 - 区域聚合的方法及装置 - Google Patents

区域聚合的方法及装置 Download PDF

Info

Publication number
WO2017193554A1
WO2017193554A1 PCT/CN2016/104010 CN2016104010W WO2017193554A1 WO 2017193554 A1 WO2017193554 A1 WO 2017193554A1 CN 2016104010 W CN2016104010 W CN 2016104010W WO 2017193554 A1 WO2017193554 A1 WO 2017193554A1
Authority
WO
WIPO (PCT)
Prior art keywords
grid
area
raster
sequence
question
Prior art date
Application number
PCT/CN2016/104010
Other languages
English (en)
French (fr)
Inventor
梁小英
王连臣
张立
周康磊
于丽颖
黎晓勇
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2017193554A1 publication Critical patent/WO2017193554A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Definitions

  • the present disclosure relates to the field of communication technologies, for example, to a method and apparatus for problem area aggregation.
  • GIO Geographic Information System
  • GIS Geo-Information System
  • the network optimization tools and systems of the related technologies mostly display the problem locations through the GIS through the cells, sampling points and grid dimensions, especially the corresponding coverage problems, the sampling points and the problem grid range are too small to meet the mobile operator's timely Intuitively discover the need for regional issues.
  • a regional problem requires manual marking and is not smart enough.
  • the problem region generation method of the related art is to select a randomly selected problem grid as a center point, a problem grid in a circle with a center point as a center and a radius of H, and a problem grid does not exceed a circle. the size of.
  • the other is to identify the problem raster using military raster coordinates. In either case, the analysis order is random, and the Euclidean distance is used to determine whether the grid belongs to a certain area, which is complicated in calculation and low in efficiency.
  • the present disclosure provides a method and apparatus for problem area aggregation, which can improve computational efficiency.
  • Embodiments of the present disclosure provide a method for area aggregation, including:
  • Performing the following operations one by one for the at least one problem area from the remaining problem grid of the problem grid sequence, selecting a question grid whose distance from at least one problem grid in the problem area is less than a preset threshold , aggregates to the problem area, and removes the selected question grid from the question grid sequence.
  • the method further includes:
  • each problem area and its included problem grid are outputted.
  • the current length of the problem raster sequence is not zero, returning the predetermined rule, selecting at least one question grid from the problem grid sequence, and deleting the at least one question grid from the question grid sequence step.
  • the step of selecting all the problem grids that meet the predetermined condition from the grid array comprises:
  • a grid containing the measurement report reflecting the predetermined problem is selected as the problem grid.
  • the preset feature value is an influence weight
  • the step of sorting all the problem rasters according to the preset feature value to obtain a problem raster sequence includes:
  • All problem rasters are arranged in descending order according to the influence weights to generate a problem raster sequence
  • M represents the number of valid sample points in a single grid
  • S represents the total number of sample points in a single grid
  • X represents the impact factor
  • the sample points are measurement reports
  • the effective sample points are measurements of the reaction-predetermined problem report.
  • the preset feature value includes a first sorting factor and a second sorting factor
  • the step of sorting all the problem rasters according to the preset feature value to obtain a question grid sequence further includes:
  • the problem grids are arranged in descending order, and the problem grids having the same first sorting factor are arranged in descending order according to the second sorting factor to generate a final raster sequence;
  • the first sorting factor is one of a row number and a column number in the grid array
  • the second sorting factor is another one of a row number and a column number in the grid array.
  • the problem raster that is selected from the remaining problem grids of the problem grid sequence is separated from the at least one problem grid in the problem area by a predetermined threshold, and is aggregated to the problem area.
  • the steps of removing the selected question grid from the question grid sequence including:
  • An embodiment of the present disclosure further provides an apparatus for area aggregation, including:
  • a processing module configured to divide a wireless signal coverage area to be analyzed into a grid array including a plurality of grids, and select all problem grids that meet predetermined conditions from the grid array;
  • a sorting module configured to sort all problem rasters according to preset eigenvalues to obtain a question grid sequence
  • a screening module configured to select at least one question grid from the problem grid sequence according to a predetermined rule, and delete the at least one question grid from the question grid sequence;
  • Generating a module configured to determine an area to which each problem grid in the at least one problem grid belongs, to obtain at least one problem area;
  • an aggregation module configured to perform one operation for each of the at least one problem area: selecting, from the remaining problem grid of the problem grid sequence, a distance from at least one problem grid in the problem area is less than a preset A problem grid of thresholds, aggregated into the problem area, and the selected problem raster is removed from the problem raster sequence.
  • the device further includes:
  • a judging module configured to output each problem region and a problem thereof if the current length of the problem grid sequence is zero after performing the operation on all problem regions in the at least one problem region a grid, if the current length of the problem grid sequence is not zero, returning the predetermined rule to select at least one question grid from the problem grid sequence, and the at least one problem grid from the problem grid The steps to remove the grid sequence.
  • the processing module includes:
  • the first processing unit is configured to project the measurement report to the grid corresponding to the terminal location information according to the terminal location information in the measurement report of the terminal in the wireless signal coverage area;
  • the second processing unit is configured to select a grid containing the measurement report reflecting the predetermined problem as a problem grid according to the problem reflected by the measurement report in each grid.
  • the preset feature value is an impact weight
  • the sorting module includes:
  • a first sorting unit configured to sort all problem rasters in descending order according to the influence weight to generate a problem raster sequence
  • M represents the number of valid sample points in a single grid
  • S represents the total number of sample points in a single grid
  • X represents the impact factor
  • the sample points are measurement reports
  • the effective sample points are measurements of the reaction-predetermined problem report.
  • the preset feature value includes a first sorting factor and a second sorting factor
  • the sorting module further includes:
  • a second sorting unit is configured to sort all the problem rasters in descending order according to the first sorting factor, and perform descending order on the problem grids having the same first sorting factor according to the second sorting factor.
  • the first sorting factor is one of a row number and a column number in the grid array
  • the second sorting factor is another one of a row number and a column number in the grid array.
  • the aggregation module includes:
  • a first generating unit configured to select, in the grid array, a grid having a Manhattan distance smaller than a preset threshold from at least one question grid in the problem area, to generate a grid set, wherein each of the grid arrays Each grid corresponds to a square coverage area of the same size;
  • a first aggregation unit configured to aggregate a problem raster belonging to the problem raster set in the remaining raster of the problem raster sequence into the problem area, obtain a new problem area, and aggregate into the problem area
  • the problem raster is removed from the raster sequence
  • a second generating unit configured to select, in the grid array, a grid with a Manhattan distance of at least one problem grid in the new problem area being less than a preset threshold, to generate a new grid set
  • a second aggregating unit configured to aggregate a problem raster belonging to the new raster set in the currently remaining problem raster in the problem raster sequence into the current problem area until the problem raster sequence does not exist At least one of the problem areas in the current problem area has a Manhattan distance that is less than a predetermined threshold.
  • a non-transitory storage medium storing computer-executable instructions configured to perform the above-described method of region aggregation is provided.
  • a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions When executed by a computer, the computer is caused to perform the above-described method of area aggregation.
  • an electronic device including at least one processor and The at least one processor communicatively coupled to a memory, the memory for storing instructions executable by the at least one processor, the instructions being executed by the at least one processor, causing the at least one processor to execute The above method of zone polymerization.
  • the method and device for regional aggregation of the present disclosure uses Manhattan distance to calculate the distance of the grid in the raster sequence to the grid in the problem area, and aggregates the grid satisfying the preset condition into the problem area, and outputs the problem. region.
  • the method and device for regional aggregation of the present disclosure are applicable to wireless signal coverage problems such as weak coverage, overlapping coverage, uplink interference, and pilot pollution, and can implement efficient and fast processing.
  • FIG. 1 shows the steps of a method of region aggregation in accordance with an embodiment of the present disclosure
  • FIG. 2 is a flow chart showing a method of area aggregation according to an embodiment of the present disclosure
  • Figure 3 shows a weak coverage scenario
  • Figure 5 illustrates the steps of the problem grid aggregation in the selection question grid sequence to the problem area in accordance with an embodiment of the present disclosure
  • FIG. 6 is a structural block diagram of an apparatus for area aggregation according to an embodiment of the present disclosure
  • FIG. 7 is a schematic diagram showing a method for generating a raster set and aggregation when a preset threshold is 2 in the embodiment of the present disclosure
  • FIG. 8 is a structural block diagram of an electronic device according to an embodiment of the present disclosure.
  • an embodiment of the present disclosure provides a method for area aggregation, including:
  • the wireless signal coverage area to be analyzed is divided into a grid array including a plurality of grids, wherein the size of the grid may be according to the size of the wireless signal coverage area to be analyzed or the coverage problem for different wireless signals. Make settings and filter the problem rasters with the same type of problem according to preset conditions (eg signal reception power, etc.).
  • all the problem grids obtained by the screening are sorted to generate a problem grid sequence, which can improve the efficiency of the problem grid aggregation and make the problem converge quickly.
  • the sorting of the problem grid may be a method of sorting according to the influence weight or sorting according to the size of the horizontal and vertical coordinate values of the question grid, or other sorting manner, and the disclosure is not limited thereto.
  • At least one question grid is selected from the problem grid sequence according to a predetermined rule, for example, selecting a predetermined number of problem grids that affect the maximum or minimum weight; or selecting a problem grid sorted by grid coordinate size At least one problem grid ranked in the front position, the last position, and other positions in the grid sequence, and deleting the at least one problem grid in the problem grid sequence can effectively improve the efficiency of the problem grid aggregation. It is worth noting that the at least one grid is selected from the problem grid sequence according to a predetermined rule, and may also be other preset rules, and the disclosure is not limited thereto.
  • S140 Determine an area to which each problem grid in at least one problem grid belongs, and obtain at least one Problem area
  • the at least one problem grid obtained by the screening is aggregated, that is, in at least two problem grids, when determining that the distance between the at least two problem grids is less than a preset threshold, the at least two The problem grids are merged into the same problem area, so that at least one problem grid can generate at least one problem area, which can effectively improve the efficiency of the problem area aggregation.
  • For at least one problem area perform the following operations one by one: from the remaining problem grid of the problem grid sequence, select a problem grid with a distance from at least one problem grid in the problem area that is less than a preset threshold, and aggregate Go to the problem area and remove the selected question grid from the problem raster sequence.
  • the aggregation process is separately performed, and the problem raster belonging to any problem area in the remaining grid of the problem raster sequence is aggregated into the corresponding problem area until the problem raster sequence There is no problem raster that can be aggregated into any problem area, and the problem raster that is aggregated into the problem area is removed from the problem raster sequence, where aggregation refers to the problematic raster sequence that belongs to the problem area
  • the problem grid is added to the problem area and a new problem area is generated.
  • aggregation may be performed for multiple problem areas, the aggregation efficiency of the problem grid may be improved, and the problem grid aggregated into the problem area may be deleted from the problem grid sequence, and the remaining grid in the problem grid sequence may be improved.
  • the processing efficiency of the grid may be performed for multiple problem areas, the aggregation efficiency of the problem grid may be improved, and the problem grid aggregated into the problem area may be deleted from the problem grid sequence, and the remaining grid in the problem grid sequence may be improved.
  • the method for area aggregation further includes:
  • each problem area and its included problem grid are output, if the problem raster sequence is The current length is not zero, returning the step of selecting at least one question grid from the question grid sequence according to a predetermined rule and deleting the at least one question grid from the question grid sequence.
  • all problem areas are aggregated until there is no energy in the problem grid sequence. Enough to aggregate to the problem raster in any problem area, and remove the problem raster from the problem raster sequence into the problem area, if the current problem raster sequence length is zero, then all problem areas and their Problem raster output.
  • a problem report is generated according to all problem grids in the problem area; if the problem raster sequence is The current length is not zero, returning the step of selecting at least one question grid from the question grid sequence according to a predetermined rule and deleting the at least one question grid from the question grid sequence.
  • the wireless signal coverage area to be analyzed is divided into multiple grids, and all problem grids that meet predetermined conditions are selected from multiple grids and sorted according to preset feature values to obtain a problem.
  • a raster sequence selecting at least one problem grid from the problem raster sequence according to a predetermined rule, and determining a problem region to which it belongs; selecting a problem raster remaining in the problem raster sequence and any problem grid in the problem region
  • a problem grid with a distance less than a preset threshold, aggregated into the problem area, and the grids that are aggregated into the problem area in the problem raster sequence are deleted, and the processing is performed on all problem areas until the problem grid There is no problem raster in the lattice sequence that can be aggregated into any problem area; if the length of the current problem raster sequence is zero, all problem areas and their problem grids are output, otherwise, return to select at least one problem grid Grid, and remove the step of the problem raster in the problem raster sequence.
  • the foregoing solution can be used for the weak coverage scenario shown in FIG. 3, and can also be applied to the wireless coverage problem such as the overlapping coverage scenario, the uplink interference scenario, or the pilot pollution scenario for area aggregation, and can implement efficient and fast processing.
  • the steps of selecting all the problem grids that meet the predetermined conditions from the grid array may include:
  • S410 Projecting the measurement report to a grid corresponding to the terminal location information according to the terminal location information in the measurement report of the terminal in the wireless signal coverage area;
  • the grid in the grid array may be set to a square, and the side length of the square grid is preset, and the grid coordinates are identified according to the size of the side length of the grid.
  • the measurement report is projected into the corresponding grid.
  • the grid coordinates are identified, and the operation is performed by integers.
  • the distance offsets in the horizontal and vertical directions of the grid coordinates are expressed by the same granularity, which can effectively improve the operation efficiency.
  • the preset feature value is an influence weight value
  • all the problem rasters are sorted according to the preset feature value
  • the step of obtaining a problem raster sequence includes:
  • All problem rasters are arranged in descending order according to the influence weights to generate a problem raster sequence
  • M represents the number of valid sample points in a single grid
  • S represents the total number of sample points in a single grid
  • X represents the impact factor
  • sample points are measurement reports
  • valid sample points are measurement reports for reaction-predetermined problems.
  • the influence weight of the corresponding problem grid is calculated according to the calculation formula of the impact weight Y of the grid.
  • the impact factor is a factor related to the characteristic index that can reflect the wireless signal coverage problem to be analyzed. For example, in the weak coverage problem, the influence factor is determined according to the signal receiving power capable of reflecting the weak coverage feature, and the signal receiving power is smaller. The weaker the energy, the greater the impact factor. According to the corresponding question The influence weight of the title grid sorts all problem rasters to generate a problem raster sequence.
  • the preset feature value includes a first sorting factor and a second sorting factor
  • the step of sorting all the problem rasters according to the preset feature value to obtain a problem raster sequence further comprising:
  • the problem grids are arranged in descending order, and the problem grids having the same first sorting factor are arranged in descending order according to the second sorting factor to generate a problem grid sequence;
  • the first sorting factor is one of a row number and a column number in the grid array
  • the second sorting factor is the other one of the row number and the column number in the grid array.
  • all problem rasters are arranged in descending order according to the row number of the problem grid, and the problem rasters having the same row number are arranged in descending order according to the column number of the problem grid to generate a problem raster sequence; or All problem rasters are sorted in descending order according to the column number of the problem grid, and the problem rasters with the same column number are sorted in descending order according to the row number of the problem grid to generate a problem raster sequence.
  • the steps of removing the selected question grid from the problem raster sequence may include:
  • the problem that belongs to the new raster set in the current remaining problem raster in the problem raster sequence The problem raster is aggregated into the current problem area until there is no problem raster in the problem raster sequence that has a Manhattan distance from at least one of the problem areas in the current problem area that is less than the preset threshold.
  • a grid with a Manhattan distance of at least one problem grid in the problem area less than a preset threshold is selected to generate a grid set.
  • select all the grids that meet the preset threshold in the grid array and only need to select the offset in the horizontal and vertical directions according to the preset threshold for all problem grids on the boundary of the problem area.
  • the process of generating a raster set and aggregation when the preset threshold is 2 is shown. In this way, the problem area is aggregated until the remaining problem grids in the problem raster sequence cannot be aggregated into the problem area according to the preset rule. This aggregation mode reduces the operation and improves the aggregation efficiency.
  • an embodiment of the present disclosure further provides an apparatus for area aggregation, including:
  • the processing module 601 is configured to divide the wireless signal coverage area to be analyzed into a grid array including a plurality of grids, and select all problem grids that meet predetermined conditions from the grid array;
  • the processing module 601 divides the wireless signal coverage area to be analyzed into a grid array including a plurality of grids, wherein the size of the grid may be according to the size of the wireless signal coverage area to be analyzed or for different wireless
  • the signal coverage problem is set and the problem raster with the same type of problem is filtered according to preset conditions (eg, signal reception power, etc.).
  • the sorting module 602 is configured to sort all the problem grids according to the preset feature values to obtain a question grid sequence
  • the sorting module 602 sorts all the problem grids obtained by the filtering to generate a problem grid sequence, which can improve the efficiency of the problem grid aggregation and make the problem converge quickly.
  • the sorting of the problem grid may be a method of sorting according to the influence weight or sorting according to the size of the horizontal and vertical coordinate values of the question grid, or other sorting manner, and the disclosure is not limited thereto.
  • the screening module 603 is configured to select at least one question grid from the problem grid sequence according to a predetermined rule, and delete the at least one question grid from the question grid sequence;
  • the screening module 603 selects at least one grid from the problem grid sequence according to a predetermined rule, for example, selecting a predetermined number of problem grids that affect the maximum or minimum weight; or selecting sorting according to the grid coordinate size.
  • a predetermined rule for example, selecting a predetermined number of problem grids that affect the maximum or minimum weight; or selecting sorting according to the grid coordinate size.
  • At least one problem grid ranked in the front position, the last position, and other positions in the problem raster sequence, and deleting the at least one problem grid in the problem raster sequence can effectively improve the efficiency of the problem grid aggregation.
  • the at least one grid is selected from the problem grid sequence according to a predetermined rule, and may also be other preset rules, and the disclosure is not limited thereto.
  • the generating module 604 is configured to determine an area to which each problem grid in the at least one problem grid belongs, to obtain at least one problem area;
  • the generating module 604 performs aggregation processing on the at least one problem raster obtained by the screening, that is, in the at least two problem grids, when determining that the distance between the at least two problem grids is less than a preset threshold, The at least two problem grids are merged into the same problem area, so that at least one problem grid can generate at least one problem area, which can effectively improve the efficiency of the problem area aggregation.
  • the aggregation module 605 is configured to perform the following operations one by one for the at least one problem area: selecting, from the remaining problem grid of the problem grid sequence, a distance from the at least one problem grid in the problem area is less than a predetermined threshold A raster that is aggregated into the problem area and removes the selected problem raster from the problem raster sequence.
  • the aggregation module 605 performs aggregation processing on the at least one problem area, and aggregates the problem grids belonging to any problem area in the remaining grids of the problem grid sequence into the corresponding problem areas until the problem grid There is no problem raster in the grid sequence that can be aggregated into any problem area, and the problem raster that is aggregated into the problem area is removed from the problem raster sequence. In this manner, aggregation may be performed for multiple problem areas, which can improve the aggregation efficiency of the problem grid, and the problem raster order Deleting the problem raster aggregated into the problem area in the column improves the processing efficiency for the remaining rasters in the problem raster sequence.
  • the device for regional aggregation may also include:
  • the determining module 606 is configured to, after performing the foregoing operations on all the problem areas in the at least one problem area, if the current length of the problem raster sequence is zero, output each problem area and the problem grid included therein, otherwise Returning to the step of selecting at least one question grid from the question grid sequence and removing the at least one question grid from the question grid sequence according to a predetermined rule.
  • the determining module 606 aggregates all problem areas until there is no problem raster in the problem grid sequence that can be aggregated into any problem area, and removes the aggregation from the problem grid sequence into the problem area. After the problem raster, if the current problem raster sequence length is zero, all problem areas and their problem rasters are output. When it is judged that the number of grids in the output problem area is greater than a preset threshold or the area value of the problem area is greater than a preset threshold, a problem report is generated according to all the problem grids in the problem area; otherwise, the return is according to a predetermined rule. , the step of selecting at least one problem raster from the problem raster sequence and removing the at least one problem raster from the problem raster sequence.
  • the foregoing solution can be used for the weak coverage scenario shown in FIG. 3, and can also be applied to the wireless coverage problem such as the overlapping coverage scenario, the uplink interference scenario, or the pilot pollution scenario for area aggregation, and can implement efficient and fast processing.
  • processing module 601 includes:
  • the first processing unit is configured to project the measurement report to the grid corresponding to the terminal location information according to the terminal location information in the measurement report of the terminal in the wireless signal coverage area;
  • the grid in the grid array may be set to a square, and the side length of the square grid is preset, and the grid coordinates are identified according to the size of the side length of the grid.
  • the first processing unit according to the terminal location information in the measurement report, for example, the latitude and longitude information in the terminal location information, and according to the longitude and latitude
  • the entire method corresponds to the grid coordinates and the measurement report is projected into the corresponding grid.
  • the grid coordinates are identified, and the operation is performed by integers.
  • the distance offsets in the horizontal and vertical directions of the grid coordinates are expressed by the same granularity, which can effectively improve the operation efficiency.
  • the second processing unit is configured to select a grid containing the measurement report reflecting the predetermined problem as a problem grid according to the problem reflected by the measurement report in each grid.
  • the second processing unit selects, according to the problem reflected in the measurement report, all the grids corresponding to the measurement reports reflecting the same type of problems in the grid array as the problem grid.
  • the preset feature value is an influence weight
  • the sorting module 602 includes:
  • a first sorting unit configured to sort all problem rasters in descending order according to the influence weight to generate a problem raster sequence
  • M represents the number of valid sample points in a single grid
  • S represents the total number of sample points in a single grid
  • X represents the impact factor
  • sample points are measurement reports
  • valid sample points are measurement reports for reaction-predetermined problems.
  • the first sorting unit calculates the influence weight of the corresponding question grid according to the calculation formula of the influence weight Y of the grid.
  • the impact factor is a factor related to the characteristic index that can reflect the wireless signal coverage problem to be analyzed. For example, in the weak coverage problem, the influence factor is determined according to the signal receiving power capable of reflecting the weak coverage feature, and the signal receiving power is smaller. The weaker the energy, the greater the impact factor. All problem rasters are sorted according to the impact weight of the corresponding question grid to generate a problem raster sequence.
  • the preset feature value includes a first sorting factor and a second sorting factor
  • the sorting module 602 further includes include:
  • a second sorting unit is configured to sort all the problem rasters in descending order according to the first sorting factor, and perform descending order on the problem grids having the same first sorting factor according to the second sorting factor to generate a final raster sequence.
  • the first sorting factor is one of a row number and a column number in the grid array
  • the second sorting factor is the other one of the row number and the column number in the grid array.
  • the second sorting unit sorts all the problem grids in descending order according to the row number of the question grid, and sorts the problem grids with the same line number in descending order according to the column number of the question grid to generate a problem grid. Sequence; or, sort all problem rasters in descending order according to the column number of the question grid, and sort the problem rasters with the same column number in descending order according to the row number of the problem grid to generate a problem raster sequence.
  • the aggregation module 605 includes:
  • a first generating unit configured to select, in the grid array, a grid with a Manhattan distance of at least one problem grid in the problem area that is less than a preset threshold, to generate a grid set, wherein each grid in the grid array
  • the grids correspond to square coverage areas of the same size
  • a first aggregation unit configured to aggregate a problem raster belonging to the raster set in the remaining problem raster of the problem raster sequence into the problem area, obtain a new problem area, and aggregate into the problem area The problem raster is removed from the problem raster sequence;
  • a second generating unit configured to select, in the grid array, a grid with a Manhattan distance of at least one problem grid in the new problem area being less than a preset threshold, to generate a new grid set
  • a second aggregating unit configured to aggregate the problem raster belonging to the new raster set in the currently remaining problem raster in the problem raster sequence into the current problem region until the problem raster sequence does not exist with the current At least one problem grid in the problem area has a Manhattan distance less than a preset threshold grid.
  • a grid with a Manhattan distance of at least one problem grid in the problem area less than a preset threshold is selected to generate a grid set.
  • select all the grids that meet the preset threshold in the grid array and only need to select the offset in the horizontal and vertical directions according to the preset threshold for all problem grids on the boundary of the problem area.
  • the problem area is aggregated until the remaining problem grids in the problem raster sequence cannot be aggregated into the problem area according to the preset rule. This aggregation mode reduces the operation and improves the aggregation efficiency.
  • the wireless signal region is divided into a grid array including a plurality of grids, and the problem grid in the grid array is analyzed. Sort the rasters of the same type of problem and generate a problem raster sequence, select the problem raster in the problem raster sequence and generate the problem area.
  • the Manhattan distance is used to calculate the distance from the grid in the raster sequence to the grid in the problem area, and the grid that meets the preset conditions is aggregated into the problem area, and the problem area is output.
  • the scheme can be applied to wireless signal coverage problems such as weak coverage, overlapping coverage, uplink interference, and pilot pollution, and can implement efficient and fast processing.
  • the present disclosure also provides a non-transitory storage medium storing computer executable instructions arranged to perform the method of region aggregation of the above embodiments.
  • the present disclosure also provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer, A method of causing the computer to perform the area aggregation of the above embodiment.
  • FIG. 8 is a structural block diagram of an electronic device according to an embodiment of the present disclosure.
  • the electronic device may include a processor 801 and a memory 803, and may also To include a Communications Interface 802 and a bus 804.
  • the processor 801, the communication interface 802, and the memory 803 can complete communication with each other through the bus 804.
  • Communication interface 802 can be used for information transmission.
  • the processor 801 can call the logic instructions in the memory 803 to perform the method of region aggregation of the above embodiment.
  • the logic instructions in the memory 803 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the technical solution of the present disclosure may be embodied in the form of a software product stored in a storage medium, including a plurality of instructions for causing a computer device (which may be a personal computer, a server, or a network) The device or the like) performs all or part of the steps of the method described in various embodiments of the present disclosure.
  • the foregoing storage medium may be a non-transitory storage medium, including: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
  • a medium that can store program code, or a transitory storage medium including: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
  • the present disclosure uses the Manhattan distance to calculate the distance of the grid in the raster sequence to the grid in the problem area, and aggregates the grid that satisfies the preset condition into the problem area and outputs the problem area.
  • the scheme can be applied to wireless signal coverage problems such as weak coverage, overlapping coverage, uplink interference, and pilot pollution, and can implement efficient and fast processing.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Image Analysis (AREA)

Abstract

本公开公开了一种区域聚合的方法及装置，该方法包括：将待分析的无线信号覆盖区域划分为多个栅格，从多个栅格中选出符合预定条件的全部问题栅格并按照预设特征值对其进行排序得到一问题栅格序列；按照预定规则，从该问题栅格序列中选择至少一个问题栅格，删除问题栅格序列中该至少一个问题栅格，并确定该至少一个问题栅格所属的问题区域；从问题栅格序列中剩余的问题栅格中选择与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域直至不能再聚合为止。

Description

区域聚合的方法及装置 技术领域
本公开涉及通信技术领域，例如涉及一种问题区域聚合的方法及装置。
背景技术
随着无线网络的发展，地理信息系统(Geographic Information System或Geo-Information system，简称GIS)展示功能成为网络优化工具的利器，通过GIS展示用户数据分析结果，能够直观地发现问题位置。而对于一些网络覆盖问题，GIS栅格展示的面积粒度太小，移动运营商更为关注广泛的成片区域性问题。通过GIS给用户展示成片的问题区域，使得移动运营商能够直观地发现成片区域性问题，并有针对性地采取优化解决措施。
相关技术的网络优化工具和系统，大多通过GIS展示问题位置都是通过小区、采样点和栅格维度展示，尤其是对应覆盖问题，采样点和问题栅格范围太小，不能满足移动运营商及时直观发现成片区域性问题的需求。成片区域性问题需要人工绘制标记，不够智能。
相关技术的问题区域生成方法，一种是选择随机选取问题栅格为中心点，以中心点为圆心，H为半径的圆范围内的问题栅格组成问题区域，一个区域的大小不会超过圆的大小。另一种是使用军事栅格坐标标识问题栅格。无论哪种方案，分析顺序都是随机的，都是使用欧氏距离判定栅格是否属于某区域，计算复杂，效率低。
发明内容
本公开提供了一种问题区域聚合的方法及装置，可提高计算效率。
本公开的实施例提供了一种区域聚合的方法，包括：
将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，从所述栅格阵列中选出所有符合预定条件的问题栅格；
按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列；
按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除；
确定所述至少一个问题栅格中各个问题栅格所属的区域，获得至少一个问题区域；
针对所述至少一个问题区域，逐个进行以下操作：从所述问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从所述问题栅格序列中删除。
可选地，所述方法还包括：
在对所述至少一个问题区域中的所有问题区域均执行完所述操作后，若所述问题栅格序列的当前长度为零，则输出各个问题区域及其所包含的问题栅格，若所述问题栅格序列的当前长度不为零，返回所述按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除的步骤。
可选地，所述从所述栅格阵列中选出所有符合预定条件的问题栅格的步骤，包括：
根据所述无线信号覆盖区域内终端的测量报告中的终端位置信息，将测量 报告投影到所述终端位置信息对应的栅格；
根据各个栅格内的测量报告反映的问题，选择出包含有反映预定问题的测量报告的栅格，作为问题栅格。
可选地，所述预设特征值为影响权值，所述按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列的步骤，包括：
按照影响权值对所有的问题栅格进行降序排列，生成问题栅格序列；
其中，所述影响权值Y的计算公式为：
Figure PCTCN2016104010-appb-000001
其中，M表示单个栅格中的有效样本点的数量，S表示单个栅格中的样本点的总数量，X表示影响因子，所述样本点为测量报告，有效样本点为反应预定问题的测量报告。
可选地，所述预设特征值包括第一排序因子和第二排序因子，所述按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列的步骤，还包括：
按照第一排序因子，对所有问题栅格进行降序排列，并按照第二排序因子对具有相同的第一排序因子的问题栅格进行降序排列，生成最终的栅格序列；
其中，所述第一排序因子为栅格阵列中的行号和列号中的其中一个，所述第二排序因子为栅格阵列中的行号和列号中的另外一个。
可选地，所述从所述问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从所述问题栅格序列中删除的步骤，包括：
在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成一栅格集合，其中，所述栅格阵列中的每个栅格均对应相 同大小的正方形覆盖区域；
将问题栅格序列剩余的问题栅格中属于该栅格集合的问题栅格聚合到该问题区域中，获得一新的问题区域，并将聚合到该问题区域中的问题栅格从所述问题栅格序列中删除；
在栅格阵列中，选择与新的问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成新的栅格集合；
将问题栅格序列中当前剩余的问题栅格中属于该新的栅格集合的问题栅格聚合到当前的问题区域中，直至所述问题栅格序列中不存在与当前的问题区域中的至少一个问题栅格的曼哈顿距离小于预设门限的问题栅格。
本公开实施例还提供一种区域聚合的装置，包括：
处理模块，设置为将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，从所述栅格阵列中选出所有符合预定条件的问题栅格；
排序模块，设置为按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列；
筛选模块，设置为按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除；
生成模块，设置为确定所述至少一个问题栅格中各个问题栅格所属的区域，获得至少一个问题区域；以及
聚合模块，设置为针对所述至少一个问题区域，逐个进行以下操作：从所述问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从所述问题栅格序列中删除。
可选地，所述装置还包括：
判断模块，设置为在对所述至少一个问题区域中的所有问题区域均执行完所述操作后，若所述问题栅格序列的当前长度为零，则输出各个问题区域及其所包含的问题栅格，若所述问题栅格序列的当前长度不为零，返回所述按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除的步骤。
可选地，所述处理模块包括：
第一处理单元，设置为根据所述无线信号覆盖区域内终端的测量报告中的终端位置信息，将测量报告投影到所述终端位置信息对应的栅格；
第二处理单元，设置为根据各个栅格内的测量报告反映的问题，选择出包含有反映预定问题的测量报告的栅格，作为问题栅格。
可选地，所述预设特征值为影响权值，所述排序模块包括：
第一排序单元，设置为按照影响权值对所有的问题栅格进行降序排列，生成问题栅格序列；
其中，所述影响权值Y的计算公式为：
Figure PCTCN2016104010-appb-000002
其中，M表示单个栅格中的有效样本点的数量，S表示单个栅格中的样本点的总数量，X表示影响因子，所述样本点为测量报告，有效样本点为反应预定问题的测量报告。
可选地，所述预设特征值包括第一排序因子和第二排序因子，所述排序模块还包括：
第二排序单元，设置为按照第一排序因子，对所有问题栅格进行降序排列，并按照第二排序因子对具有相同的第一排序因子的问题栅格进行降序排列，生 成最终的栅格序列；
其中，所述第一排序因子为栅格阵列中的行号和列号中的其中一个，所述第二排序因子为栅格阵列中的行号和列号中的另外一个。
可选地，所述聚合模块包括：
第一生成单元，设置为在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成一栅格集合，其中，所述栅格阵列中的每个栅格均对应相同大小的正方形覆盖区域；
第一聚合单元，设置为将问题栅格序列剩余的栅格中属于该问题栅格集合的问题栅格聚合到该问题区域中，获得一新的问题区域，并将聚合到该问题区域中的问题栅格从所述栅格序列中删除；
第二生成单元，设置为在栅格阵列中，选择与新的问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成新的栅格集合；
第二聚合单元，设置为将问题栅格序列中当前剩余的问题栅格中属于该新的栅格集合的问题栅格聚合到当前的问题区域中，直至所述问题栅格序列中不存在与当前的问题区域中的至少一个问题栅格的曼哈顿距离小于预设门限的问题栅格。
根据本公开的又一方面，提供了一种非暂态存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述的区域聚合的方法。
根据本公开的又一方面，提供了一种计算机程序产品，所述计算机程序产品包括存储在非暂态计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行上述的区域聚合的方法。
根据本公开的又一方面，提供了一种电子设备，包括至少一个处理器和与 所述至少一个处理器通信连接的存储器，所述存储器用于存储可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行时，使所述至少一个处理器执行上述的区域聚合的方法。
本公开的区域聚合的方法及装置，采用曼哈顿距离计算栅格序列中的栅格到问题区域中的栅格的距离，并把满足预设条件的栅格聚合到问题区域中，并输出该问题区域。本公开的区域聚合的方法及装置适用于弱覆盖、重叠覆盖、上行干扰、导频污染等无线信号覆盖问题，且能够实现高效快速处理。
附图说明
图1表示本公开实施例的一种区域聚合的方法的步骤；
图2表示本公开实施例的一种区域聚合的方法的流程图；
图3表示弱覆盖场景；
图4表示本公开实施例的从栅格阵列中选出所有符合预定条件的问题栅格的步骤；
图5表示本公开实施例的选择问题栅格序列中的问题栅格聚合至该问题区域的步骤；
图6表示本公开实施例的一种区域聚合的装置的结构框图；
图7表示本公开实施例的预设门限为2时生成栅格集合以及聚合的方法的示意图；
图8为本公开实施例提供的电子设备的结构框图。
具体实施方式
以下结合说明书附图对本公开的实施例进行说明，应当理解，此处所描述的实施例仅用于说明和解释本公开，并不用于限定本公开，并且在不冲突的情 况下，本公开中的实施例及实施例中的特征可以相互组合。
如图1所示，本公开的实施例提供了一种区域聚合的方法，包括：
S110、将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，从栅格阵列中选出所有符合预定条件的问题栅格；
该实施例中，将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，其中，栅格的大小可以根据待分析的无线信号覆盖区域的大小或者针对不同的无线信号覆盖问题进行设定，并按照预设条件(例如：信号接收功率等)，筛选出具有同一类问题的问题栅格。
S120、按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列；
该实施例中，对筛选得到的所有问题栅格进行排序，生成问题栅格序列，能够提高问题栅格聚合的效率，使得问题快速收敛。对问题栅格进行排序可以是按照影响权值进行排序或者按照问题栅格的横纵坐标值的大小进行排序的方式或者其他排序方式，本公开不以此为限。
S130、按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从问题栅格序列中删除；
该实施例中，按照预定规则，从问题栅格序列中选择至少一个问题栅格，例如：选择影响权值最大或者最小的预定数量的问题栅格；或者选择按照栅格坐标大小排序的问题栅格序列中排在最前位置、最后位置和中间其他位置中的至少一个问题栅格，并在该问题栅格序列中删除该至少一个问题栅格，能够有效提高问题栅格聚合的效率。值得说明的是，按照预定规则从问题栅格序列中选择至少一个栅格，还可以是其他预设规则，本公开不以此为限。
S140、确定至少一个问题栅格中各个问题栅格所属的区域，获得至少一个 问题区域；
该实施例中，对筛选得到的至少一个问题栅格进行聚合处理，即在至少两个问题栅格中，在判断至少两个问题栅格之间的距离小于预设门限时，将该至少两个问题栅格合并为同一个问题区域，这样至少一个问题栅格能至少生成一个问题区域，能够有效提高对问题区域聚合的效率。
S150、针对至少一个问题区域，逐个进行以下操作：从问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从问题栅格序列中删除。
该实施例中，针对至少一个问题区域，分别进行聚合处理，将问题栅格序列剩余的栅格中属于任一问题区域的问题栅格，聚合到对应的问题区域中，直至问题栅格序列中不存在能够聚合到任一问题区域中的问题栅格，并将聚合到问题区域中的问题栅格从问题栅格序列中删除，其中，聚合是指将问题栅格序列中属于该问题区域的问题栅格加入至该问题区域中，并生成新的问题区域。该方式中可以是针对多个问题区域进行聚合，能够提高问题栅格的聚合效率，并且从问题栅格序列中删除聚合到问题区域中的问题栅格，能够提高针对问题栅格序列中剩余栅格的处理效率。
可选地，区域聚合的方法还包括：
在对至少一个问题区域中的所有问题区域均执行完所述操作后，若问题栅格序列的当前长度为零，则输出各个问题区域及其所包含的问题栅格，若问题栅格序列的当前长度不为零，返回按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从问题栅格序列中删除的步骤。
该实施例中，在对所有问题区域进行聚合，直至问题栅格序列中不存在能 够聚合到任一问题区域中的问题栅格，并从问题栅格序列中删除聚合到问题区域中的问题栅格后，如果当前的问题栅格序列长度为零时，将所有问题区域及其问题栅格输出。在判断输出的问题区域中的栅格个数大于一预设门限或者问题区域的面积值大于一预设门限时，则按照问题区域中的所有问题栅格生成问题报告；若问题栅格序列的当前长度不为零，返回按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从问题栅格序列中删除的步骤。
如图2所示，将待分析的无线信号覆盖区域划分为多个栅格，从多个栅格中选出符合预定条件的全部问题栅格并按照预设特征值对其进行排序得到一问题栅格序列；按照预定规则，从该问题栅格序列中选择至少一个问题栅格，并确定其所属的问题区域；选择问题栅格序列中剩余的问题栅格与该问题区域中任一问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域中，并且删除问题栅格序列中聚合到问题区域中的栅格，并对所有的问题区域均执行该处理，直至问题栅格序列中不存在能聚合到任一问题区域中的问题栅格；如果当前的问题栅格序列的长度为零，则输出所有问题区域及其问题栅格，否则，返回到选择至少一个问题栅格，并删除问题栅格序列中的该问题栅格的步骤。
上述方案可用于如图3所示的弱覆盖场景，还可以适用于重叠覆盖场景、上行干扰场景或者导频污染场景等无线信号覆盖问题进行区域聚合，并且能够实现高效快速的处理。
如图4所示，从栅格阵列中选出所有符合预定条件的问题栅格的步骤，可以包括：
S410、根据无线信号覆盖区域内终端的测量报告中的终端位置信息，将测量报告投影到终端位置信息对应的栅格；
该实施例中，可以是将栅格阵列中的栅格设置为正方形，并预设正方形栅格的边长，按照栅格边长的大小标识栅格坐标。按照测量报告中的终端位置信息，例如：终端位置信息中的经纬度信息，并按照经度和纬度取整的方式对应栅格坐标，将测量报告投影到对应的栅格中。采用该方式标识栅格坐标，其运算过程中均是通过整数进行，栅格坐标中横、纵方向上的距离偏移均是通过相同的粒度表示，能够有效的提高运算效率。
S420、根据每个栅格内的测量报告反映的问题，选择出包含有反映预定问题的测量报告的栅格，作为问题栅格。
该实施例中，根据测量报告中反映的问题，选择栅格阵列中所有反映同一类问题的测量报告对应的栅格，作为问题栅格。
可选地，预设特征值为影响权值，按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列的步骤，包括：
按照影响权值对所有的问题栅格进行降序排列，生成问题栅格序列；
其中，影响权值Y的计算公式为：
Figure PCTCN2016104010-appb-000003
其中，M表示单个栅格中的有效样本点的数量，S表示单个栅格中的样本点的总数量，X表示影响因子，样本点为测量报告，有效样本点为反应预定问题的测量报告。
该实施例中，按照栅格的影响权值Y的计算公式，计算对应问题栅格的影响权值。其中，影响因子为能够体现待分析的无线信号覆盖问题的特征性指标相关的因子，例如：弱覆盖问题中，根据能够体现弱覆盖特点的信号接收功率确定影响因子，其信号接收功率越小，能量就越弱，影响因子越大。按照对应问 题栅格的影响权值大小对所有问题栅格进行排序，生成问题栅格序列。
可选地，预设特征值包括第一排序因子和第二排序因子，按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列的步骤，还包括：
按照第一排序因子，对所有问题栅格进行降序排列，并按照第二排序因子对具有相同的第一排序因子的问题栅格进行降序排列，生成问题栅格序列；
其中，第一排序因子为栅格阵列中的行号和列号中的其中一个，第二排序因子为栅格阵列中的行号和列号中的另外一个。
该实施例中，按照问题栅格的行号对所有问题栅格进行降序排列，并按照问题栅格的列号对具有相同行号的问题栅格进行降序排列，生成问题栅格序列；或者，按照问题栅格的列号对所有问题栅格进行降序排列，并按照问题栅格的行号对具有相同列号的问题栅格进行降序排列，生成问题栅格序列。
如图5所示，从问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从问题栅格序列中删除的步骤，可以包括：
S510、在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成一栅格集合，其中，栅格阵列中的每个栅格均对应相同大小的正方形覆盖区域；
S520、将问题栅格序列剩余的问题栅格中属于该栅格集合的问题栅格聚合到该问题区域中，获得一新的问题区域，并将聚合到该问题区域中的问题栅格从问题栅格序列中删除；
S530、在栅格阵列中，选择与新的问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成新的栅格集合；
S540、将问题栅格序列中当前剩余的问题栅格中属于该新的栅格集合的问 题栅格聚合到当前的问题区域中，直至问题栅格序列中不存在与当前的问题区域中的至少一个问题栅格的曼哈顿距离小于预设门限的问题栅格。
该实施例中，在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成栅格集合。针对问题区域的边界上的问题栅格，在栅格阵列中选择满足预设门限的所有栅格，只需要针对问题区域边界上的所有问题栅格选择横纵方向上按照预设门限偏移的所有栅格，便可以获得栅格集合，不需要对问题栅格序列中剩余的所有问题栅格计算到问题区域的曼哈顿距离。参见图7，示出了预设门限值为2时生成栅格集合以及聚合的过程。以此方式对问题区域进行聚合处理，直至问题栅格序列中剩余的问题栅格都不能按照预设规则聚合到问题区域中，该聚合方式减少了运算，提高了聚合效率。
如图6所示，本公开实施例还提供了一种区域聚合的装置，包括：
处理模块601，设置为将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，从栅格阵列中选出所有符合预定条件的问题栅格；
该实施例中，处理模块601将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，其中，栅格的大小可以根据待分析的无线信号覆盖区域的大小或者针对不同的无线信号覆盖问题进行设定，并按照预设条件(例如：信号接收功率等)，筛选出具有同一类问题的问题栅格。
排序模块602，设置为按照预设特征值，对所有的问题栅格进行排序，获得一问题栅格序列；
该实施例中，排序模块602对筛选得到的所有问题栅格进行排序，生成问题栅格序列，能够提高问题栅格聚合的效率，使得问题快速收敛。对问题栅格进行排序可以是按照影响权值进行排序或者按照问题栅格的横纵坐标值的大小进行排序的方式或者其他排序方式，本公开不以此为限。
筛选模块603，设置为按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从问题栅格序列中删除；
该实施例中，筛选模块603按照预定规则，从问题栅格序列中选择至少一个栅格，例如：选择影响权值最大或者最小的预定数量的问题栅格；或者选择按照栅格坐标大小排序的问题栅格序列中排在最前位置、最后位置和中间其他位置中的至少一个问题栅格，并在该问题栅格序列中删除该至少一个问题栅格，能够有效提高问题栅格聚合的效率。值得说明的是，按照预定规则从问题栅格序列中选择至少一个栅格，还可以是其他预设规则，本公开不以此为限。
生成模块604，设置为确定至少一个问题栅格中各个问题栅格所属的区域，获得至少一个问题区域；
该实施例中，生成模块604对筛选得到的至少一个问题栅格进行聚合处理，即在至少两个问题栅格中，在判断至少两个问题栅格之间的距离小于预设门限时，将该至少两个问题栅格合并为同一个问题区域，这样至少一个问题栅格能至少生成一个问题区域，能够有效提高对问题区域聚合的效率。
聚合模块605，设置为针对至少一个问题区域，逐个进行以下操作：从问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从问题栅格序列中删除。
该实施例中，聚合模块605针对至少一个问题区域，分别进行聚合处理，将问题栅格序列剩余的栅格中属于任一问题区域的问题栅格，聚合到对应的问题区域中，直至问题栅格序列中不存在能够聚合到任一问题区域中的问题栅格，并将聚合到问题区域中的问题栅格从问题栅格序列中删除。该方式中可以是针对多个问题区域进行聚合，能够提高问题栅格的聚合效率，并且从问题栅格序 列中删除聚合到问题区域中的问题栅格，能够提高针对问题栅格序列中剩余栅格的处理效率。
区域聚合的装置还可以包括：
判断模块606，设置为在对至少一个问题区域中的所有问题区域均执行完上述操作后，若问题栅格序列的当前长度为零，则输出各个问题区域及其所包含的问题栅格，否则，返回按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从问题栅格序列中删除的步骤。
该实施例中，判断模块606在对所有问题区域进行聚合，直至问题栅格序列中不存在能够聚合到任一问题区域中的问题栅格，并从问题栅格序列中删除聚合到问题区域中的问题栅格后，如果当前的问题栅格序列长度为零时，将所有问题区域及其问题栅格输出。在判断输出的问题区域中的栅格个数大于一预设门限或者问题区域的面积值大于一预设门限时，则按照问题区域中的所有问题栅格生成问题报告；否则，返回按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从问题栅格序列中删除的步骤。
上述方案可用于如图3所示的弱覆盖场景，还可以适用于重叠覆盖场景、上行干扰场景或者导频污染场景等无线信号覆盖问题进行区域聚合，并且能够实现高效快速的处理。
可选地，处理模块601包括：
第一处理单元，设置为根据无线信号覆盖区域内终端的测量报告中的终端位置信息，将测量报告投影到终端位置信息对应的栅格；
该实施例中，可以是将栅格阵列中的栅格设置为正方形，并预设正方形栅格的边长，按照栅格边长的大小标识栅格坐标。第一处理单元按照测量报告中的终端位置信息，例如：终端位置信息中的经纬度信息，并按照经度和纬度取 整的方式对应栅格坐标，将测量报告投影到对应的栅格中。采用该方式标识栅格坐标，其运算过程中均是通过整数进行，栅格坐标中横、纵方向上的距离偏移均是通过相同的粒度表示，能够有效的提高运算效率。
第二处理单元，设置为根据各个栅格内的测量报告反映的问题，选择出包含有反映预定问题的测量报告的栅格，作为问题栅格。
该实施例中，第二处理单元根据测量报告中反映的问题，选择栅格阵列中所有反映同一类问题的测量报告对应的栅格，作为问题栅格。
可选地，预设特征值为影响权值，排序模块602包括：
第一排序单元，设置为按照影响权值对所有的问题栅格进行降序排列，生成问题栅格序列；
其中，影响权值Y的计算公式为：
Figure PCTCN2016104010-appb-000004
其中，M表示单个栅格中的有效样本点的数量，S表示单个栅格中的样本点的总数量，X表示影响因子，样本点为测量报告，有效样本点为反应预定问题的测量报告。
该实施例中，第一排序单元按照栅格的影响权值Y的计算公式，计算对应问题栅格的影响权值。其中，影响因子为能够体现待分析的无线信号覆盖问题的特征性指标相关的因子，例如：弱覆盖问题中，根据能够体现弱覆盖特点的信号接收功率确定影响因子，其信号接收功率越小，能量就越弱，影响因子越大。按照对应问题栅格的影响权值大小对所有问题栅格进行排序，生成问题栅格序列。
可选地，预设特征值包括第一排序因子和第二排序因子，排序模块602还包 括：
第二排序单元，设置为按照第一排序因子，对所有问题栅格进行降序排列，并按照第二排序因子对具有相同的第一排序因子的问题栅格进行降序排列，生成最终的栅格序列；
其中，第一排序因子为栅格阵列中的行号和列号中的其中一个，第二排序因子为栅格阵列中的行号和列号中的另外一个。
该实施例中，第二排序单元按照问题栅格的行号对所有问题栅格进行降序排列，并按照问题栅格的列号对具有相同行号的问题栅格进行降序排列，生成问题栅格序列；或者，按照问题栅格的列号对所有问题栅格进行降序排列，并按照问题栅格的行号对具有相同列号的问题栅格进行降序排列，生成问题栅格序列。
可选地，聚合模块605包括：
第一生成单元，设置为在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成一栅格集合，其中，栅格阵列中的每个栅格均对应相同大小的正方形覆盖区域；
第一聚合单元，设置为将问题栅格序列剩余的问题栅格中属于该栅格集合的问题栅格聚合到该问题区域中，获得一新的问题区域，并将聚合到该问题区域中的问题栅格从问题栅格序列中删除；
第二生成单元，设置为在栅格阵列中，选择与新的问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成新的栅格集合；
第二聚合单元，设置为将问题栅格序列中当前剩余的问题栅格中属于该新的栅格集合的问题栅格聚合到当前的问题区域中，直至问题栅格序列中不存在与当前的问题区域中的至少一个问题栅格的曼哈顿距离小于预设门限的问题栅 格。
该实施例中，在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成栅格集合。针对问题区域的边界上的问题栅格，在栅格阵列中选择满足预设门限的所有栅格，只需要针对问题区域边界上的所有问题栅格选择横纵方向上按照预设门限偏移的所有栅格，便可以获得栅格集合，不需要对问题栅格序列中剩余的所有问题栅格计算到问题区域的曼哈顿距离。以此方式对问题区域进行聚合处理，直至问题栅格序列中剩余的问题栅格都不能按照预设规则聚合到问题区域中，该聚合方式减少了运算，提高了聚合效率。
上述方案中，通过将无线信号区域划分为包括多个栅格的栅格阵列，并对栅格阵列中的问题栅格进行分析。将同一类问题的栅格进行排序，并生成问题栅格序列，并在问题栅格序列中选择问题栅格并生成问题区域。采用曼哈顿距离计算栅格序列中的栅格到问题区域中的栅格的距离，并把满足预设条件的栅格聚合到问题区域中，并输出该问题区域。该方案可适用于弱覆盖、重叠覆盖、上行干扰、导频污染等无线信号覆盖问题，且能够实现高效快速处理。
本公开还提供了一种非暂态存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述实施例的区域聚合的方法。
本公开还提供了一种计算机程序产品，所述计算机程序产品包括存储在非暂态计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行上述实施例的区域聚合的方法。
本公开还提供了一种电子设备。图8是本公开实施例提供的电子设备的结构框图。该电子设备可以包括：处理器(processor)801和存储器(memory)803，还可 以包括通信接口(Communications Interface)802和总线804。其中，处理器801、通信接口802、存储器803可以通过总线804完成相互间的通信。通信接口802可以用于信息传输。处理器801可以调用存储器803中的逻辑指令，以执行上述实施例的区域聚合的方法。
此外，上述的存储器803中的逻辑指令可以通过软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本公开的技术方案可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开各个实施例所述方法的全部或部分步骤。而前述的存储介质可以是非暂态存储介质，包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质，也可以是暂态存储介质。
以上仅为本公开的部分实施例，并非因此限制本公开的专利范围，凡是利用本公开说明书及附图内容所作的等效结构或等效流程变换，或直接或间接运用在其他相关的技术领域，均同理包括在本公开的专利保护范围内。
工业实用性
本公开采用曼哈顿距离计算栅格序列中的栅格到问题区域中的栅格的距离，并把满足预设条件的栅格聚合到问题区域中，并输出该问题区域。该方案可适用于弱覆盖、重叠覆盖、上行干扰、导频污染等无线信号覆盖问题，且能够实现高效快速处理。

Claims (15)

  1. 一种区域聚合的方法，包括：
    将待分析的无线信号覆盖区域划分为栅格阵列，从所述栅格阵列中选出所有符合预定条件的问题栅格；
    按照预设特征值，对所有的问题栅格进行排序，获得问题栅格序列；
    按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将所述至少一个问题栅格从所述问题栅格序列中删除；
    确定所述至少一个问题栅格中每个问题栅格所属的区域，以获得至少一个问题区域；以及
    针对所述至少一个问题区域，逐个进行以下操作：从所述问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从所述问题栅格序列中删除。
  2. 根据权利要求1所述的区域聚合的方法，还包括：
    在对所述至少一个问题区域中的所有问题区域均执行完所述操作后，若所述问题栅格序列的当前长度为零，则输出各个问题区域及其所包含的问题栅格，若所述问题栅格序列的当前长度不为零，返回所述按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除的步骤。
  3. 根据权利要求1所述的区域聚合的方法，其中，所述从所述栅格阵列中选出所有符合预定条件的问题栅格的步骤，包括：
    根据所述无线信号覆盖区域内终端的测量报告中的终端位置信息，将测量报告投影到所述终端位置信息对应的栅格；
    根据每个栅格内的测量报告反映的问题，选择出包含有反映预定问题的测 量报告的栅格，作为问题栅格。
  4. 根据权利要求1所述的区域聚合的方法，其中，所述预设特征值为影响权值，所述按照预设特征值，对所有的问题栅格进行排序，获得问题栅格序列的步骤，包括：
    按照影响权值Y对所有的问题栅格进行降序排列，生成问题栅格序列；
    其中，所述每个问题栅格的影响权值Y的计算公式为：
    Figure PCTCN2016104010-appb-100001
    其中，M表示单个栅格中的有效样本点的数量，S表示单个栅格中的样本点的总数量，X表示影响因子，所述样本点为测量报告，有效样本点为反应预定问题的测量报告。
  5. 根据权利要求1所述的区域聚合的方法，其中，所述预设特征值包括第一排序因子和第二排序因子，所述按照预设特征值，对所有的问题栅格进行排序，获得问题栅格序列的步骤，还包括：
    按照第一排序因子，对所有问题栅格进行降序排列，并按照第二排序因子对具有相同的第一排序因子的问题栅格进行降序排列，生成最终的栅格序列；
    其中，所述第一排序因子为栅格阵列中的行号和列号中的其中一个，所述第二排序因子为栅格阵列中的行号和列号中的另外一个。
  6. 根据权利要求1所述的区域聚合的方法，其中，所述从所述问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于一预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格从所述问题栅格序列中删除的步骤，包括：
    在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成一栅格集合，其中，所述栅格阵列中的每个栅格均对应相同大小的正方形覆盖区域；
    将问题栅格序列剩余的问题栅格中属于该栅格集合的问题栅格聚合到该问题区域中，获得一新的问题区域，并将聚合到该问题区域中的问题栅格从所述问题栅格序列中删除；
    在栅格阵列中，选择与新的问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成新的栅格集合；
    将问题栅格序列中当前剩余的问题栅格中属于该新的栅格集合的问题栅格聚合到当前的问题区域中，直至所述问题栅格序列中不存在与当前的问题区域中的至少一个问题栅格的曼哈顿距离小于预设门限的问题栅格。
  7. 一种区域聚合的装置，包括：
    处理模块，设置为将待分析的无线信号覆盖区域划分为包括多个栅格的栅格阵列，从所述栅格阵列中选出所有符合预定条件的问题栅格；
    排序模块，设置为按照预设特征值，对所有的问题栅格进行排序，获得问题栅格序列；
    筛选模块，设置为按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除；
    生成模块，设置为确定所述至少一个问题栅格中每个问题栅格所属的区域，获得至少一个问题区域；
    聚合模块，设置为针对所述至少一个问题区域，逐个进行以下操作：从所述问题栅格序列剩余的问题栅格中，选择出与该问题区域中至少一个问题栅格的距离小于预设门限的问题栅格，聚合至该问题区域，并将所选择的问题栅格 从所述问题栅格序列中删除。
  8. 根据权利要求7所述的区域聚合的装置，还包括：
    判断模块，设置为在对所述至少一个问题区域中的所有问题区域均执行完所述操作后，若所述问题栅格序列的当前长度为零，则输出各个问题区域及其所包含的问题栅格，否则，返回所述按照预定规则，从问题栅格序列中选择至少一个问题栅格，并将该至少一个问题栅格从所述问题栅格序列中删除的操作。
  9. 根据权利要求7所述的区域聚合的装置，其中，所述处理模块包括：
    第一处理单元，设置为根据所述无线信号覆盖区域内终端的测量报告中的终端位置信息，将测量报告投影到所述终端位置信息对应的栅格；
    第二处理单元，设置为根据各个栅格内的测量报告反映的问题，选择出包含有反映预定问题的测量报告的栅格，作为问题栅格。
  10. 根据权利要求7所述的区域聚合的装置，其中，所述预设特征值为影响权值，所述排序模块包括：
    第一排序单元，设置为按照影响权值对所有的问题栅格进行降序排列，生成问题栅格序列；
    其中，所述影响权值Y的计算公式为：
    Figure PCTCN2016104010-appb-100002
    其中，M表示单个栅格中的有效样本点的数量，S表示单个栅格中的样本点的总数量，X表示影响因子，所述样本点为测量报告，有效样本点为反应预定问题的测量报告。
  11. 根据权利要求7所述的区域聚合的装置，其中，所述预设特征值包括 第一排序因子和第二排序因子，所述排序模块还包括：
    第二排序单元，设置为按照第一排序因子，对所有问题栅格进行降序排列，并按照第二排序因子对具有相同的第一排序因子的问题栅格进行降序排列，生成最终的栅格序列；
    其中，所述第一排序因子为栅格阵列中的行号和列号中的其中一个，所述第二排序因子为栅格阵列中的行号和列号中的另外一个。
  12. 根据权利要求7所述的区域聚合的装置，其中，所述聚合模块包括：
    第一生成单元，设置为在栅格阵列中，选择与问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成一栅格集合，其中，所述栅格阵列中的每个栅格均对应相同大小的正方形覆盖区域；
    第一聚合单元，设置为将问题栅格序列剩余的问题栅格中属于该栅格集合的问题栅格聚合到该问题区域中，获得一新的问题区域，并将聚合到该问题区域中的问题栅格从所述问题栅格序列中删除；
    第二生成单元，设置为在栅格阵列中，选择与新的问题区域中至少一个问题栅格的曼哈顿距离小于预设门限的栅格，生成新的栅格集合；
    第二聚合单元，设置为将问题栅格序列中当前剩余的问题栅格中属于该新的栅格集合的问题栅格聚合到当前的问题区域中，直至所述问题栅格序列中不存在与当前的问题区域中的至少一个问题栅格的曼哈顿距离小于预设门限的问题栅格。
  13. 一种非暂态存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行权利要求1-6任一项所述的区域聚合的方法。
  14. 一种计算机程序产品，所述计算机程序产品包括存储在非暂态计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指 令被计算机执行时，使所述计算机执行权利要求1-6任一项所述的区域聚合的方法。
  15. 一种电子设备，包括至少一个处理器和与所述至少一个处理器通信连接的存储器，所述存储器用于存储可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行时，使所述至少一个处理器执行权利要求1-6任一项所述的区域聚合的方法。
PCT/CN2016/104010 2016-05-12 2016-10-31 区域聚合的方法及装置 WO2017193554A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610315904.2 2016-05-12
CN201610315904.2A CN107371171A (zh) 2016-05-12 2016-05-12 一种区域聚合的方法及装置

Publications (1)

Publication Number Publication Date
WO2017193554A1 true WO2017193554A1 (zh) 2017-11-16

Family

ID=60266106

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/104010 WO2017193554A1 (zh) 2016-05-12 2016-10-31 区域聚合的方法及装置

Country Status (2)

Country Link
CN (1) CN107371171A (zh)
WO (1) WO2017193554A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112364120A (zh) * 2020-12-03 2021-02-12 广州橙行智动汽车科技有限公司 一种车辆常驻区域的生成方法和装置
CN113965270A (zh) * 2020-07-20 2022-01-21 华为技术有限公司 一种emf强度控制方法及通信装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104270785A (zh) * 2014-10-17 2015-01-07 四川公用信息产业有限责任公司 一种基于地理栅格聚合的无线网络区域问题定位方法
WO2015165039A1 (zh) * 2014-04-29 2015-11-05 华为技术有限公司 一种确定待优化小区集合的装置及方法

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9125067B2 (en) * 2012-02-03 2015-09-01 Commscope Technologies Llc System and method for mobile location using ranked parameter labels
GB2499625C (en) * 2012-02-22 2016-07-27 Creativity Software Ltd Hybrid method for high accuracy and cost effective prediction of mobile device positions through mobile networks
CN104429113B (zh) * 2013-05-31 2018-06-05 华为技术有限公司 网络覆盖的检测方法及装置
CN104244446B (zh) * 2013-06-17 2018-05-11 华为技术有限公司 获得无线局域网部署信息的方法及装置
CN104349348B (zh) * 2013-07-24 2018-10-19 中国移动通信集团设计院有限公司 路测中问题频发区域的确定方法、装置及服务器
CN103634829B (zh) * 2013-12-18 2017-03-08 中国联合网络通信集团有限公司 一种基于路测信息的路段筛选方法和设备

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015165039A1 (zh) * 2014-04-29 2015-11-05 华为技术有限公司 一种确定待优化小区集合的装置及方法
CN104270785A (zh) * 2014-10-17 2015-01-07 四川公用信息产业有限责任公司 一种基于地理栅格聚合的无线网络区域问题定位方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113965270A (zh) * 2020-07-20 2022-01-21 华为技术有限公司 一种emf强度控制方法及通信装置
CN113965270B (zh) * 2020-07-20 2023-08-22 华为技术有限公司 一种emf强度控制方法及通信装置
CN112364120A (zh) * 2020-12-03 2021-02-12 广州橙行智动汽车科技有限公司 一种车辆常驻区域的生成方法和装置

Also Published As

Publication number Publication date
CN107371171A (zh) 2017-11-21

Similar Documents

Publication Publication Date Title
CN110677859B (zh) 弱覆盖区域的确定方法、装置和计算机可读存储介质
CN101702200B (zh) 一种机载激光雷达点云数据的自动分类方法
CN109963287B (zh) 天线方向角优化方法、装置、设备及介质
CN107657637B (zh) 一种农机作业面积获取方法
CN110765219B (zh) 地理围栏生成方法、装置、计算机设备和存储介质
EP3461105B1 (en) Positioning method and server
CN109963285B (zh) 确定小区覆盖范围的方法、装置、电子设备和存储介质
CN103390169A (zh) 一种车载激光扫描点云数据的城市地物分类方法
CN106780064B (zh) 一种区域划分方法、装置及网络设备
CN110795978B (zh) 路面点云数据提取方法、装置、存储介质及电子设备
CN112506972B (zh) 用户常驻区域定位方法、装置、电子设备以及存储介质
CN102073867B (zh) 一种遥感图像分类方法及装置
US11068714B2 (en) Method and apparatus for determining hot zones of human flow based on cartography
CN103634829B (zh) 一种基于路测信息的路段筛选方法和设备
WO2017193554A1 (zh) 区域聚合的方法及装置
CN112199453A (zh) 话务热点聚类方法、装置、设备及计算机存储介质
CN111126211A (zh) 标牌识别方法和装置、电子设备
CN111475746A (zh) 兴趣点位置挖掘方法、装置、计算机设备和存储介质
CN110782472A (zh) 点云地面点的识别方法及装置
CN108093420B (zh) 基站选取方法、装置及计算机可读存储介质
CN110913407A (zh) 重叠覆盖的分析方法及装置
CN103927765B (zh) 用于定位图像中条码区域的方法和装置
CN109360137B (zh) 一种车辆事故评估方法、计算机可读存储介质及服务器
CN111160385B (zh) 海量位置点聚合的方法、装置、设备及存储介质
CN111144612B (zh) 一种加油站位置点预测方法、装置、存储介质及终端

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16901509

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16901509

Country of ref document: EP

Kind code of ref document: A1