RFID antenna optimal deployment method based on jellyfish swarm algorithm
A swarm algorithm and jellyfish technology, applied in computer components, calculations, calculation models, etc., can solve the problems of not proposing the primary and secondary, and not getting the optimal deployment plan of RFID antennas
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0071] see figure 1 , is the distribution of tags randomly generated within a specified range in an RFID antenna optimal deployment method based on the jellyfish swarm algorithm of the present invention. In the RFID system, there is a one-to-one relationship between the position status of the jellyfish group and the position status of the reader. An RFID reader represents a jellyfish, and the jellyfish group represents the feasible solution of the entire area. Each jellyfish corresponds to a potential untie. The N readers in the system correspond to the N 3K-dimensional jellyfish group individuals in the system, and the tags are randomly distributed in the experimental area. The jellyfish group continuously searches for food sources through a chain structure, constantly updates the jellyfish's position, and re- Calculate the fitness of the updated jellyfish, and compare the fitness, so that the algorithm can get a solution set after reaching the maximum number of iterations. ...
example
[0076] x=[24.4, 2.9, 0.3, 27.1, 8.4, 0.7, 3.8, 16.4, 1.5, 27.4, 28.7, 0.9, 19.0, 28.9, 1.8]
[0077] At this point, suppose there are 5 jellyfish, and each jellyfish corresponds to a reader. The example is as follows:
[0078]
[0079] Step 3) Model building stage: use the organized training data as input, optimize the training data through the jellyfish swarm algorithm, and construct the jellyfish swarm algorithm optimization deployment model;
[0080] Step 4) Optimizing the deployment stage: define the number of iterations L=500, when the number of iterations is completed, the algorithm ends, or when the solution set in the algorithm cannot be changed, the algorithm ends. At this time, according to the information of each reader, the fitness is calculated based on the label, and a set of data with 5 rows and 3 columns is obtained. The structure is as follows:
[0081]
[0082] The example is as follows to get the fitness matrix:
[0083]
[0084] Through the compa...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


