Methods and devices for determining the position of a moving object

By initializing and weighted artificial bee colony optimization to determine the target nectar source, controlling the drone to collect signals and combining them with Kalman filtering, the problem of drone positioning networks locating multiple moving objects was solved, achieving efficient and accurate positioning.

CN116973839BActive Publication Date: 2026-11-10BEIJING UNIV OF POSTS & TELECOMM
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310720784.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-06-16
Publication Date
2026-11-10
Estimated Expiration
2043-06-16

AI Technical Summary

Technical Problem

The drone positioning network is unable to effectively locate multiple moving objects.

Method used

By initializing M original nectar sources, using weighted artificial bee colony optimization, the target nectar source is determined, and a drone is controlled to collect the positioning signal of the moving object. The position of the moving object is then determined by combining Kalman filtering technology.

Benefits of technology

The UAV positioning network has achieved efficient positioning of multiple moving objects, improving positioning accuracy and reducing energy consumption.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116973839B_ABST
    Figure CN116973839B_ABST
Patent Text Reader

Abstract

This invention provides a method and apparatus for determining the location of a moving object. The method includes: initializing M original nectar sources; performing weighted artificial colony optimization on the M original nectar sources a preset number of times based on the locations of multiple moving objects and multiple drones in the previous time slot to obtain a target nectar source in the current time slot; the target nectar source includes the target location of each drone and the target occupancy identifier of each moving object relative to each drone; for each moving object, if the target occupancy identifier is a first identifier, controlling the drone corresponding to the first identifier to collect the positioning signal of the moving object based on the target location of the drone corresponding to the first identifier, and determining the location of the moving object in the current time slot based on the collected positioning signal. The method and apparatus for determining the location of a moving object provided by this invention are used to locate multiple moving objects through a drone positioning network.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of unmanned aerial vehicle (UAV) technology, and in particular to a method and device for determining the position of a moving object. Background Technology

[0002] A drone positioning network is a positioning network composed of multiple drones. A drone positioning network can locate moving objects within a specific area.

[0003] Currently, UAV positioning networks can only locate a single moving object. When there are multiple moving objects in a certain area, the UAV positioning network cannot locate all of them. Therefore, how to locate multiple moving objects using a UAV positioning network has become an urgent technical problem to be solved. Summary of the Invention

[0004] This invention provides a method and device for determining the location of a moving object, in order to solve the urgent technical problem of how to locate multiple moving objects through a drone positioning network.

[0005] In a first aspect, the present invention provides a method for determining the position of a moving object, comprising:

[0006] Obtain the positions of multiple moving objects in the target area in the previous time slot and the positions of multiple drones in the drone positioning network in the previous time slot;

[0007] Initialize M initial honey sources; the initial honey sources include the initial position of each drone and the initial occupancy identifier of each moving object on each drone. The initial positioning identifier indicates whether the positioning signal of the moving object is collected by the drone. M is an integer greater than or equal to 2.

[0008] Based on the positions of multiple moving objects and multiple drones in the previous time slot, the M original nectar sources are subjected to a preset number of weighted artificial bee colony optimization processes to obtain the target nectar source in the current time slot; the target nectar source includes the target position of each drone and the target occupancy identifier of each moving object on each drone.

[0009] For each moving object, when the target occupancy identifier is the first identifier, based on the target position of the UAV corresponding to the first identifier, the UAV corresponding to the first identifier is controlled to collect the positioning signal of the moving object, and based on the collected positioning signal, the position of the moving object in the current time slot is determined; the first identifier indicates that the positioning signal of the moving object is collected by the UAV.

[0010] In some embodiments, based on the positions of multiple moving objects and multiple drones in the previous time slot, a weighted artificial bee colony optimization process is performed on M original nectar sources a preset number of times to obtain the target nectar source in the current time slot, including:

[0011] Perform the (j+1)th weighted artificial bee colony optimization process to obtain M new nectar sources obtained from the jth weighted artificial bee colony optimization process;

[0012] For each of the M new honey sources, the positions of the new honey source, the multiple mobile objects in the previous time slot, and the multiple drones in the previous time slot are input into the objective function model to obtain the fitness value of the new honey source.

[0013] The new honey source with the highest fitness value among the M new honey sources is determined as the optimal honey source, and the optimal honey source is recorded.

[0014] For each of the M new honey sources, a sub-honey source corresponding to the new honey source is generated based on the fitness value of the new honey source, the optimal honey source, the fitness values ​​of the M new honey sources, and the honey source selection probability calculation model; a target sub-honey source is determined from the sub-honey sources corresponding to the new honey source, and the target sub-honey source is the sub-honey source with the largest fitness value among the sub-honey sources corresponding to the new honey source;

[0015] If the fitness value of the target sub-nectar source is greater than the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is set to 0, and the target sub-nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process;

[0016] If the fitness value of the target sub-nectar source is less than or equal to the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is incremented by 1. If the control parameter after incrementing by 1 is greater than or equal to a preset threshold, then the randomly generated new nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process.

[0017] Increment j by 1, and repeat the weighted artificial colony optimization process until j equals the preset number of times. The new honey source with the largest fitness value among the M new honey sources obtained by performing the preset number of weighted artificial colony optimization processes is determined as the target honey source in the current time slot.

[0018] Initially, j = 0, and the M new nectar sources obtained by performing the 0th weighted artificial bee colony optimization process are the M original nectar sources.

[0019] In some embodiments, generating sub-honey sources corresponding to the new honey sources based on the fitness value of the new honey source, the optimal honey source, the fitness values ​​of the M new honey sources, and a honey source selection probability calculation model includes:

[0020] The fitness value of the new nectar source and the fitness values ​​of the M new nectar sources are input into the nectar source selection probability calculation model to obtain the selection probability corresponding to the new nectar source.

[0021] Based on the optimal honey source, the new honey source, and the selection probability, a sub-honey source corresponding to the new honey source is generated.

[0022] In some embodiments, the objective function model is:

[0023]

[0024] Where Z represents the fitness value, N p This indicates the total number of multiple moved objects. This represents a vector containing the position of the nth moving object in the previous time slot. λ1 represents the squared bound of the position error of the nth moving object, λ1 represents the selection weight coefficient of the UAV, and N u This indicates the total number of drones. This represents a vector containing the identifier of the occupancy of the k-th drone by the n-th moving object. λ represents the distance between the nth moving object and the kth drone in the current time slot, and λ² represents the moving distance weighting coefficient. This represents a vector containing the position of the k-th drone in the current time slot. Let represent a vector including the position of the k-th UAV in the previous time slot, where and Included in new honey sources;

[0025] The constraints of the objective function model include:

[0026] K drones collect the location signal of a moving object, where K is an integer greater than or equal to 3;

[0027] In any time slot, the squared position error of each moving object is less than the preset squared position error threshold.

[0028] For each drone, the distance between the drone's position in the previous time slot and its position in the current time slot is less than the maximum travel distance;

[0029] In the current time slot, the distance between any two drones among the multiple drones is greater than or equal to the safe flight distance.

[0030] In some embodiments, the model for calculating the probability of honey source selection is as follows:

[0031]

[0032] Where, p j Fit represents the probability of choosing a new honey source. j The fitness value of a new nectar source. m Let T represent the fitness value of the m-th new nectar source out of M new nectar sources, where T = T0 × 0.99. g-1 T0 represents the initial pressure constant, and g represents the current iteration number.

[0033] In some embodiments, based on the optimal nectar source, the new nectar source, and the selection probability, a sub-nectar source corresponding to the new nectar source is generated, including:

[0034] The number of sub-honey sources generated is determined based on the selection probability and M;

[0035] The optimal nectar source and the new nectar source are input into the sub-nectar source generation model to generate the number of sub-nectar sources, and the sub-nectar sources corresponding to the new nectar source are obtained.

[0036] In some embodiments, the honey source generation model is as follows:

[0037]

[0038] in, w represents the weighted middle position. j This represents the weighting coefficient for new honey sources. Indicates a new honey source, w g G represents the weighting coefficient of the optimal nectar source. d Indicates the optimal honey source. This indicates the sub-nectar source corresponding to the new nectar source. Represents a random number, x rd Fit represents the average of a preset number of new honey sources randomly selected from M new honey sources. j The fitness value of a new nectar source. g This represents the fitness value of the optimal nectar source.

[0039] In some embodiments, determining the position of a moving object in the current time slot based on the acquired positioning signal includes:

[0040] The acquired positioning signals are used to calculate the position of the moving object in the current time slot.

[0041] Apply a Kalman filter to the initial position to obtain the position of the moving object in the current time slot.

[0042] In a second aspect, the present invention provides a device for determining the position of a moving object, comprising:

[0043] The acquisition module is used to acquire the positions of multiple moving objects in the target area in the previous time slot and the positions of multiple drones in the drone positioning network in the previous time slot.

[0044] The initialization module is used to initialize M original honey sources. The original honey sources include the initial position of each drone and the initial occupancy identifier of each moving object on each drone. The initial positioning identifier indicates whether the positioning signal of the moving object is collected by the drone. M is an integer greater than or equal to 2.

[0045] The optimization module is used to perform a preset number of weighted artificial bee colony optimization processes on M original nectar sources based on the positions of multiple mobile objects and multiple drones in the previous time slot, so as to obtain the target nectar source in the current time slot; the target nectar source includes the target position of each drone and the target occupancy identifier of each mobile object on each drone.

[0046] The positioning module is used to, for each moving object, when the target occupancy identifier is the first identifier, control the drone corresponding to the first identifier to collect the positioning signal of the moving object based on the target position of the drone corresponding to the first identifier, and determine the position of the moving object in the current time slot based on the collected positioning signal; the first identifier indicates that the positioning signal of the moving object is collected by the drone.

[0047] In some embodiments, the optimization module is specifically used for:

[0048] Perform the (j+1)th weighted artificial bee colony optimization process to obtain M new nectar sources obtained from the jth weighted artificial bee colony optimization process;

[0049] For each of the M new honey sources, the positions of the new honey source, the multiple mobile objects in the previous time slot, and the multiple drones in the previous time slot are input into the objective function model to obtain the fitness value of the new honey source.

[0050] The new honey source with the highest fitness value among the M new honey sources is determined as the optimal honey source, and the optimal honey source is recorded.

[0051] For each of the M new honey sources, a sub-honey source corresponding to the new honey source is generated based on the fitness value of the new honey source, the optimal honey source, the fitness values ​​of the M new honey sources, and the honey source selection probability calculation model; a target sub-honey source is determined from the sub-honey sources corresponding to the new honey source, and the target sub-honey source is the sub-honey source with the largest fitness value among the sub-honey sources corresponding to the new honey source;

[0052] If the fitness value of the target sub-nectar source is greater than the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is set to 0, and the target sub-nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process;

[0053] If the fitness value of the target sub-nectar source is less than or equal to the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is incremented by 1. If the control parameter after incrementing by 1 is greater than or equal to a preset threshold, then the randomly generated new nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process.

[0054] Increment j by 1, and repeat the weighted artificial colony optimization process until j equals the preset number of times. The new honey source with the largest fitness value among the M new honey sources obtained by performing the preset number of weighted artificial colony optimization processes is determined as the target honey source in the current time slot.

[0055] Initially, j = 0, and the M new nectar sources obtained by performing the 0th weighted artificial bee colony optimization process are the M original nectar sources.

[0056] In some embodiments, the optimization module is specifically used for:

[0057] The fitness value of the new nectar source and the fitness values ​​of the M new nectar sources are input into the nectar source selection probability calculation model to obtain the selection probability corresponding to the new nectar source.

[0058] Based on the optimal honey source, the new honey source, and the selection probability, a sub-honey source corresponding to the new honey source is generated.

[0059] In some embodiments, the objective function model is:

[0060]

[0061] Where Z represents the fitness value, N p This indicates the total number of multiple moved objects. This represents a vector containing the position of the nth moving object in the previous time slot. λ1 represents the squared bound of the position error of the nth moving object, λ1 represents the selection weight coefficient of the UAV, and N u This indicates the total number of drones. This represents a vector containing the identifier of the occupancy of the k-th drone by the n-th moving object. λ represents the distance between the nth moving object and the kth drone in the current time slot, and λ² represents the moving distance weighting coefficient. This represents a vector containing the position of the k-th drone in the current time slot. Let represent a vector including the position of the k-th UAV in the previous time slot, where and Included in new honey sources;

[0062] The constraints of the objective function model include:

[0063] K drones collect the location signal of a moving object, where K is an integer greater than or equal to 3;

[0064] In any time slot, the squared position error of each moving object is less than the preset squared position error threshold.

[0065] For each drone, the distance between the drone's position in the previous time slot and its position in the current time slot is less than the maximum travel distance;

[0066] In the current time slot, the distance between any two drones among the multiple drones is greater than or equal to the safe flight distance.

[0067] In some embodiments, the model for calculating the probability of honey source selection is as follows:

[0068]

[0069] Where, p j Fit represents the probability of choosing a new honey source. j The fitness value of a new nectar source. m Let T represent the fitness value of the m-th new nectar source out of M new nectar sources, where T = T0 × 0.99. g-1 T0 represents the initial pressure constant, and g represents the current iteration number.

[0070] In some embodiments, the optimization module is specifically used for:

[0071] The number of sub-honey sources generated is determined based on the selection probability and M;

[0072] The optimal nectar source and the new nectar source are input into the sub-nectar source generation model to generate the number of sub-nectar sources, and the sub-nectar sources corresponding to the new nectar source are obtained.

[0073] In some embodiments, the honey source generation model is as follows:

[0074]

[0075] in, w represents the weighted middle position. j This represents the weighting coefficient for new honey sources. Indicates a new honey source, w g G represents the weighting coefficient of the optimal nectar source. d Indicates the optimal honey source. This indicates the sub-nectar source corresponding to the new nectar source. Represents a random number, x rd Fit represents the average of a preset number of new honey sources randomly selected from M new honey sources. j The fitness value of a new nectar source. g This represents the fitness value of the optimal nectar source.

[0076] In some embodiments, the positioning module is specifically used for:

[0077] The acquired positioning signals are used to calculate the position of the moving object in the current time slot.

[0078] Apply a Kalman filter to the initial position to obtain the position of the moving object in the current time slot.

[0079] Thirdly, the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement any of the methods for determining the position of a moving object as described in the first aspect above.

[0080] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for determining the position of a moving object as described in any of the first aspects above.

[0081] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements a method for determining the position of a moving object as described in any of the first aspects above.

[0082] In the present invention, a method and device for determining the location of a moving object are provided. M original nectar sources are initialized. Based on the locations of multiple moving objects and multiple drones in the previous time slot, the M original nectar sources are subjected to a preset number of weighted artificial bee colony optimization processes to obtain the target nectar source in the current time slot. The target nectar source includes the target location of each drone and the target occupancy identifier of each moving object relative to each drone. For each moving object, when the target occupancy identifier is a first identifier, based on the target location of the drone corresponding to the first identifier, the drone corresponding to the first identifier is controlled to collect the positioning signal of the moving object. Based on the collected positioning signal, the location of the moving object in the current time slot is determined, thereby realizing the positioning of multiple moving objects through a drone positioning network. Attached Figure Description

[0083] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0084] Figure 1 This is a flowchart illustrating the method for determining the position of a moving object provided by the present invention;

[0085] Figure 2 This is a schematic diagram of the process for obtaining the target honey source provided by the present invention;

[0086] Figure 3 This invention provides a TOA (Too-of-Area) positioning measurement model.

[0087] Figure 4 This is a schematic diagram of locating a moving object in two consecutive time slots provided by the present invention;

[0088] Figure 5 This is one of the schematic diagrams of the simulation results provided by the present invention;

[0089] Figure 6 This is the second schematic diagram of the simulation results provided by the present invention;

[0090] Figure 7 This is the third schematic diagram of the simulation results provided by the present invention;

[0091] Figure 8 This is the fourth schematic diagram of the simulation results provided by the present invention;

[0092] Figure 9 This is the fifth schematic diagram of the simulation results provided by the present invention;

[0093] Figure 10 This is a schematic diagram of the structure of the device for determining the position of a moving object provided by the present invention;

[0094] Figure 11 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation

[0095] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0096] Typically, for a given moving object, the number of drones in the drone positioning network significantly exceeds the required number for positioning. Using all drones in the network simultaneously for positioning would result in high total transmission power, wasting energy. Furthermore, in the case of multiple moving objects, all drones simultaneously positioning a single object would cause other moving objects to wait, consuming more time. In certain special scenarios (such as emergency rescue), it is therefore essential for each moving object to select a fixed group of drones for positioning at any given time.

[0097] To address the problem that drone positioning networks cannot locate multiple moving objects, the inventors devised a method to allocate a portion of the drones in the drone positioning network to each moving object and use these allocated drones to locate the moving object, thereby ensuring that the drone positioning network can locate multiple moving objects.

[0098] The method for determining the position of a moving object provided by the present invention is described below with reference to specific embodiments.

[0099] Figure 1 This is a flowchart illustrating the method for determining the position of a moving object provided by the present invention. Figure 1 As shown, the method includes:

[0100] S11: Obtain the positions of multiple moving objects in the target area in the previous time slot and the positions of multiple drones in the drone positioning network in the previous time slot.

[0101] Optionally, the execution subject of the method for determining the position of a moving object provided by the present invention can be an electronic device or a device for determining the position of a moving object installed in an electronic device. The device for determining the position can be implemented by a combination of software and / or hardware.

[0102] Electronic devices can be used to control multiple drones in a drone positioning network.

[0103] The position of each moving object in the previous time slot is the position of each moving object obtained in the previous time slot.

[0104] The method for obtaining the positions of each moving object in the previous time slot is similar to the method for obtaining the positions of the moving objects in the current time slot through S11 to S14, and will not be described again here.

[0105] The position of each drone in the previous time slot is the target position of each drone in the target honey source obtained in the previous time slot.

[0106] The method for obtaining the target honey source in the previous time slot is similar to the method for obtaining the target honey source in the current time slot through S11 to S13, and will not be described in detail here.

[0107] S12: Initialize M initial honey sources; the initial honey sources include the initial position of each drone and the initial occupancy identifier of each moving object on each drone. The initial positioning identifier indicates whether the positioning signal of the moving object is collected by the drone. M is an integer greater than or equal to 2.

[0108] Optionally, the initial occupancy identifier can be either a first identifier or a second identifier.

[0109] The first identifier indicates that the location signal of the moving object was collected by the drone.

[0110] The second identifier indicates that the location signal of the moving object is not collected by the drone.

[0111] The first identifier and the second identifier are different; for example, the first identifier is 1 and the second identifier is 0.

[0112] S13: Based on the positions of multiple mobile objects and multiple drones in the previous time slot, perform a preset number of weighted artificial bee colony optimization processes on M original nectar sources to obtain the target nectar source in the current time slot; the target nectar source includes the target position of each drone and the target occupancy identifier of each mobile object on each drone.

[0113] Optionally, the preset number of times can be 200 times, 500 times, etc.

[0114] For an explanation of how the target nectar source was obtained, please refer to [link / reference]. Figure 2 Examples are not described here.

[0115] Optionally, the target honey source includes vectors. sum vector in, This includes the target location of the kth drone. This includes the target occupancy identifier of the nth moving object for each drone, where n = 1, 2, ... N. p k = 1, 2, ..., N u N u N represents the total number of drones. p This indicates the total number of multiple moved objects.

[0116] S14: For each moving object, when the target occupancy identifier is the first identifier, based on the target position of the UAV corresponding to the first identifier, control the UAV corresponding to the first identifier to collect the positioning signal of the moving object, and determine the position of the moving object in the current time slot based on the collected positioning signal; the first identifier indicates that the positioning signal of the moving object is collected by the UAV.

[0117] For example, for the nth moving object, the above (i.e., the second identifier) ​​or 1 (i.e., the first identifier), This indicates that the location signal of the nth moving object is not collected via a drone. This indicates that the location signal of the nth moving object is collected by a drone.

[0118] Typically, It includes K 1s (i.e., the first identifier), indicating that the location signal of the moving object was collected by K drones.

[0119] Optionally, based on the target location of the drone corresponding to the first identifier, control the drone corresponding to the first identifier to collect the positioning signal of the moving object, including:

[0120] Send the target location of the drone to the drone corresponding to the first identifier;

[0121] Receive the positioning signal of the moving object collected when the drone corresponding to the first identifier is at the target position of the drone.

[0122] Alternatively, the location of the moving object in the current time slot can be determined in the following two ways.

[0123] Method 11: Perform position calculation on the acquired positioning signal to obtain the position of the moving object in the current time slot.

[0124] Method 12: Perform position calculation on the acquired positioning signal to obtain the initial position of the moving object in the current time slot;

[0125] Apply a Kalman filter to the initial position to obtain the position of the moving object in the current time slot.

[0126] In this invention, Kalman filtering is applied to the initial position to obtain the position of the moving object in the current time slot, which can improve the accuracy of the moving object's position in the current time slot.

[0127] In this embodiment of the invention, based on the positions of multiple mobile objects in the previous time slot, a weighted artificial bee colony optimization process is performed on M original nectar sources a preset number of times to obtain target nectar sources. The target nectar sources include the target positions of each drone and the target occupancy identifiers of each mobile object relative to each drone. For each mobile object, when the target occupancy identifier is a first identifier, based on the target position of the drone corresponding to the first identifier, the drone corresponding to the first identifier is controlled to collect the positioning signal of the mobile object. Based on the collected positioning signal, the position of the mobile object in the current time slot is determined. This allows for the positioning of each mobile object by using a subset of drones in the drone positioning network.

[0128] Figure 2 This is a schematic diagram of the process for obtaining the target honey source provided by the present invention. For example... Figure 2 As shown, the method includes:

[0129] S201: Obtain M new nectar sources obtained from the j-th weighted artificial bee colony optimization process.

[0130] S202: For each of the M new honey sources, input the new honey source, the positions of multiple mobile objects in the previous time slot, and the positions of multiple drones in the previous time slot into the objective function model to obtain the fitness value of the new honey source.

[0131] Optionally, the objective function model is:

[0132]

[0133] Where Z represents the fitness value, N p This indicates the total number of multiple moved objects. This represents a vector containing the position of the nth moving object in the previous time slot. λ1 represents the squared bound of the position error of the nth moving object, λ1 represents the selection weight coefficient of the UAV, and N u This indicates the total number of drones. This represents a vector containing the identifier of the occupancy of the l-th drone by the n-th moving object. λ represents the distance between the nth moving object and the kth drone in the current time slot, and λ² represents the moving distance weighting coefficient. This represents a vector including the position of the l-th UAV in the current time slot. This represents a vector including the position of the l-th UAV in the previous time slot, where, and It is included in the new honey source.

[0134] The constraints of the objective function model include:

[0135] K drones collect the location signal of a moving object (i.e., K is an integer greater than or equal to 3;

[0136] In any given time slot, the squared position error of each moving object is less than a preset squared position error threshold (e.g., in, (Indicates the preset position error squared threshold);

[0137] For each drone, the distance between the drone's position in the previous time slot and its position in the current time slot is less than the maximum travel distance (i.e., Where, d max (Indicates the maximum distance traveled);

[0138] In the current time slot, the distance between any two drones among the multiple drones is greater than or equal to the safe flight distance (i.e., Where d0 represents the safe flight distance.

[0139] S203: Select the new nectar source with the highest fitness value among the M new nectar sources as the optimal nectar source and record the optimal nectar source.

[0140] S204: For each of the M new nectar sources, generate the corresponding sub-nectar source based on the fitness value of the new nectar source, the optimal nectar source, the fitness values ​​of the M new nectar sources, and the nectar source selection probability calculation model.

[0141] In some embodiments, based on the fitness value of the new honey source, the optimal honey source, the fitness values ​​of M new honey sources, and a honey source selection probability calculation model, sub-honey sources corresponding to the new honey source are generated, including:

[0142] The fitness values ​​of the new nectar source and the M new nectar sources are input into the nectar source selection probability calculation model to obtain the selection probability corresponding to the new nectar source.

[0143] Based on the optimal nectar source, the new nectar source, and the selection probability, the sub-nectar sources corresponding to the new nectar source are generated.

[0144] Optionally, the model for calculating the probability of honey source selection is as follows:

[0145]

[0146] Where, p j Fit represents the probability of choosing a new honey source. j The fitness value of a new nectar source. m Let T represent the fitness value of the m-th new nectar source out of M new nectar sources, where T = T0 × 0.99. g-1T0 represents the initial pressure constant, and g represents the current iteration number (i.e., when performing j+1 weighted artificial bee colony optimization, g = j+1).

[0147] Optionally, based on the optimal nectar source, the new nectar source, and the selection probability, sub-nectar sources corresponding to the new nectar source are generated, including:

[0148] The number of sub-honey sources generated is determined based on the selection probability and M;

[0149] The optimal nectar source and the new nectar source are input into the sub-nectar source generation model to generate the number of sub-nectar sources, and the sub-nectar sources corresponding to the new nectar source are obtained.

[0150] Optionally, the number of sub-honey sources generated is determined based on the selection probability and M, including: determining the product of the selection probability and M; and rounding down the product to obtain the number of sub-honey sources generated.

[0151] For example, if the selection probability is 0.043 and M is 200, the product of the two is 8.63. Rounding down 8.63 gives the number of sub-honey sources generated as 8.

[0152] For example, if the number of sub-honey sources generated is 8, the optimal honey source and the new honey source are input into the sub-honey source generation model 8 times to obtain 8 sub-honey sources corresponding to the new honey source.

[0153] Optionally, the sub-honey source generation model is:

[0154]

[0155] in, w represents the weighted middle position. j This represents the weighting coefficient for new honey sources. Indicates a new honey source, w g This represents the weighting coefficient for the optimal nectar source, where gd represents the optimal nectar source. This indicates the sub-nectar source corresponding to the new nectar source. Represents a random number, x rd Fit represents the average of a preset number of new honey sources randomly selected from M new honey sources. j The fitness value of a new nectar source. g This represents the fitness value of the optimal nectar source.

[0156] This represents a randomly generated random number. The value range is [-1, 1]. Because The value range is [-1, 1], which allows for a strong degree of randomness in the search for sub-honey sources.

[0157] The preset quantity can be 20, 30, 40, etc.

[0158] S205: Determine the target sub-nectar source among the sub-nectar sources corresponding to the new nectar source. The target sub-nectar source is the sub-nectar source with the highest fitness value among the sub-nectar sources corresponding to the new nectar source.

[0159] The method for calculating the fitness value of a secondary nectar source is similar to that for calculating the fitness value of a new nectar source, and will not be repeated here.

[0160] S206: Is the fitness value of the target nectar source greater than the fitness value of the new nectar source?

[0161] If yes, execute S207; otherwise, execute S208.

[0162] S207: Set the control parameters corresponding to the new nectar source to 0, and determine the target sub-nectar source as the new nectar source obtained by performing the next (j+1) weighted artificial bee colony optimization process.

[0163] S208: Increment the control parameter corresponding to the new nectar source by 1. If the control parameter after incrementing by 1 is greater than or equal to the preset threshold, the randomly generated new nectar source will be determined as the new nectar source obtained by performing the next (j+1) weighted artificial bee colony optimization process.

[0164] S209: Determine if j is less than the preset number of times.

[0165] If yes, execute S210; otherwise, execute S211.

[0166] S210: Increment j by 1, and execute S201 to S209 above.

[0167] S211: Among the M new nectar sources obtained by performing the preset number of weighted artificial bee colony optimization processes, the new nectar source with the highest fitness value is determined as the target nectar source.

[0168] For example, if the preset number of iterations is 500, the new nectar source with the highest fitness value among the M new nectar sources obtained from the 500th weighted artificial bee colony optimization process will be determined as the target nectar source.

[0169] The methods for performing the (j+1)th weighted artificial bee colony optimization process include S201 to S211.

[0170] The following is combined Figure 3 The relevant parameters in the objective function model are explained.

[0171] Figure 3 This is the Time of Arrival (TOA) positioning metric model provided by this invention. For example... Figure 3 As shown, this includes: the position vector p of the nth moving object. n and the position vector u of the kth UAVk .

[0172] p n =(p xn P yn P zn ) T u k =(u xk u yk u zk ) T .

[0173] p n and u k The azimuth angle θ between k,n It can be determined using the following formula 1:

[0174]

[0175] p n and u k The angle of elevation φ between k,n It can be determined using the following formula 2:

[0176]

[0177] The time of arrival (TOA) of the radio signal sent by the k-th drone to the n-th moving object is represented by t. k,n for:

[0178]

[0179] Where c represents the speed of the radio signal, d k,n (where ||||2 is the Euclidean norm) represents u. k and p n The distance between them.

[0180] The positioning accuracy provided to the target by the drone positioning network It can be determined by the Squared Position Error Bound (SPEB), as detailed in Formula 4 below.

[0181]

[0182] Where tr{·} denotes the operator for finding the trace of a matrix, F(p n ) represents the Fisher Information Matrix (FIM) provided by the UAV positioning network to the nth moving object, which is composed of the Fisher Information Matrix provided by each UAV. μ k,nIt is the ranging information intensity (RII) of the radio signal sent by the k-th UAV to the n-th moving object, q k,n This represents the unit direction vector between the nth moving object and the kth drone.

[0183] Optionally,

[0184] Where ξ is a constant, u zk P represents the drone's flight altitude. k This indicates the drone's launch power.

[0185] Optionally, q k,n =(cosφ k,n cosθ k,n cosφ k,n sinθ k,n sinφ k,n ) T .

[0186] Figure 4 This is a schematic diagram illustrating the positioning of a moving object across two consecutive time slots provided by the present invention. For example... Figure 4 As shown, in time slot t-1, the moving object is located by UAVs 1, 2 and 3, and in time slot t, the moving object is located by UAVs 1, 2 and 4.

[0187] In this invention, for a time period including T consecutive time slots, the location deployment problem of multiple drones in a drone positioning network can be expressed by the following formula 6:

[0188]

[0189]

[0190]

[0191]

[0192]

[0193] Where W = {W(1),...,W(t),...,W(T)}, W represents the occupancy relationship between multiple drones and moving objects in T time slots. W(t) represents the occupancy relationship of the moving object with respect to each drone in time slot t. This represents a vector containing the identifier of the occupancy of the k-th drone by the n-th moving object. This indicates the occupancy identifier of the nth moving object on the kth drone. For example, or U = {U(1),…,U(t),…,U(T)}, where U represents the joint deployment strategy of multiple drones across T time slots. Let represent the position of the k-th UAV in time slot t, and P(t) represent the set of multiple moving objects in time slot t. Optionally, d max =v max ×T0, where v max T0 represents the maximum speed of the drone, and T0 represents the duration of a time slot.

[0194] To address the aforementioned location deployment problem (7), the location determination method for mobile objects provided by this invention can be used in each time slot to obtain the location of each mobile object in each time slot.

[0195] Optionally, the present invention uses the parameters shown in Table 1 below to simulate the location deployment problem (7). For details, please refer to [link to relevant documentation]. Figures 5 to 9 Example.

[0196] Table 1 Simulation Parameters

[0197]

[0198] Figure 5 This is one of the schematic diagrams of the simulation results provided by this invention. For example... Figure 5 As shown, this includes: the average SPEB (i.e., the average position error squared bound) of objects obtained through random deployment schemes, bit-task allocation schemes, and the scheme proposed in this invention.

[0199] from Figure 5 It can be observed that, over time, in both the random deployment scheme and the bit-task allocation scheme, the average SPEB of objects increases and the positioning accuracy decreases. This is because, as time progresses, moving objects move in different directions, becoming more dispersed, making it difficult to maintain high positioning accuracy for all moving objects.

[0200] from Figure 5 It can be observed that the proposed solution is superior to the random deployment solution and the bit-task allocation solution. This is because, in scenarios with high object mobility, a static network struggles to maintain a good geometric configuration with the object, and the object may gradually deviate from the UAV positioning network, leading to a rapid decline in positioning performance.

[0201] In random deployment scenarios, although the drone moves with the moving object, the matching relationship between the drone's position and its localization is not optimized for the moving object, thus making it difficult to provide high-precision localization.

[0202] Furthermore, in the bit-task allocation scheme, although good positioning performance can be maintained in the early stage, after the 10th time slot, the average SPEB of the object obtained by this scheme increases rapidly due to the long moving distance of the moving object.

[0203] Figure 6 This is the second schematic diagram of the simulation results provided by this invention. For example... Figure 6 As shown, this includes the average movement distance of all UAVs within all time slots obtained by the scheme of only adjusting the position, the scheme of not considering flight continuity, and the scheme proposed in this invention.

[0204] from Figure 6 It can be observed that, over time, the average distance traveled by all drones across all time slots gradually increases. This is because, in the initial stage, all drones are uniformly deployed above the object, with relatively close spatial distances, allowing for the formation of a good geometric structure with only short adjustment distances. As the object moves, the drones need to travel longer distances to achieve a better deployment shape.

[0205] from Figure 6 As can be observed, within each time slot, the proposed solution outperforms the solution that only adjusts the position and does not consider flight continuity, thus meeting the object positioning accuracy requirements of electronic equipment (i.e., the command center) with lower movement costs. This is because in the solution that only adjusts the position, the correspondence between the UAV and the object is established in the initial stage and no further adjustments are made, resulting in the UAV only being able to adjust its position along with the existing UAV without selecting a better one. In the solution that does not consider flight continuity, since the UAVs are deployed independently in each time slot and are not adjusted based on the position of the UAVs at the previous moment, some UAVs have a large spatial span in different time slots, making them difficult to use directly in dynamic scenarios.

[0206] Figure 7 This is the third schematic diagram of the simulation results provided by this invention. For example... Figure 7 As shown, this includes: using the weighted artificial bee colony algorithm (i.e. Figure 7 The proposed ABC algorithm, the proposed scheme in this invention, and the genetic algorithm (i.e. Figure 7 The GA algorithm and the particle swarm optimization algorithm (i.e.) Figure 7 The average SPEB (mean squared bound of position error) of the object obtained by the PSO algorithm in the model.

[0207] from Figure 7It can be observed that the positioning performance of the three algorithms gradually declines over time. This is because the user distribution tends to be more dispersed, making it difficult to maintain high positioning performance.

[0208] You can also from Figure 7 Observations show that the proposed ABC algorithm significantly outperforms the GA and PSO algorithms. It should be noted that the three algorithms exhibit similar performance initially because, in the initial stage, users are densely distributed and close to the drone, resulting in smaller differences in fitness values ​​among different solutions in the solution space, increasing the likelihood of the algorithm finding the optimal value. However, as the objects move and their distribution becomes more dispersed, the proposed ABC algorithm demonstrates better performance, ultimately achieving a 30.3% improvement in positioning performance compared to the GA algorithm and a 38.5% improvement compared to the PSO algorithm.

[0209] Figure 8 This is the fourth schematic diagram of the simulation results provided by this invention. For example... Figure 8 As shown, this includes the average travel distance of all UAVs within all time slots obtained based on the proposed ABC algorithm, GA algorithm, and PSO algorithm.

[0210] from Figure 8 As can be observed, the average travel distance of all drones within all time slots obtained by the three algorithms gradually increases over time. This is because when the user distribution becomes more dispersed, the number of users that the same drone can serve at the same time decreases, and more drones need to be scheduled to improve positioning performance.

[0211] from Figure 8 It can be observed that the average moving distance of all UAVs in all time slots obtained by the scheme based on the proposed ABC algorithm is significantly shorter than the average moving distance of all UAVs in all time slots obtained by the scheme based on the GA algorithm and the average moving distance of all UAVs in all time slots obtained by the scheme based on the PSO algorithm.

[0212] Over all time slots, the average UAV travel distance obtained by the proposed ABC algorithm is 36.7% less than that obtained by the GA algorithm and 40.8% less than that obtained by the PSO algorithm.

[0213] Figure 9 This is the fifth schematic diagram of the simulation results provided by this invention. For example... Figure 9 As shown, this includes the average positioning error values ​​of all moving objects before and after Kalman filtering.

[0214] from Figure 9As can be observed, the average positioning error increases slowly before and after Kalman filtering, because the error in a certain state accumulates in the subsequent states, causing the accuracy of the solved position to decrease slowly.

[0215] from Figure 9 It can also be observed that after Kalman filtering, the average positioning error remains around 5m, while before Kalman filtering, the average positioning error exceeds 12m. Therefore, using Kalman filtering to process the initial position can effectively reduce the position error of moving objects.

[0216] The following describes the device for determining the position of a moving object provided by the present invention. The device for determining the position of a moving object described below can be referred to in correspondence with the method for determining the position of a moving object described above.

[0217] Figure 10 This is a structural schematic diagram of the device for determining the position of a moving object provided by the present invention. Figure 10 As shown, the device includes:

[0218] The acquisition module 101 is used to acquire the positions of multiple moving objects in the target area in the previous time slot and the positions of multiple drones in the drone positioning network in the previous time slot.

[0219] Initialization module 102 is used to initialize M original honey sources; the original honey sources include the initial position of each drone and the initial occupancy identifier of each moving object on each drone. The initial positioning identifier indicates whether the positioning signal of the moving object is collected by the drone. M is an integer greater than or equal to 2.

[0220] The optimization module 103 is used to perform a preset number of weighted artificial bee colony optimization processes on M original honey sources based on the positions of multiple moving objects and multiple drones in the previous time slot, so as to obtain the target honey source in the current time slot; the target honey source includes the target position of each drone and the target occupancy identifier of each moving object on each drone.

[0221] The positioning module 104 is used to, for each moving object, when the target occupancy identifier is the first identifier, control the drone corresponding to the first identifier to collect the positioning signal of the moving object based on the target position of the drone corresponding to the first identifier, and determine the position of the moving object in the current time slot based on the collected positioning signal; the first identifier indicates that the positioning signal of the moving object is collected by the drone.

[0222] The device for determining the position of a moving object provided by the present invention can realize the method for determining the position of a moving object provided in any of the above embodiments, and has the same beneficial effects as the method for determining the position of a moving object, which will not be described in detail here.

[0223] In some embodiments, the optimization module 103 is specifically used for:

[0224] Perform the (j+1)th weighted artificial bee colony optimization process to obtain M new nectar sources obtained from the jth weighted artificial bee colony optimization process;

[0225] For each of the M new honey sources, the positions of the new honey source, the multiple mobile objects in the previous time slot, and the multiple drones in the previous time slot are input into the objective function model to obtain the fitness value of the new honey source.

[0226] The new honey source with the highest fitness value among the M new honey sources is determined as the optimal honey source, and the optimal honey source is recorded.

[0227] For each of the M new honey sources, a sub-honey source corresponding to the new honey source is generated based on the fitness value of the new honey source, the optimal honey source, the fitness values ​​of the M new honey sources, and the honey source selection probability calculation model; a target sub-honey source is determined from the sub-honey sources corresponding to the new honey source, and the target sub-honey source is the sub-honey source with the largest fitness value among the sub-honey sources corresponding to the new honey source;

[0228] If the fitness value of the target sub-nectar source is greater than the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is set to 0, and the target sub-nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process;

[0229] If the fitness value of the target sub-nectar source is less than or equal to the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is incremented by 1. If the control parameter after incrementing by 1 is greater than or equal to a preset threshold, then the randomly generated new nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process.

[0230] Increment j by 1, and repeat the weighted artificial colony optimization process until j equals the preset number of times. The new honey source with the largest fitness value among the M new honey sources obtained by performing the preset number of weighted artificial colony optimization processes is determined as the target honey source in the current time slot.

[0231] Initially, j = 0, and the M new nectar sources obtained by performing the 0th weighted artificial bee colony optimization process are the M original nectar sources.

[0232] In some embodiments, the optimization module 103 is specifically used for:

[0233] The fitness value of the new nectar source and the fitness values ​​of the M new nectar sources are input into the nectar source selection probability calculation model to obtain the selection probability corresponding to the new nectar source.

[0234] Based on the optimal honey source, the new honey source, and the selection probability, a sub-honey source corresponding to the new honey source is generated.

[0235] In some embodiments, the objective function model is:

[0236]

[0237] Where Z represents the fitness value, N p This indicates the total number of multiple moved objects. This represents a vector containing the position of the nth moving object in the previous time slot. λ1 represents the squared bound of the position error of the nth moving object, λ1 represents the selection weight coefficient of the UAV, and N u This indicates the total number of drones. This represents a vector containing the identifier of the occupancy of the k-th drone by the n-th moving object. λ represents the distance between the nth moving object and the kth drone in the current time slot, and λ² represents the moving distance weighting coefficient. This represents a vector containing the position of the k-th drone in the current time slot. Let represent a vector including the position of the k-th UAV in the previous time slot, where and Included in new honey sources;

[0238] The constraints of the objective function model include:

[0239] K drones collect the location signal of a moving object, where K is an integer greater than or equal to 3;

[0240] In any time slot, the squared position error of each moving object is less than the preset squared position error threshold.

[0241] For each drone, the distance between the drone's position in the previous time slot and its position in the current time slot is less than the maximum travel distance;

[0242] In the current time slot, the distance between any two drones among the multiple drones is greater than or equal to the safe flight distance.

[0243] In some embodiments, the model for calculating the probability of honey source selection is as follows:

[0244]

[0245] Where, p j Fit represents the probability of choosing a new honey source. j The fitness value of a new nectar source. mLet T represent the fitness value of the m-th new nectar source out of M new nectar sources, where T = T0 × 0.99. g-1 T0 represents the initial pressure constant, and g represents the current iteration number.

[0246] In some embodiments, the optimization module 103 is specifically used for:

[0247] The number of sub-honey sources generated is determined based on the selection probability and M;

[0248] The optimal nectar source and the new nectar source are input into the sub-nectar source generation model to generate the number of sub-nectar sources, and the sub-nectar sources corresponding to the new nectar source are obtained.

[0249] In some embodiments, the honey source generation model is as follows:

[0250]

[0251] in, w represents the weighted middle position. j This represents the weighting coefficient for new honey sources. Indicates a new honey source, w g G represents the weighting coefficient of the optimal nectar source. d Indicates the optimal honey source. This indicates the sub-nectar source corresponding to the new nectar source. Represents a random number, x rd Fit represents the average of a preset number of new honey sources randomly selected from M new honey sources. j The fitness value of a new nectar source. g This represents the fitness value of the optimal nectar source.

[0252] In some embodiments, the positioning module 104 is specifically used for:

[0253] The acquired positioning signals are used to calculate the position of the moving object in the current time slot.

[0254] Apply a Kalman filter to the initial position to obtain the position of the moving object in the current time slot.

[0255] Figure 11 This is a schematic diagram of the structure of the electronic device provided by the present invention. For example... Figure 11As shown, the electronic device may include a processor 1110, a communications interface 1120, a memory 1130, and a communication bus 1140, wherein the processor 1110, the communications interface 1120, and the memory 1130 communicate with each other via the communication bus 1140. The processor 1110 can call logical instructions in the memory 1130 to execute the position determination method for a moving object provided in any of the above embodiments.

[0256] Furthermore, the logical instructions in the aforementioned memory 1130 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0257] On the other hand, the present invention also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer is able to execute the method for determining the position of a moving object provided in any of the above embodiments.

[0258] In another aspect, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for determining the position of a moving object provided in any of the above embodiments.

[0259] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0260] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods of various embodiments or some parts of embodiments.

[0261] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for determining the position of a moving object, characterized in that, include: Acquire the positions of multiple moving objects in the target area in the previous time slot and the positions of multiple drones in the drone positioning network in the previous time slot; Initialize M initial honey sources; the initial honey sources include the initial position of each drone and the initial occupancy identifier of each moving object on each drone, the initial occupancy identifier indicating whether the drone collects the positioning signal of the moving object, and M is an integer greater than or equal to 2; Based on the positions of the multiple mobile objects and the multiple drones in the previous time slot, the M original nectar sources are subjected to a preset number of weighted artificial bee colony optimization processes to obtain the target nectar source in the current time slot; the target nectar source includes the target position of each drone and the target occupancy identifier of each mobile object on each drone; For each moving object, when the target occupancy identifier is the first identifier, based on the target position of the UAV corresponding to the first identifier, control the UAV corresponding to the first identifier to collect the positioning signal of the moving object, and determine the position of the moving object in the current time slot based on the collected positioning signal; The first identifier indicates that the location signal of the moving object is collected by the drone.

2. The method for determining the position of a moving object according to claim 1, characterized in that, The method involves performing a preset number of weighted artificial bee colony optimization processes on the M original nectar sources based on the positions of the multiple mobile objects and the multiple drones in the previous time slot, to obtain the target nectar source in the current time slot, including: Perform the (j+1)th weighted artificial bee colony optimization process to obtain M new nectar sources obtained from the jth weighted artificial bee colony optimization process; For each of the M new honey sources, the positions of the new honey source, the multiple mobile objects in the previous time slot, and the multiple drones in the previous time slot are input into the objective function model to obtain the fitness value of the new honey source. The new honey source with the highest fitness value among the M new honey sources is determined as the optimal honey source, and the optimal honey source is recorded. For each of the M new honey sources, a sub-honey source corresponding to the new honey source is generated based on the fitness value of the new honey source, the optimal honey source, the fitness values ​​of the M new honey sources, and the honey source selection probability calculation model; a target sub-honey source is determined from the sub-honey sources corresponding to the new honey source, and the target sub-honey source is the sub-honey source with the largest fitness value among the sub-honey sources corresponding to the new honey source; If the fitness value of the target sub-nectar source is greater than the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is set to 0, and the target sub-nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process; If the fitness value of the target sub-nectar source is less than or equal to the fitness value of the new nectar source, then the control parameter corresponding to the new nectar source is incremented by 1. If the control parameter after incrementing by 1 is greater than or equal to a preset threshold, then the randomly generated new nectar source is determined as the new nectar source obtained by performing the (j+1)th weighted artificial bee colony optimization process. Increment j by 1, and repeat the weighted artificial colony optimization process until j equals the preset number of times. The new honey source with the largest fitness value among the M new honey sources obtained by performing the preset number of weighted artificial colony optimization processes is determined as the target honey source in the current time slot. Initially, j=0, and the M new nectar sources obtained by performing the 0th weighted artificial bee colony optimization process are the M original nectar sources.

3. The method for determining the position of a moving object according to claim 2, characterized in that, The process of generating sub-nectar sources corresponding to the new nectar sources based on the fitness value of the new nectar source, the optimal nectar source, the fitness values ​​of the M new nectar sources, and the nectar source selection probability calculation model includes: The fitness value of the new nectar source and the fitness values ​​of the M new nectar sources are input into the nectar source selection probability calculation model to obtain the selection probability corresponding to the new nectar source. Based on the optimal honey source, the new honey source, and the selection probability, a sub-honey source corresponding to the new honey source is generated.

4. The method for determining the position of a moving object according to claim 2 or 3, characterized in that, The objective function model is as follows: ; in, This represents the fitness value. This represents the total number of the multiple moving objects. Indicates including the first The vector of the position of a moving object in the previous time slot. Indicates the first The squared bound of the positional error of a moving object This indicates the weighting coefficient for selecting drones. This indicates the total number of the multiple drones. Indicates including the first The moving object pair The vector of the drone's occupancy identifier. Indicates the first time slot in the current time slot The moving object and the first The distance between the drones This represents the weighting coefficient for the distance traveled. Indicates including the first The vector of the drone's position in the current time slot. Indicates including the first The vector of the location of the UAV in the previous time slot, where, and Included in the new honey source; The constraints of the objective function model include: , An integer greater than or equal to 3; In any given time slot, the squared position error of each moving object is less than a preset squared position error threshold. For each of the aforementioned drones, the distance between the drone's position in the previous time slot and its position in the current time slot is less than the maximum travel distance; In the current time slot, the distance between any two drones among the multiple drones is greater than or equal to the safe flight distance.

5. The method for determining the position of a moving object according to claim 2 or 3, characterized in that, The model for calculating the probability of honey source selection is as follows: ; in, This represents the selection probability corresponding to the new honey source. This represents the fitness value of the new honey source. Represents the first of the M new honey sources The fitness value of a new nectar source. These are intermediate calculation parameters obtained based on the current iteration number and the initial pressure constant. , Indicates the initial pressure constant. This indicates the current iteration number.

6. The method for determining the position of a moving object according to claim 3, characterized in that, The step of generating a sub-honey source corresponding to the new honey source based on the optimal honey source, the new honey source, and the selection probability includes: Based on the selection probability and M, the number of sub-honey sources generated is determined; Based on the number of secondary honey sources generated, the optimal honey source and the new honey source are input into the secondary honey source generation model. The number of sub-nectar sources corresponding to the new nectar source is the same as the number of sub-nectar sources generated.

7. The method for determining the position of a moving object according to claim 6, characterized in that, The sub-nectar source generation model is as follows: ; in, Indicates the middle position of the weighted average. This represents the weighting coefficient of the new honey source. This refers to the new honey source. This represents the weighting coefficient of the optimal honey source. This indicates the optimal honey source. This indicates the sub-nectar source corresponding to the new nectar source. Represents a random number. This represents the average value of a preset number of new honey sources randomly selected from the M new honey sources. This represents the fitness value of the new honey source. This represents the fitness value of the optimal honey source.

8. The method for determining the position of a moving object according to any one of claims 1 to 3, characterized in that, Based on the acquired positioning signals, determining the position of the moving object in the current time slot includes: The acquired positioning signal is used to calculate the position of the moving object in the current time slot. The initial position is subjected to Kalman filtering to obtain the position of the moving object in the current time slot.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method for determining the position of a moving object as described in any one of claims 1 to 8.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the method for determining the position of a moving object as described in any one of claims 1 to 8.

Citation Information

Patent Citations

  • Artificial bee colony algorithm-based unmanned aerial vehicle group cooperative coverage flight route planning method

    CN108459616A

  • Position Determination of Moving Object

    CN112180401A