A method for an unmanned aerial vehicle to pass through an unmanned aerial vehicle airport, wherein the method comprises:
- obtaining status information of an unmanned aerial vehicle, wherein the status information comprises a set average flight speed V, a maximum cruising range M, start flight coordinates Pos1 of the unmanned aerial vehicle, and target flight coordinates Pos2 of the unmanned aerial vehicle;
- sending a request for an unmanned aerial vehicle airport information set to an index server, which index server comprises information of all unmanned aerial vehicle airports, wherein the request for the unmanned aerial vehicle airport information set comprises obtaining an unmanned aerial vehicle airport information set in an interval between the start flight coordinates Pos1 of the unmanned aerial vehicle and the target flight coordinates Pos2 of the unmanned aerial vehicle for a specified period of time;
- receiving the unmanned aerial vehicle airport information set sent by the index server, wherein the unmanned aerial vehicle airport information set comprises a plurality of unmanned aerial vehicle airports, and each unmanned aerial vehicle airport comprises coordinates of an access point of the unmanned aerial vehicle airport, an average duration of takeoff duration and landing duration of each unmanned aerial vehicle airport, and an unmanned aerial vehicle airport server address;
- obtaining, through weight value calculation based on the unmanned aerial vehicle airport information set, a connected unmanned aerial vehicle airport station set comprising a weight value of an inter-airport path between coordinates of access points of any two sequentially connected unmanned aerial vehicle airports, wherein the weight value calculation comprises weight values all being 1, and an inter-airport distance between the connected unmanned aerial vehicle airports is less than the M;
- wherein the weight value of an inter-airport path is obtained by:
- step 2, taking access points of any two unmanned aerial vehicle airports from the unmanned aerial vehicle airport information set;
- step 3, if a distance D between an access point of a first unmanned aerial vehicle airport and an access point of a second unmanned aerial vehicle airport is less than the M, connecting the access point of the first unmanned aerial vehicle airport and the access point of the second unmanned aerial vehicle airport to obtain an inter-airport path;
- step 4, calculating a weight value of the inter-airport path, wherein the weight value of the inter-airport path=D/the set average flight speed V+average duration of takeoff duration and landing duration of the first unmanned aerial vehicle airport+average duration of takeoff duration and landing duration of the second unmanned aerial vehicle airport+parking for charging duration of the second unmanned aerial vehicle airport;
- and step 5, repeating step 2 to step 4, until access points of all of the unmanned aerial vehicle airports in the unmanned aerial vehicle airport information set are connected, to obtain the connected unmanned aerial vehicle airport station set comprising the weight value of the inter-airport path between the coordinates of the access points of any two sequentially connected unmanned aerial vehicle airports;
- calculating an optimal-weight-value sequentially connected path set based on the connected unmanned aerial vehicle airport station set, wherein the optimal-weight-value sequentially connected path set comprises a minimum-weight-value sequentially connected path set;
- obtaining, from the unmanned aerial vehicle airport server addresses, a parking place reservation occupancy status of unmanned aerial vehicle airports, that is, the unmanned aerial vehicle airports are occupied or not in estimated passage periods when they are sequentially passed by the unmanned aerial vehicle according to the optimal-weight-value sequentially connected path set, excluding a path corresponding to an unmanned aerial vehicle airport in which the parking place reservation occupancy status of each of the parking places is not idle, and determining a reachable optimal-weight-value sequentially connected path set;
- and
- determining a flight path based on a weight value combination condition and the reachable optimal-weight-value sequentially connected path set.