Study on optimization of anti-collision algorithm for mixed query tree

This paper studies the hybrid query tree algorithm, which uses the combined information of the largest and smallest collision bits to classify the markers. The labels are placed in four matrices to reduce collisions. The function analysis shows that the algorithm is better than QT and HQT by reducing the number of queries and system communication frequency. Thereby greatly improving the efficiency of label recognition.