A method for automatic location selection of UAV base station

Abstract

The invention discloses an automatic site selection method for an unmanned aerial vehicle base station. The method comprises the following steps: A, respectively extracting centers of regions needingto be served as service points; b, constructing a maximum outsourcing graph of the plurality of service points in the step A; c, dividing the maximum outsourcing graph into N target areas according tothe number N of base stations designed as required; d, solving a central point of the service points contained in the N target areas and constructing a Thiessen polygon; e, determining a target pointfalling into the Thiessen polygon by taking the Thiessen polygon as a reference; and F, solving the central point of the service point determined in the step E again, and reconstructing the Thiessenpolygon until the position of the solved central point is not changed. The automatic site selection method for the unmanned aerial vehicle base station can realize solving of an optimal solution selected by multiple base stations of the unmanned aerial vehicle, has the characteristics of strict mathematical theory and simple and feasible technology, and is very suitable for unmanned aerial vehiclemulti-base station selection in a large-range complex environment.

Description

technical field [0001] The invention relates to the fields of mathematics and geographic information science, in particular to an automatic site selection method for a base station of an unmanned aerial vehicle. Background technique [0002] The selection of multiple base stations for UAVs is one of the difficulties in the current UAV research field. Compared with the traditional single base station selection, the main problems are as follows: First, the distance between each base station in the multi-base station and the corresponding target point must be the smallest , and the second is that the sum of distances from multiple base stations to corresponding target points is the smallest. There are negotiations between the two problems to be solved, and simplification is difficult. Therefore, it is difficult for scholars to obtain the optimal solution that satisfies the above two conditions. This is also one of the most classic problems in operations research. [0003] In t...

AI Technical Summary

Problems solved by technology

[0002] The selection of multiple base stations for UAVs is one of the difficulties in the current UAV research field. Compared with the traditional single base station selection, the main problems are as follows: First, the distance between each base station in the multi-base station and the corresponding target point must be the smallest , and the second is that the sum of the distances from multiple base stations to the corresponding target point is the smallest

It can be said that in the current environment where parallel computing thinking is rampant, research on multi-objective independent selection has been involved, but few scholars have systematically and fully studied the theory of multi-objective free selection and optimization

Images