Robust Location Detection Based on Identifying Codes
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Oct 22, 2009
app pub date -
Sep 13, 2005
filing date -
Sep 13, 2005
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
Positioning beacons (109-a . . . 109-d; 602-1 . . . 602-K) are shown in a target area (100) of a location detection system (600) with location areas (103-a . . . 103-g) in the target area associated with potential beacon positions (102-a . . . 102-g) and represented by vertices (106-a . . . 106-g) of a graph (105). Reliable connectivity between location areas is represented by edges between vertices that represent the location areas. The beacons are assigned to location areas of a subset of vertices of the graph, which subset represents a robust 1-identifying code. The graph may be constrained to a regular topology to exploit availability of optimum or close-to-optimum t-edge-robust and t-vertex-robust 1-identifying codes for such regular topologies. A greedy search algorithm (400-425) may be used to find a small subset of vertices representing t-vertex-robust 1-identifying codes.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully