MASHUP OF AP LOCATION AND MAP INFORMATION FOR WIFI BASED INDOOR POSITIONING
First Claim
1. A processor implemented method for merging disjoint maps, the method comprising:
- receiving a digital file comprising a pathway map;
receiving a transmitter map comprising identifiers for a plurality of transmitters;
receiving a first trajectory plot, of a mobile device, relative to the transmitter map;
setting a plurality of hypotheses each defining a unique translation between the transmitter map and the pathway map;
computing, in the processor, a plurality of costs, wherein each cost of the plurality of costs comprises a cost of the first trajectory plot through the pathway map based on a respective one of the plurality of hypotheses; and
selecting one hypothesis from the plurality of hypotheses, based on a minimum of the plurality of costs.
2 Assignments
0 Petitions
Accused Products
Abstract
An apparatus and method for merging a disjoint pair of maps comprising a digital building map that includes a floor plan and an access point (AP) map that includes identifiers for a plurality of access points is presented. In some embodiments, a first trajectory plot, of a mobile device, relative to the AP map, is received and a plurality of hypotheses is set, where each hypothesis defines a unique translation between the AP map and the building map. A plurality of costs may be computed for the first trajectory, where each cost of the first trajectory corresponds to a distinct hypothesis in the plurality of hypotheses. The hypothesis where the first trajectory has the lowest cost relative to the other hypotheses may be selected.
-
Citations
36 Claims
-
1. A processor implemented method for merging disjoint maps, the method comprising:
-
receiving a digital file comprising a pathway map; receiving a transmitter map comprising identifiers for a plurality of transmitters; receiving a first trajectory plot, of a mobile device, relative to the transmitter map; setting a plurality of hypotheses each defining a unique translation between the transmitter map and the pathway map; computing, in the processor, a plurality of costs, wherein each cost of the plurality of costs comprises a cost of the first trajectory plot through the pathway map based on a respective one of the plurality of hypotheses; and selecting one hypothesis from the plurality of hypotheses, based on a minimum of the plurality of costs. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. A mobile device for merging disjointed maps, the device comprising:
-
means for receiving a digital file comprising a route map; means for receiving a transmitter map comprising identifiers for a plurality of transmitters; means for receiving a first trajectory plot, of a mobile device, relative to the transmitter map; means for setting a plurality of hypotheses each defining a unique translation between the transmitter map and the route map; means for computing a plurality of costs, wherein each cost of the plurality of costs comprises a cost of the first trajectory plot through the route map based on a respective one of the plurality of hypotheses; and means for selecting one hypothesis from the plurality of hypotheses, based on a minimum of the plurality of costs. - View Dependent Claims (23, 24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A device comprising a processor and a memory for merging disjointed maps, wherein the memory includes software instructions for:
-
receiving a digital file comprising a route map; receiving transmitter map comprising identifiers for a plurality of transmitters; receiving a first trajectory plot, of a mobile device, relative to the transmitter map; setting a plurality of hypotheses each defining a unique translation between the transmitter map and the route map; computing a plurality of costs, wherein each cost of the plurality of costs comprises a cost of the first trajectory plot through the route map based on a respective one of the plurality of hypotheses; and selecting one hypothesis from the plurality of hypotheses, based on a minimum of the plurality of costs. - View Dependent Claims (33, 34, 35)
-
-
36. A computer-readable storage medium including program code stored thereon, comprising program code for:
-
receiving a digital file comprising a route map; receiving a transmitter map comprising identifiers for a plurality of transmitters; receiving a first trajectory plot, of a mobile device, relative to the transmitter map; setting a plurality of hypotheses each defining a unique translation between the transmitter map and the route map; computing, in a processor, a plurality of costs, wherein each cost of the plurality of costs comprises a cost of the first trajectory plot through the route map based on a respective one of the plurality of hypotheses; and selecting one hypothesis from the plurality of hypotheses, based on a minimum of the plurality of costs.
-
Specification