Deployment algorithm of large-scale RFID (radiofrequency identification) readers in three-dimensional space

Abstract

The invention provides a deployment algorithm of large-scale RFID (radiofrequency identification) readers in three-dimensional space. The deployment algorithm is characterized by utilizing a quantification method to respectively convert a reader-writer model and a to-be-covered region model in the three-dimension space into a three-dimensional matrix, and transforming the deployment of the reader-writer into the deployment of the three-dimensional matrix according to the matrix theory; to difference in propagation directions of reader antennas, providing a method for building a reader three-dimensional covering model matrix set through rotation matrix so as to realize mapping setting of the reader antennas; further, providing methods for calculating performance index of coverage rate and overlap rate in the deployment algorithm; finally, to deployment of the RFID readers, providing an improved strategy of a particle swarm algorithm on the basis of rule of elimination. Reader border crossing and elimination systems are added in the strategy, and the standard particle swarm algorithm is improved.

Description

technical field [0001] The invention relates to a deployment algorithm of large-scale RFID readers in three-dimensional space. Firstly, the algorithm performs three-dimensional modeling of the RFID reader, and transforms the NP-hard problem of RFID reader deployment in three-dimensional space into a three-dimensional matrix deployment problem. According to the common electromagnetic propagation model of UHF RFID reader, the A three-dimensional matrix reader model is proposed, which is simple to implement in deployment simulation and has low computational complexity. At the same time, an improved particle swarm optimization algorithm based on elimination rules is proposed, which adds the out-of-bounds detection of reader coverage and For the discarding of bad particles in the population, compared with the standard particle swarm optimization algorithm, this algorithm can not only detect invalid readers deployed outside the coverage area and bring them back into the target area,...

AI Technical Summary

Problems solved by technology

[0009] Standard PSO is a random search algorithm. Its advantage is that the algorithm can quickly converge in the initial stage of iteration, but in the later stage of algorithm iteration, all particles are close to the optimal particle in the group, and the position difference between particles Gradually decreases, and the speed of the particles gradually tends to zero from the initial speed. At this time, the particles lose the ability to explore new spaces due to lack of activity, and the algorithm is easily trapped in the local extremum

Moreover, this phenomenon cannot be significantly improved with the increase of the number of iterations of the algorithm.

Images