# Patent

## Title
Systems and methods for determining network access point locations

## Abstract

A positioning method for a mobile platform includes acquiring GPS position data associated with the mobile platform from a plurality of GPS satellites observable by the mobile platform. A set of wireless range measurements associated with the mobile platform and a plurality of wireless access points in communication with the mobile platform are received (e.g., via time-of-flight measurements). Wireless position data associated with the plurality of wireless access points is received from a server communicatively coupled to the mobile platform over a network. A corrected position of the mobile platform based on the wireless position data, the wireless range measurements, and the GPS position data.

## Background
TECHNICAL FIELD
The technical field generally relates to network access points, and more particularly relates to systems and methods for determining the location of network access points in an environment.
BACKGROUND
Recent years have seen a dramatic increase in the use of mobile platforms incorporating both wireless networking capabilities (e.g., WiFi) and global positioning system (GPS) capabilities. Such mobile platforms include, for example, mobile computing devices (such as laptop computers, tablet computers, smartphones, etc.) and various systems of transportation (automotive vehicles, buses, motorcycles, and the like). In instances where GPS information is not available, or when it is not desirable to enable the GPS capabilities of such mobile platforms (e.g., due to battery life concerns), the position of the mobile platform may be estimated using information relating to one or more network access points (e.g., “WiFi” access points conforming to one or more of the IEEE 802.11 family of standards) within range of the mobile platform. That is, if it is determined that a mobile platform is within range of multiple access points with known geographical locations, and those ranges are known (e.g., through time-of-flight measurements) the position of the mobile platform itself may be estimated based on the range information. The accuracy of such position estimates are limited, however, by the accuracy of the access point positions themselves. While a manual survey of available access points may be performed to populate a database of access point positions, such a method may be susceptible to errors when, for example, one or more of the access points are relocated.
Accordingly, it is desirable to provide improved systems and methods for estimating and storing the position of network access points in an environment. Additional desirable features and characteristics of the present invention will become apparent from the subsequent detailed description and the appended claims, taken in conjunction with the accompanying drawings and the foregoing technical field and background.
SUMMARY
An access point position learning method in accordance with one embodiment includes acquiring first GPS position data associated with a first mobile platform and acquiring a first wireless range measurement associated with the first mobile platform and a wireless access point in communication with the first mobile platform. A first estimated position of the wireless access point is determined based on the first GPS position data and the first wireless range measurement. Second GPS position data associated with a second mobile platform is acquired, and a second wireless range measurement associated with the second mobile platform and the wireless access point is acquired. A second estimated position of the wireless access point is then determined based on the first estimated position, the second GPS position data, and the second wireless range measurement.
An access point position learning module in accordance with one embodiment generally includes a processor and a memory. The memory is configured to store software instructions that, when executed by the processor, cause the processor to: acquire first GPS position data associated with a first mobile platform; acquire a first wireless range measurement associated with the first mobile platform and a wireless access point in communication with the first mobile platform; determine a first estimated position of the wireless access point based on the first GPS position data and the first wireless range measurement; acquire second GPS position data associated with a second mobile platform; acquire a second wireless range measurement associated with the second mobile platform and the wireless access point; and determine a second estimated position of the wireless access point based on the first estimated position, the second GPS position data, and the second wireless range measurement.



DESCRIPTION OF THE DRAWINGS
The exemplary embodiments will hereinafter be described in conjunction with the following drawing figures, wherein like numerals denote like elements, and wherein:
FIG. 1 is a conceptual block diagram of an access point positioning system in accordance with various embodiment;
FIG. 2 is a conceptual block diagram of a position learning module in accordance with various embodiments;
FIG. 3 is a conceptual flow diagram of a position learning method in accordance with various embodiments; and
FIG. 4 is a flowchart depicting a position learning method in accordance with various embodiments.



DETAILED DESCRIPTION
The subject matter described herein generally relates to systems and methods for estimating the locations of network access points in an environment using a self-learning technique applied to information received from multiple mobile platforms. In this way, by “crowd-sourcing” position information from many mobile platforms and continually refining the value of the position information over time, a more robust and accurate database of access point positions may be provided. In that regard, the following detailed description is merely exemplary in nature and is not intended to limit the application and uses. Furthermore, there is no intention to be bound by any expressed or implied theory presented in the preceding technical field, background, brief summary or the following detailed description. As used herein, the term “module” refers to an application specific integrated circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group) and memory that executes one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality.
Referring to FIG. 1, a positioning system 100 in accordance with one embodiment generally includes a number of mobile platforms 161, 162, and 163 in communication with (e.g., within range of) a wireless access point (“APs”) 141, where dotted lines 151, 152, and 153 designate, respectively, the distance or “range” from mobile platforms 161, 162, and 163 to AP 141. Mobile platforms 161-163 may include, for example, mobile computing devices, such as laptop computers, tablet computers, smartphones, etc., and systems of transportation, such as vehicles, which can include buses, motorcycles, trains, marine vessels, aircraft, rotorcraft and the like. Mobile platforms 161-163 are also capable of communicating with, and determining a position of the mobile platforms 161-163 with respect to environment 110, using one or more positioning satellites (e.g., GPS satellites) 101-104.
Mobile platforms 161-163 are further configured to communicate with a backend server (or simply “server”) 192 over a network 190. As described in further detail below, server 192 includes a database 194 configured to store positional data 195 associated with AP 141 as determined via mobile platforms 161-163. That is, server 192 knows, within some range of accuracy (as described further below), the geographical position of AP 141 as determined by a position learning module (or “learning module”) 193 that is configured to receive from mobile platforms 161-163 information regarding their respective positions (determined, for example, via GPS satellites 101-104) as well as information regarding ranges 151-153, and thereby continually refine and “learn” the location of access point 141 automatically. In this regard, it will be appreciated that any number of mobile platforms may be within range of access point 141 at any given time, and that FIG. 1 is not intended to be limiting. For example, thousands of vehicles or other mobile platforms might, on a day-to-day basis, fall within range of access point 141 (e.g., if access point 141 is located near a busy street). Furthermore, a single mobile platform (e.g., mobile platform 161) may, over time, be within range of access point 141 on multiple occasions and with varying positions within environment 110 such that, in conjunction with learning module 193, it may assist with refining the position of access point 141 on its own.
Wireless access point 141 may be implemented as any form of network component configured to provide wireless access to a network (e.g., a local area network or the Internet). In accordance with one embodiment, AP 141 is implemented as an access point conforming to one or more of the IEEE 802.11 family of standards (e.g., “WiFi”). In one embodiment, wireless access point 141 is implemented as what is often termed a “next-gen” WiFi AP that includes the capability of determining range measurement using time-of-flight techniques. That is, mobile platforms 161-163 are configured to determine ranges 151-153, respectively, based on the time required for signals to “echo” back and forth between mobile platforms 161-162 and AP 141.
In general, GPS satellites 101-104 broadcast microwave signals that allow GPS receivers (e.g., mobile platforms 161-163) on or near the Earth's surface (in environment 110) to determine the location of the GPS satellites 101-104 as well as a synchronized time value. GPS signals, as are known in the art, generally include ranging signals (i.e., pseudorange, carrier phase, and Doppler), used to measure the distance and change rate of distance to the respective satellites (101-104), as well as various navigation messages. The navigation messages include, for example, ephemeris data (used to calculate the position of each satellite 101-104 in orbit) and information about the time and status of the entire satellite constellation—i.e., the “almanac.” In general, such information is referred to herein collectively as “GPS position data.” In one embodiment, the GPS position data is provided relation to an earth-centered, earth-fixed (ECEF) coordinate frame, as is known in the art.
While FIG. 1 illustrates four satellites 101-104, it will be appreciated that the mobile platforms 161-163 may, depending on the conditions, observe a greater or lesser number of such satellites. While it is generally desirable that at least four GPS satellites be observable at all times (to provide suitably accurate position data), in the case of urban canyon environments and the like it is not unusual for only two or three satellites to be observable. Under such conditions, as mentioned above, the position data derived from satellites 101-104 may be ambiguous. In such cases, however—using again the example of an urban canyon environment—there may be many APs (such as 141) within range of one of the mobile platforms 161-163 (e.g., within a neighborhood with a dense concentration of access points). These APs will serve as additional satellites for assist mobile platforms to position themselves.
Position data 195, as mentioned briefly above, includes information regarding access point 141 (as well as any number of additional access points), and may take the form of any suitable data structure known in the art, such as a SQL database, a flat-file database, an associative array, or the like. In one embodiment, position data 195 includes the estimated position of access point 141 (e.g., the current, best guess as to the position of access point 141 relative to any convenient reference frame), a unique identifier for access point 141, and statistical data associated with the first estimated position (e.g., a confidence level associated with the estimate and covariance matrix indicating the accuracy of the estimate). In one embodiment, the position data 195 is a table that includes a unique media access control (MAC) address for each currently known wireless access point, the estimated position of each wireless access point, and statistical distribution data associated with the first estimated position. This exemplary table structure is illustrated below for an example access point 141 having a MAC ID “00:50:56:cf:e3:01”, a position p (expressed as x, y, and z coordinates in any convenient reference frame), a number of measurements n corresponding to how many range measurements (such as range 151) have been processed by learning module 193 for access point 141, and a statistical distribution expressed, in this embodiment, as a tuple of values R and z, each corresponding to a portion of an “information array” as described in further detail below.















No. of



MAC Id
Position
Measurements
Distribution







00:50:56:cf:e3:01
p = (X, Y, Z)
n
[R, z]


. . .
. . .
. . .
. . .


. . .
. . .
. . .
. . .









In one embodiment, the position of an AP (such as 141) is modeled as a Gaussian distributed multivariate with the mean p and covariance matrix Σ, wherein the information array [R, z] is defined as RTR=Σ−1, and z=Rp.
Referring now to FIG. 2 in conjunction with FIG. 1, a more detailed block diagram of learning module 193 in accordance with an exemplary embodiment will be described. In general, learning module 193 includes a processor 202 (e.g. a microprocessor, microcontroller, etc.), a memory component 204 (e.g., RAM, ROM, etc.), and storage component 206 (e.g., a solid-state drive (SSD), a convention hard-drive, or the like). Processor 202 is configured to execute software instructions stored in memory component 204 to provide the functionality described herein.
In general, the learning module 193 is, in general, configured to iteratively determine and refine an estimate of the position of access point 141 based on information crowd-sourced from the multiple mobile platforms 161-163. This is illustrated conceptually in FIG. 3. In one example, a refinement function 306 (implemented within the learning module 193) receives as input two sets of data: a previous estimate 304 of the location of access point 141 (e.g., position information 195 for access point 141 as stored in database 194), and a “current” estimate 302 related to access point 141 (e.g., ranges 151-153 and GPS position data for mobile platforms 161-163). Using this information, the refinement function 306 produces an updated or “improved” estimate 308, which then becomes the new value for “previous” estimate 304. Refinement function 306 may operate on estimates 302 and 304 at specified times, at regular intervals, or when a predetermined amount of current estimates 302 are available.
Having thus given an overview of the positioning system 100 and the learning module 193 in accordance with one embodiment, FIG. 4 is a flowchart depicting a learning method 400 in accordance with various embodiments, and will, without loss of generality, be described in conjunction with the embodiment shown in FIG. 1.
Initially, at 402, position information is received by the learning module 193 from the various mobile platforms 161-163 operating within environment 110. This packet of information will generally include the GPS position data associated with mobile platforms 161-163 as well as the range measurements 151-153. Next, at 404, the packets of information are organized in a manner consistent with the position information 195—e.g., as a table including a MAC ID of access point 141, an identifier of the corresponding mobile platforms 161-163, and an aggregate of the measurements made with respect to access point 141 within a predetermined time window.
Next, at 406, it is determined whether an estimated position is actually available for access point 141 within database 194. That is, in some cases—particularly when a new access point is installed in environment 110—position information 195 may not include the MAC address or other unique identifier associated with that access point 141. If an estimated position is not available for the access point 141, the learning module 193 proceeds to 408 and initializes database 194 with an initial estimate of the location of access point 141. In one embodiment, this initial estimate is assumed to be the sample mean of all positional estimates derived from ranges 151-153 (as well as the corresponding GPS position data), and the confidence interval associated with that initial estimate is assumed to be a variance derived from the signal-to-noise ration of the measurements. Subsequently, processing continues with 402 after some predetermined interval (e.g., 1.0 to 60.0 minutes).
If, at 406, it was determined that an estimated position (i.e., a prior positional estimate) is available within database 194, the learning module 193 proceeds to 410. At 410, the learning module 193 combines the aggregated range and GPS information received from mobile platforms 161-163 with the prior estimate (as described in further detail below with reference to FIG. 4), and produces, at 412, a “new” estimate of the position of mobile platform 161, which is then stored, along with statistical information related to the estimate, within database 194. Subsequently, processing continues with 402 after some predetermined interval (e.g., approximately 1.0 to 60.0 minutes).
An exemplary position learning method will now be described in detail. In general, the task of the learning module 193 is to take the prior estimated position of mobile platform 161 as stored within database 194, which is given as {tilde over (p)}=({tilde over (X)}, {tilde over (Y)}, {tilde over (Z)},) (corresponding to predicted x, y, and z coordinates within environment 110) and determine a new or “posterior” estimate p=(X, Y, Z). The estimated positions of mobile platforms 161-163 are thus expressed as (p1, p2, . . . , pN), with some uncertainty captured in the covariance matrices (Σ1, Σ2, . . . , ΣN). The corresponding range measurements between the mobile platform and the access point are (ρ1, ρ2, . . . , ρN) (e.g., range measurements 151-153) and signal-noise ratio (s1, s2, . . . , sN), for k=1, . . . , N. For the k-th mobile platform, the position distribution can be written as information array pk ̃[Rk, zk], for k=1, . . . , N.
The uncertainty of the range measurements (e.g., 151-153) depends on the signal-noise ratio. For an exemplary embodiment, the variance of the range measurement ρk from the k-th mobile platform is denoted as σk and can be calculated as




  
    σ
    k
  
  =
  
    
      c
      ⁢
      
        
      
      ⁢
      τ
    
    
      2.5
      ⁢
      
        
          2
          ⁢
          
            s
            k
          
        
      
    
  




where sk the signal-noise ratio for time-of-flight measurement ρk, c is the speed of light, and τ is the width of pulse in time-of-flight measure mechanism.

In order to find out the initial position p for access point 141 such that the following quantity is minimized:




  
    ∑
    
      k
      =
      1
    
    N
  
  ⁢
  
    [
    
      
        
          (
          
            
              
                
                
                  p
                  -
                  
                    p
                    k
                  
                
                
              
              -
              
                ρ
                k
              
            
            
              σ
              k
            
          
          )
        
        2
      
      +
      
        
          
          
            
              
                R
                k
              
              ⁢
              
                p
                k
              
            
            -
            
              z
              k
            
          
          
        
        2
      
    
    ]
  




Given the nomenclature set forth above, the predicted range measurement is {tilde over (ρ)}k=√{square root over (({tilde over (X)}−Xk)2+({tilde over (Y)}−Yk)2+({tilde over (Z)}−Zk)2)} between the access point 141 and k-th mobile platform pk=(Xk, Yk, Zk)T. Error is defined between predicted and actual range measurement as Δρk=ρk−{tilde over (ρ)}k and a set of 1×3 sensitive matrices Hw,k={tilde over (p)}T/(σk{tilde over (ρ)}k) and Hk=−(1 1 1)/(σk{tilde over (ρ)}k). These sensitive matrices are gain factors that determine the amount needed for a change of position for access point 141 in order to reduce the error. The normalized measurement from k-th platform is ok=(Δρk+Hw,k{tilde over (p)})/σk; for k=1, 2, . . . , N. The following matrix A can be constructed:




  A
  =
  
    (
    
      
        
          
            R
            1
          
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
        
          
            z
            1
          
        
      
      
        
          0
        
        
          
            R
            2
          
        
        
          ...
        
        
          0
        
        
          0
        
        
          
            z
            2
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          
            R
            N
          
        
        
          0
        
        
          
            z
            N
          
        
      
      
        
          
            H
            1
          
        
        
          0
        
        
          ...
        
        
          0
        
        
          
            H
            
              w
              ,
              1
            
          
        
        
          
            o
            1
          
        
      
      
        
          0
        
        
          
            H
            2
          
        
        
          ...
        
        
          0
        
        
          
            H
            
              w
              ,
              2
            
          
        
        
          
            o
            2
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          
            H
            N
          
        
        
          
            H
            
              w
              ,
              N
            
          
        
        
          
            o
            N
          
        
      
    
    )
  




At this point, applying a “Givens rotation” as is known in the art (e.g., a rotation in the plane spanned by two rows of the matrix A) to the lower rectangular entries defined by H1 to oN, a triangular matrix RA is formed as:




  
    R
    A
  
  =
  
    (
    
      
        
          
            R
            1
            ′
          
        
        
          0
        
        
          ...
        
        
          0
        
        
          α
        
        
          
            z
            1
            ′
          
        
      
      
        
          0
        
        
          
            R
            2
            ′
          
        
        
          ...
        
        
          0
        
        
          β
        
        
          
            z
            2
            ′
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          
            R
            N
            ′
          
        
        
          γ
        
        
          
            z
            N
            ′
          
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          R
        
        
          z
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
        
          e
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
        
          0
        
      
    
    )
  




Note that RA is an upper triangular matrix derived from A, i.e., A=QRA and Q is an orthogonal matrix of appropriate dimension.
The updated position of access point 141 has a statistical distribution [R, z] where R is the 3×3 submatrix from RA (at row N+1 and column N+1), and z the 3×1 submatrix from RA (at row N+1 and column N+2). The posterior position expectation (mean) is p=R−1z, and the scalar e is the least-squares residue. Next, let {tilde over (p)}=p (e.g., set the “prior” estimate to the new, improved estimate). Reconstructing the matrix A above and applying triangulation process, the updated position of access point 141 can be computed in L iterations (e.g., L=5), or until it converges. Measurements in the most recent time window can now be discarded (since the parameters [R, z] are a sufficient statistic) if these measurements are not needed by other access points for positioning.
After initialization (e.g., block 408 in FIG. 4), during subsequent learning, the learning module 193 takes as its input range measurements, i.e., ρ1, ρ2, . . . , ρN, the corresponding mobile platform position distribution in information array form, i.e., p1 ̃[R1, z1], p2 ̃[R2, z2], . . . , pN ̃[RN, zN], the predicted access point 141 position {tilde over (p)}=({tilde over (X)}, {tilde over (Y)}, {tilde over (Z)})T, and the prior distribution of the access point 141 p ̃[{tilde over (R)}, {tilde over (z)}]. The output is then posterior distribution for the position of access point 141, p ̃[R,z], and its updated position p=R−1z.
The refinement function 306 in FIG. 3 is adapted to determine the posterior position p such that the following quantity is minimized:




  
    
      ∑
      
        k
        =
        1
      
      N
    
    ⁢
    
      [
      
        
          
            (
            
              
                
                  
                  
                    p
                    -
                    
                      p
                      k
                    
                  
                  
                
                -
                
                  ρ
                  k
                
              
              
                σ
                k
              
            
            )
          
          2
        
        +
        
          
            
            
              
                
                  R
                  k
                
                ⁢
                
                  p
                  k
                
              
              -
              
                z
                k
              
            
            
          
          2
        
      
      ]
    
  
  +
  
    
    
      
        
          R
          ~
        
        ⁢
        p
      
      -
      
        z
        ~
      
    
    
  




With arrival of a new packet of measurements from mobile platforms 161-163 (e.g., 402 in FIG. 4), let {tilde over (ρ)}k=√{square root over ({tilde over (X)}−Xk)2+({tilde over (Y)}−Yk)2+({tilde over (Z)}−Zk)2)}; pk=(Xk, Yk, Zk)T; Δρk=ρk−{tilde over (ρ)}k; 1×3 matrices Hw,k={tilde over (p)}T/(σk{tilde over (ρ)}k), Hk=−(1 1 1)/(σk{tilde over (ρ)}k); and ok=(Δρk+Hw,k{tilde over (p)})/σk. For k=1, 2, . . . , N. A new matrix A′ can be constructed as:




  
    A
    ′
  
  =
  
    (
    
      
        
          
            R
            1
          
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
        
          
            z
            1
          
        
      
      
        
          0
        
        
          
            R
            2
          
        
        
          ...
        
        
          0
        
        
          0
        
        
          
            z
            2
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          
            R
            N
          
        
        
          0
        
        
          
            z
            N
          
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          
            R
            ~
          
        
        
          
            z
            ~
          
        
      
      
        
          
            H
            1
          
        
        
          0
        
        
          ...
        
        
          0
        
        
          
            H
            
              w
              ,
              1
            
          
        
        
          
            o
            1
          
        
      
      
        
          0
        
        
          
            H
            2
          
        
        
          ...
        
        
          0
        
        
          
            H
            
              w
              ,
              2
            
          
        
        
          
            o
            2
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          
            H
            N
          
        
        
          
            H
            
              w
              ,
              N
            
          
        
        
          
            o
            N
          
        
      
    
    )
  




Next, a Givens rotation is applied as above to the entries ranging from H1 to oN, producing an upper triangular matrix as follows:




  
    
      R
      ′
    
    A
  
  =
  
    (
    
      
        
          
            R
            1
            ′
          
        
        
          0
        
        
          ...
        
        
          0
        
        
          α
        
        
          
            z
            1
            ′
          
        
      
      
        
          0
        
        
          
            R
            2
            ′
          
        
        
          ...
        
        
          0
        
        
          β
        
        
          
            z
            2
            ′
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          
            R
            N
            ′
          
        
        
          γ
        
        
          
            z
            N
            ′
          
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          R
        
        
          z
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
        
          e
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
        
          0
        
      
    
    )
  




The posterior position distribution for access point 141 is then p ̃[R, z], and the posterior position expectation (mean) for access point 141 is p=R−1z. The learning module 192 then discards the used measurements and treats the posterior position estimate as the prior position estimate (304 in FIG. 3) for the next update cycle.
It will be appreciated that while the embodiments described above have been described in the context of vehicular mobile platforms, the range of embodiments is not so limited. For example, the systems and methods described above can be used to determine the location of APs in a building using mobile devices carried by individuals as they travel through the building.
While at least one exemplary embodiment has been presented in the foregoing detailed description, it should be appreciated that a vast number of variations exist. It should also be appreciated that the exemplary embodiment or exemplary embodiments are only examples, and are not intended to limit the scope, applicability, or configuration of the disclosure in any way. Rather, the foregoing detailed description will provide those skilled in the art with a convenient road map for implementing the exemplary embodiment or exemplary embodiments. It should be understood that various changes can be made in the function and arrangement of elements without departing from the scope of the disclosure as set forth in the appended claims and the legal equivalents thereof.

## Claims

1. An access point position learning method, comprising:
acquiring first GPS position data associated with a first mobile platform;
acquiring a first wireless range measurement associated with the first mobile platform and a wireless access point in communication with the first mobile platform;
determining a first estimated position of the wireless access point based on the first GPS position data and the first wireless range measurement;
acquiring second GPS position data associated with a second mobile platform;
acquiring a second wireless range measurement associated with the second mobile platform and the wireless access point;
determining a second estimated position of the wireless access point based on the first estimated position, the second GPS position data, and the second wireless range measurement;
wherein acquiring the first wireless range measurement includes determining a distance from the first mobile platform to the wireless access point using WiFi time-of-flight measurement information provided by the wireless access point.

2. The access point position learning method of claim 1, further including storing, in a database remote from the first mobile platform, position data including a media access control (MAC) address of the wireless access point, the first estimated position of the wireless access point, and statistical data associated with the first estimated position.

3. The access point position learning method of claim 2, wherein the statistical data includes a count of a plurality of range measurements and a statistical distribution characterizing the range measurements.

4. The access point position learning method of claim 3, wherein the statistical distribution characterizing the range measurements is a Gaussian-distributed multivariate with a mean p and a covariance matrix Σ.

5. The access point position learning method of claim 1, wherein the first mobile platform is a vehicle.

6. The access point position learning method of claim 1, wherein the first mobile platform is a mobile computing device.

7. An access point position learning module comprising:
a processor;
a memory configured to store software instructions that, when executed by the processor, cause the processor to:
acquire first GPS position data associated with a first mobile platform;
acquire, using WiFi time-of-flight measurement information provided by the wireless access point, a first wireless range measurement associated with the first mobile platform and a wireless access point in communication with the first mobile platform;
determine a first estimated position of the wireless access point based on the first GPS position data and the first wireless range measurement;
acquire second GPS position data associated with a second mobile platform;
acquire a second wireless range measurement associated with the second mobile platform and the wireless access point; and
determine a second estimated position of the wireless access point based on the first estimated position, the second GPS position data, and the second wireless range measurement.

8. The access point position learning module of claim 7, wherein the processor is further configured to receive, from a database remote from the first mobile platform, position data including a media access control (MAC) address of the wireless access point, the first estimated position of the wireless access point, and statistical data associated with the first estimated position.

9. The access point position learning module of claim 8, wherein the statistical data includes a count of a plurality of range measurements and a statistical distribution characterizing the range measurements.

10. The access point position learning module of claim 9, wherein the statistical distribution characterizing the range measurements is a Gaussian-distributed multivariate with a mean p and a covariance matrix Σ.

11. The access point position learning module of claim 7, wherein at least one of the first mobile platform and the second mobile platform is a mobile computing device.

12. The access point position learning module of claim 7, wherein at least one of the first mobile platform and the second mobile platform is a vehicle.

13. A non-transitory computer-readable media including software instructions that, when executed by a processor, cause the processor to:
acquire first GPS position data associated with a first mobile platform;
acquire a first wireless range measurement associated with the first mobile platform and a wireless access point in communication with the first mobile platform by determining a distance from the first mobile platform to the wireless access point using WiFi time-of-flight measurement information provided by the wireless access point;
determine a first estimated position of the wireless access point based on the first GPS position data and the first wireless range measurement;
acquire second GPS position data associated with a second mobile platform;
acquire a second wireless range measurement associated with the second mobile platform and the wireless access point; and
determine a second estimated position of the wireless access point based on the first estimated position, the second GPS position data, and the second wireless range measurement.

14. The non-transitory computer-readable media of claim 13, wherein the software instructions cause the processor to receive, from a database remote from the first mobile platform, position data including a media access control (MAC) address of the wireless access point, the first estimated position of the wireless access point, and statistical data associated with the first estimated position.

15. The non-transitory computer-readable media of claim 14, wherein the statistical data includes a count of a plurality of range measurements and a statistical distribution characterizing the range measurements.

16. The non-transitory computer-readable media of claim 15, wherein the statistical distribution characterizing the range measurements is a Gaussian-distributed multivariate with a mean p and a covariance matrix Σ.

17. The non-transitory computer-readable media of claim 13, wherein the first mobile platform is selected from the group consisting of a vehicle and a mobile computing device.