Date Added: Aug 2009
The availability of fast anti-collision algorithms is crucial for most RFID applications. This paper aims to evaluate these algorithms for applications in which it is not intended to identify the entirety of moving objects but to detect as much tags as needed to allow orientation. The navigation of Automated Guided Vehicles (AGV) by distributed landmarks is an example which clarifies the discriminative requirements compared to supply chain tasks. For the former purpose redundant information can be gained from different tags. This requires the detection of an application dependent percentage of all tags. Because AGVs are moving, the detection and read and write operations have to be close together and very fast, since repetitive communication is not always possible.