A method and system for dividing tagged items into subsets. A region is split into subregions. For each subregion, a central tagged item having more adjacent tagged items in each subregion than any other tagged item in each subregion is determined, utilizing information that includes, for each tagge
A method and system for dividing tagged items into subsets. A region is split into subregions. For each subregion, a central tagged item having more adjacent tagged items in each subregion than any other tagged item in each subregion is determined, utilizing information that includes, for each tagged item in the region, a spatial location of each tagged item and a list of all other tagged items which are adjacent to each tagged item by being within a specified constant distance (Rlimit) from each tagged item. A virtual boundary is outlined around the central tagged item to enclose the central tagged item and a portion of the tagged items in each subregion which are adjacent to the central tagged item. The portion of the tagged items in each subregion consists of all, or less than all, tagged items which are adjacent to the central tagged item in each subregion.
대표청구항▼
1. A method for dividing a set of tagged items into subsets, said method comprising: splitting, by a processor of a computer system, a region into a plurality of non-overlapping subregions such that the region consists of the non-overlapping subregions collectively, said region having fixed boundari
1. A method for dividing a set of tagged items into subsets, said method comprising: splitting, by a processor of a computer system, a region into a plurality of non-overlapping subregions such that the region consists of the non-overlapping subregions collectively, said region having fixed boundaries and comprising the set of tagged items, each subregion comprising at least one tagged item of the set of tagged items;said processor determining which tagged item in each subregion is a centered tagged item, said determining which tagged item in each subregion is the centered tagged item comprising utilizing information to determine that the centered tagged item in each subregion has more adjacent tagged items in the subregion containing the centered tagged item than does each other tagged item in the subregion containing the centered tagged item, wherein the information comprises, for each tagged item in the region, a spatial location of each tagged item and a list of all other tagged items in the region which are adjacent to each tagged item by being within a specified constant distance (Rlimit) from each tagged item, wherein said utilizing the information to determine each centered tagged item comprises utilizing the spatial location of each tagged item in the subregion containing the centered tagged item and the list of all other tagged items in the subregion containing the centered tagged item which are adjacent to each tagged item in the subregion containing the centered tagged item by being within the specified constant distance (Rlimit) from each tagged item in the subregion containing the centered tagged item;said processor selecting the centered tagged item in each subregion as a central tagged item for each subregion; andsaid processor outlining a virtual boundary around the central tagged item to enclose the central tagged item and a portion of the tagged items in each subregion which are adjacent to the central tagged item by being within the specified constant distance (Rlimit) of the central tagged item, said virtual boundary defining a subset of the set of tagged items for each subregion as comprising the central tagged item and all other tagged items within the virtual boundary, wherein the portion of the tagged items in each subregion consists of all, or less than all, tagged items which are adjacent to the central tagged item in each subregion. 2. The method of claim 1, wherein the portion of the tagged items in each subregion consist of all tagged items which are adjacent to the central tagged item in each subregion. 3. The method of claim 1, wherein the portion of the tagged items in a first subregion of the plurality of subregions consist of less than all tagged items which are adjacent to the central tagged item in the first subregion. 4. The method of claim 3, wherein the first subregion comprises an outer tagged item that is not within the virtual boundary and is not adjacent to the central tagged item in the first subregion, and wherein the method further comprises: determining a first distance between the outer tagged item and the virtual boundary;ascertaining that the first distance exceeds a specified threshold distance;responsive to said ascertaining, creating a new subset of the set of tagged items and designating the outer tagged item a central tagged item of the new subset. 5. The method of claim 3, wherein the first subregion comprises an outer tagged item that is not within the virtual boundary and is not adjacent to the central tagged item in the first subregion, and wherein the method further comprises: determining a first distance between the outer tagged item and the virtual boundary;ascertaining that the first distance does not exceed a specified threshold distance;responsive to said ascertaining, adding the outer tagged item to the subset defined by the virtual boundary in the first subregion. 6. The method of claim 1, wherein each tagged item of the set of tagged items is tagged with a passive Radio Frequency Identification (RFID) tag, wherein the region is entirely within a communication range (Rrange) of the RFID reader, and wherein the method further comprises: said processor instructing the RFID reader to poll the RFID tags of all tagged items to generate the information. 7. The method of claim 6, wherein the method comprises: said RFID reader polling the RFID tags of all tagged items in the region, wherein said polling comprises sending an identification request to the RFID tags of each tagged item in the region, and wherein the identification request comprises an identifier of the RFID tag to which each identification request is sent, a distance between the RFID reader and the RFID tag to which each identification request is sent, and the specified constant distance (Rlimit). 8. The method of claim 7, wherein the said polling comprises the RFID reader transmitting a polling command addressed to a passive RFID tag B in the region, and wherein the method further comprises: a passive RFID tag A receiving the polling command previously transmitted from the RFID reader and addressed to the passive RFID tag B;said RFID tag A determining that the polling command is not addressed to the RFID tag A;in response to the RFID tag A determining that the polling command is not addressed to the RFID tag A, at a time t1 said RFID tag A switching the RFID tag A to a catching mode configured to catch echos from other tags;said RFID tag A receiving at a time t3 an echo of a message sent by the RFID tag B to the RFID reader in response to the polling command received by the RFID tag B at a time t2, wherein the echo comprises an identification of the RFID tag B, and wherein t3>t2>t1;said RFID tag A determining a distance (D.t2t) between the RFID tag A and the RFID tag B based on a total timing (TT) equal to t3 minus t1;said RFID tag A ascertaining that the distance D.t2t does not exceed a radius limit consisting of the specified constant distance (Rlimit); andresponsive to said ascertaining, said RFID tag storing the identification of the RFID tag B and the distance D.t2t in a database within the RFID tag A. 9. The method of claim 8, wherein the method further comprises: at a time later than the time t3, said RFID tag A sending an identification message to the RFID reader, wherein the identification message includes an identifier of the RFID tag A, a distance between the RFID tag A and the RFID reader, the radius limit, the identification of the RFID tag B, and the distance D.t2t. 10. The method of claim 8, wherein said determining the distance D.t2t comprises determining D.t2t according to: D.t2t=(TT−Ttrig−TE.r2t.tagB−TE.r2t.tagA)*C wherein Ttrig is a specified delay that is not less than a sum of a tag access time for reading the polling command and a granted time for processing the polling command, wherein TE.r2t.tagA is a time for the polling command to be transmitted from the RFID reader to the RFID tag A, wherein TE.r2t.tagB is a time for the polling command to be transmitted from the RFID reader to the RFID tag B, wherein the polling command comprises TE.r2t.tagB, and wherein C is the speed of light. 11. A computer program product comprising a computer readable tangible storage device having computer readable program code embodied in the storage device, said program code executable on a processor of a computer system to perform a method for dividing a set of tagged items into subsets, said method comprising: said processor splitting a region into a plurality of non-overlapping subregions such that the region consists of the non-overlapping subregions collectively, said region having fixed boundaries and comprising the set of tagged items, each subregion comprising at least one tagged item of the set of tagged items;said processor determining which tagged item in each subregion is a centered tagged item, said determining which tagged item in each subregion is the centered tagged item comprising utilizing information to determine that the centered tagged item in each subregion has more adjacent tagged items in the subregion containing the centered tagged item than does each other tagged item in the subregion containing the centered tagged item, wherein the information comprises, for each tagged item in the region, a spatial location of each tagged item and a list of all other tagged items in the region which are adjacent to each tagged item by being within a specified constant distance (Rlimit) from each tagged item, wherein said utilizing the information to determine each centered tagged item comprises utilizing the spatial location of each tagged item in the subregion containing the centered tagged item and the list of all other tagged items in the subregion containing the centered tagged item which are adjacent to each tagged item in the subregion containing the centered tagged item by being within the specified constant distance (Rlimit) from each tagged item in the subregion containing the centered tagged item;said processor selecting the centered tagged item in each subregion as a central tagged item for each subregion; andsaid processor outlining a virtual boundary around the central tagged item to enclose the central tagged item and a portion of the tagged items in each subregion which are adjacent to the central tagged item by being within the specified constant distance (Rlimit) of the central tagged item, said virtual boundary defining a subset of the set of tagged items for each subregion as comprising the central tagged item and all other tagged items within the virtual boundary, wherein the portion of the tagged items in each subregion consists of all, or less than all, tagged items which are adjacent to the central tagged item in each subregion. 12. The computer program product of claim 11, wherein the portion of the tagged items in each subregion consist of all tagged items which are adjacent to the central tagged item in each subregion. 13. The computer program product of claim 11, wherein the portion of the tagged items in a first subregion of the plurality of subregions consist of less than all tagged items which are adjacent to the central tagged item in the first subregion. 14. The computer program product of claim 13, wherein the first subregion comprises an outer tagged item that is not within the virtual boundary and is not adjacent to the central tagged item in the first subregion, and wherein the method further comprises: determining a first distance between the outer tagged item and the virtual boundary;ascertaining that the first distance exceeds a specified threshold distance;responsive to said ascertaining, creating a new subset of the set of tagged items and designating the outer tagged item a central tagged item of the new subset. 15. The computer program product of claim 13, wherein the first subregion comprises an outer tagged item that is not within the virtual boundary and is not adjacent to the central tagged item in the first subregion, and wherein the method further comprises: determining a first distance between the outer tagged item and the virtual boundary;ascertaining that the first distance does not exceed a specified threshold distance;responsive to said ascertaining, adding the outer tagged item to the subset defined by the virtual boundary in the first subregion. 16. A computer system comprising a processor and a computer readable tangible storage device having computer readable program code embodied in the storage device, said program code executable on the processor to perform a method for dividing a set of tagged items into subsets, said method comprising: said processor splitting a region into a plurality of non-overlapping subregions such that the region consists of the non-overlapping subregions collectively, said region having fixed boundaries and comprising the set of tagged items, each subregion comprising at least one tagged item of the set of tagged items;said processor determining which tagged item in each subregion is a centered tagged item, said determining which tagged item in each subregion is the centered tagged item comprising utilizing information to determine that the centered tagged item in each subregion has more adjacent tagged items in the subregion containing the centered tagged item than does each other tagged item in the subregion containing the centered tagged item, wherein the information comprises, for each tagged item in the region, a spatial location of each tagged item and a list of all other tagged items in the region which are adjacent to each tagged item by being within a specified constant distance (Rlimit) from each tagged item, wherein said utilizing the information to determine each centered tagged item comprises utilizing the spatial location of each tagged item in the subregion containing the centered tagged item and the list of all other tagged items in the subregion containing the centered tagged item which are adjacent to each tagged item in the subregion containing the centered tagged item by being within the specified constant distance (Rlimit) from each tagged item in the subregion containing the centered tagged item;said processor selecting the centered tagged item in each subregion as a central tagged item for each subregion; andsaid processor outlining a virtual boundary around the central tagged item to enclose the central tagged item and a portion of the tagged items in each subregion which are adjacent to the central tagged item by being within the specified constant distance (Rlimit) of the central tagged item, said virtual boundary defining a subset of the set of tagged items for each subregion as comprising the central tagged item and all other tagged items within the virtual boundary, wherein the portion of the tagged items in each subregion consists of all, or less than all, tagged items which are adjacent to the central tagged item in each subregion. 17. The computer system of claim 16, wherein the portion of the tagged items in each subregion consist of all tagged items which are adjacent to the central tagged item in each subregion. 18. The computer system of claim 16, wherein the portion of the tagged items in a first subregion of the plurality of subregions consist of less than all tagged items which are adjacent to the central tagged item in the first subregion. 19. The computer system of claim 18, wherein the first subregion comprises an outer tagged item that is not within the virtual boundary and is not adjacent to the central tagged item in the first subregion, and wherein the method further comprises: determining a first distance between the outer tagged item and the virtual boundary;ascertaining that the first distance exceeds a specified threshold distance;responsive to said ascertaining, creating a new subset of the set of tagged items and designating the outer tagged item a central tagged item of the new subset. 20. The computer system of claim 18, wherein the first subregion comprises an outer tagged item that is not within the virtual boundary and is not adjacent to the central tagged item in the first subregion, and wherein the method further comprises: determining a first distance between the outer tagged item and the virtual boundary;ascertaining that the first distance does not exceed a specified threshold distance;responsive to said ascertaining, adding the outer tagged item to the subset defined by the virtual boundary in the first subregion.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (41)
Lindsay,Jeffrey Dean; Velazquez,Heriberto Flores; Chen,Fung jou; Wagner,Eric Francis, Activating a data tag by load or orientation or user control.
Bauchot, Frederic; Marmigere, Gerard; Secondo, Pierre, Apparatus for securing a land surveyor'S mark based on the use of a radio frequency identifier tag.
Lindsay,Jeffrey Dean; Velazquez,Heriberto Flores; Chen,Fung jou; Wagner,Eric Francis, Deactivating a data tag for user privacy or tamper-evident packaging.
Bowers John H. ; Clare Thomas J., RFID tags which are virtually activated and/or deactivated and apparatus and methods of using same in an electronic security system.
Moskowitz Paul A. (Yorktown Heights NY) Brady Michael J. (Brewster NY) Coteus Paul W. (Yorktown Heights NY), Radio frequency circuit and memory in thin flexible package.
Maltseff, Paul A.; Winter, Steven; Nikitin, Pavel; Kodukula, Venkata; Erosheva, Elena, Stochastic communication protocol method and system for radio frequency identification (RFID) tags based on coalition formation, such as for tag-to-tag communication.
Enelow Michael R. (Miami Lakes FL) Levy Michael (Plantation FL) Porter William P. (Coral Springs FL), System for indicating and controlling dispensing of beverages.
Heaton Harley L. (Manassas VA) Arneson Michael R. (Westminster MD) LaRocca Guy P. (Centreville VA), Tamper-proof device for detecting opening and closing of a secure container.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.