PATENT DOCUMENT

Publication Number: US-8996302-B2
Application Number: US-201213691185-A
Country: US
Kind Code: B2

Title: Reduction of the impact of hard limit constraints in state space models

Abstract:
A location of a mobile device in a venue can be estimated by using a state space estimator to determine candidate locations of the mobile device at a first time point based on previous candidate positions conditioned upon an observation of one or more environmental variables. A second observation is received at a second time point, and the state space estimator performs a propagation step to determine the candidate locations at the second time point based on the candidate locations at the first time point and the second observation. The propagation step includes a plurality of sub-propagation steps in which a time length between the sub-propagation steps is a fraction of the time length between the first and second time points, and at each sub-propagation step each candidate location is propagated according to a stochastic process. The location of the mobile device at the second time point is determined based on the candidate locations at the second time point.

Claims:
What is claimed is: 
     
       1. A computer-implemented method, comprising:
 determining a location of a mobile device in a venue comprising a space accessible by a movable body carrying the mobile device and one or more constraints of movement of the movable body, including
 determining, using a state space estimator, candidate locations of the mobile device at a first time point based on candidate positions determined at a previous time point conditioned upon an observation of one or more environmental variables provided at the first time point, 
 receiving a second observation of the one or more environment variables at a second time point, 
 using the state space estimator to perform a propagation step to determine the candidate locations of the mobile device at the second time point,
 wherein the propagation step comprises a plurality of sub-propagation steps in which a time length between the sub-propagation steps is a fraction of the time length between the first and second time points, the first of the sub-propagation steps causing propagation of the candidate locations at the first time point, 
 wherein the propagation of each candidate location at each sub-propagation step is guided by a general direction of movement of the mobile device, and 
 wherein at each sub-propagation step each candidate location is propagated according to a stochastic process without causing a conflict between the candidate locations of successive sub-propagation steps and the one or more constraints of movement, and 
 
 determining the location of the mobile device at the second time point based on the candidate locations at the second time point and the second observation of the one or more environmental variables. 
 
 
     
     
       2. The method of  claim 1 , in which when performing each sub-propagation step, upon detecting a conflict between the candidate locations and the one or more constraints of movement,
 performing the previous sub-propagation steps again and increasing a randomness in at least one of a heading or a velocity of the propagation of each candidate location at each sub-propagation step to explore alternative movements of the mobile device, and 
 identifying candidate locations that do not conflict with the one or more constraints of movement. 
 
     
     
       3. The method of  claim 2  in which a conflict between the candidate locations and the one or more constraints of movement occurs when the state space estimator attempts to propagate a candidate location associated with a sub-propagation step to another candidate location associated with a successive sub-propagation step and a constraint of movement is between the candidate location and the other candidate location. 
     
     
       4. The method of  claim 1  in which when performing the propagation step, upon detecting a conflict between the candidate locations and the one or more constraints of movement, performing the sub-propagation steps again and further reducing the time length between the sub-propagation steps and increasing the number of sub-propagation steps between the first and second time points. 
     
     
       5. The method of  claim 1  in which the constraints of movement of the mobile device comprise walls or obstacles in the venue that may constrain movements of a pedestrian carrying the mobile device. 
     
     
       6. The method of  claim 1  in which the time length between sub-propagation steps is equal to or less than one-tenth the time duration between updated observations. 
     
     
       7. A computer-implemented method, comprising:
 receiving observations of one or more environment variables, in which the observations are updated at a first time interval; 
 propagating, using a state space estimator, candidate locations of a mobile device at a second time interval that is smaller than the first time interval such that the first interval includes a plurality of the second time intervals,
 wherein the state space estimator takes into account map data when propagating the candidate locations, 
 wherein the map data represents a venue comprising a space accessible by a movable body carrying the mobile device and one or more constraints of movement of the movable body, and 
 wherein the propagating is performed according to a stochastic process and further is constrained by the one or more constraints of movement such that each pair of successive candidate locations is compatible with the one or more constraints of movement, and 
 
 when an updated observation is available, updating the candidate locations based on the updated observation; and 
 determining a location of the mobile device based on the candidate locations. 
 
     
     
       8. The method of  claim 7  wherein a pair of successive candidate locations is incompatible with the one or more constraints of movement when the state space estimator attempts to propagate, over the second time interval, a candidate location to another candidate location and a constraint of movement is between the candidate location and the other candidate location. 
     
     
       9. The method of  claim 7 , comprising increasing a noise level of the stochastic process upon detecting that propagating the candidate positions is incompatible with the constraints of movement, in which increasing the noise level increases a randomness in at least one of a heading or a velocity of the propagation of each candidate location. 
     
     
       10. The method of  claim 9  in which propagating the candidate positions is incompatible with the constraints of movement when the state space estimator attempts to propagate a candidate location from a first position to a second position according to the stochastic process and a constraint of movement is between the first and second positions. 
     
     
       11. The method of  claim 7 , comprising reducing the second time interval of the propagation steps upon detecting that propagating the candidate positions is incompatible with the constraints of movement, and increasing the number of propagation steps between available observation updates. 
     
     
       12. The method of  claim 7  in which the constraints of movement comprise walls or obstacles in the venue that may constrain movements of a pedestrian carrying the mobile device. 
     
     
       13. The method of  claim 7  in which the propagation of each candidate location at each propagation step is guided by a general direction of movement of the mobile device based on a stochastic propagation model. 
     
     
       14. The method of  claim 7  in which the second time interval is equal to or less than one-tenth the first time interval. 
     
     
       15. A mobile device comprising:
 a storage configured to store map data associated with a venue comprising a space accessible by a movable body and one or more constraints of movement of the movable body; and 
 a processor configured to
 implement a state space estimator to determine candidate locations of the mobile device at a first time point based on candidate positions determined at a previous time point conditioned upon an observation of one or more environmental variables provided at the first time point, 
 receive a second observation of the one or more environment variables at a second time point, 
 use the state space estimator to perform a propagation step, taking into account of the map data, to determine the candidate locations of the mobile device at the second time point,
 wherein the propagation step comprises a plurality of sub-propagation steps in which a time length between the sub-propagation steps is less than half the time length between the first and second time points, the first of the sub-propagation steps causing propagation of the candidate locations at the first time point, 
 wherein the propagation of each candidate location at each sub-propagation step is guided by a general direction of movement of the mobile device, and 
 wherein at each sub-propagation step each candidate location is propagated according to a stochastic process without causing a conflict between the candidate locations of successive sub-propagation steps and the one or more constraints of movement, and 
 
 determine the location of the mobile device at the second time point based on the candidate locations at the second time point and the second observation of the one or more environmental variables. 
 
 
     
     
       16. The mobile device of  claim 15  in which when performing each sub-propagation step, upon detecting a conflict between the candidate locations and the one or more constraints of movement, the processor is configured to
 perform the previous sub-propagation steps again and increase a randomness in at least one of a heading or a velocity of the propagation of each candidate location at each sub-propagation step to explore alternative movements of the mobile device, and 
 identify candidate locations that do not conflict with the one or more constraints of movement. 
 
     
     
       17. The mobile device of  claim 16  in which a conflict between the candidate locations and the one or more constraints of movement occurs when the state space estimator attempts to propagate a candidate location associated with a sub-propagation step to another candidate location associated with a successive sub-propagation step and a constraint of movement is between the candidate location and the other candidate location. 
     
     
       18. The mobile device of  claim 15  in which when performing the propagation step, upon detecting a conflict between the candidate locations and the one or more constraints of movement, the processor is configured to perform the sub-propagation steps again and further reduce the time length between the sub-propagation steps and increase the number of sub-propagation steps between the first and second time points. 
     
     
       19. The mobile device of  claim 15  in which the constraints of movement of the mobile device comprise walls or obstacles in the venue that may constrain movements of a pedestrian carrying the mobile device. 
     
     
       20. The mobile device of  claim 15  in which the time length between sub-propagation steps is equal to or less than one-fifth the time duration between updated observations. 
     
     
       21. A mobile device comprising:
 one or more sensors to generate observations of one or more environment variables; 
 a storage configured to store map data associated with a venue comprising a space accessible by a movable body and one or more constraints of movement of the movable body; and 
 a processor configured to
 receive observations of the one or more environment variables from the one or more sensors, in which the observations are updated at a first time interval; 
 propagate, using a state space estimator, candidate locations of a mobile device at a second time interval that is smaller than the first time interval such that the first interval includes a plurality of the second time intervals, wherein the propagation is performed according to a stochastic process and further is constrained by the one or more constraints of movement such that each pair of successive candidate locations is compatible with the one or more constraints of movement, and 
 when an updated observation is available, update the candidate locations based on the updated observation; and 
 determine a location of the mobile device based on the candidate locations. 
 
 
     
     
       22. The mobile device of  claim 21  wherein the processor is configured to increase a noise level of the stochastic process upon detecting that propagating the candidate positions is incompatible with the constraints of movement, in which increasing the noise level increases a randomness in at least one of a heading or a velocity of the propagation of each candidate location. 
     
     
       23. An apparatus comprising:
 a computer storage medium storing instructions that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising:
 receiving observations of one or more environment variables, in which the observations are updated at a first time interval; 
 propagating, using a state space estimator, candidate locations of a mobile device at a second time interval that is smaller than the first time interval such that the first interval includes a plurality of the second time intervals,
 wherein the state space estimator takes into account map data when propagating the candidate locations, 
 wherein the map data represents a venue comprising a space accessible by a movable body carrying the mobile device and one or more constraints of movement of the movable body, and 
 wherein the propagation is performed according to a stochastic process and further is constrained by the one or more constraints of movement such that each pair of successive candidate locations is compatible with the one or more constraints of movement, and 
 
 when an updated observation is available, updating the candidate locations based on the updated observation; and 
 determining a location of the mobile device based on the candidate locations. 
 
 
     
     
       24. The apparatus of  claim 23 , wherein the operations further comprise increasing a noise level of the stochastic process upon detecting that propagating the candidate positions is incompatible with the constraints of movement, in which increasing the noise level increases a randomness in at least one of a heading or a velocity of the propagation of each candidate location. 
     
     
       25. The apparatus of  claim 23 , wherein the operations further comprise
 reducing the second time interval upon detecting that propagating the candidate positions is incompatible with the constraints of movement, and 
 increasing a number of propagations of candidate positions between available observation updates. 
 
     
     
       26. The mobile device of  claim 21 , wherein the processor is further configured to
 reduce the second time interval upon detecting that propagating the candidate positions is incompatible with the constraints of movement, and 
 increase a number of propagations of candidate positions between available observation updates. 
 
     
     
       27. The mobile device of  claim 21 , wherein a pair of successive candidate locations is incompatible with the one or more constraints of movement when the state space estimator attempts to propagate, over the second time interval, a candidate location to another candidate location and a constraint of movement is between the candidate location and the other candidate location. 
     
     
       28. The apparatus of  claim 23 , wherein a pair of successive candidate locations is incompatible with the one or more constraints of movement when the state space estimator attempts to propagate, over the second time interval, a candidate location to another candidate location and a constraint of movement is between the candidate location and the other candidate location.

Description:
TECHNICAL FIELD 
     This disclosure relates generally to location determination. 
     BACKGROUND 
     Some mobile devices have features to determine a geographic location. For example, a mobile device can include a receiver for receiving signals from a global positioning system (GPS). The mobile device can determine a geographic location, including latitude and longitude, using the GPS signals. In many places, GPS signals can be non-existent, weak, or subject to interference such that it is not possible to determine a location using the GPS receiver on a mobile device. For example, a conventional mobile device often fails to determine a location based on GPS signals when the device is inside a building or tunnel. 
     SUMMARY 
     Methods, program products, and systems for estimating a location of a mobile device with reduced impact of hard limit constraints in state space models are described. Each iteration of the state space model includes an observation (or measurement) step and a propagation step. The propagation step includes multiple propagation sub-steps to explore possible routes that may avoid hard limit constraints, such as walls in a venue. 
     In one aspect, a method for determining a location of a mobile device in a venue is provided. The venue includes a space accessible by a movable body carrying the mobile device and one or more constraints of movement of the movable body. A state space estimator determines candidate locations of the mobile device at a first time point based on candidate positions determined at a previous time point conditioned upon an observation of one or more environmental variables provided at the first time point. A second observation of the one or more environment variables is received at a second time point, and the state space estimator performs a propagation step to determine the candidate locations of the mobile device at the second time point based on the candidate locations at the first time point and the second observation of the one or more environmental variables. The propagation step includes a plurality of sub-propagation steps in which a time length between the sub-propagation steps is a fraction of the time length between the first and second time points, and at each sub-propagation step each candidate location is propagated according to a stochastic process. The location of the mobile device at the second time point is determined based on the candidate locations at the second time point. 
     In one aspect, a method for determining a location of mobile device includes receiving observations of one or more environment variables, in which the observations are updated at a first time interval; propagating, using a state space estimator, candidate locations of a mobile device at a second time interval that is smaller than the first time interval, the propagation being performed according to a stochastic process, and when an updated observation is available, updating the candidate locations based on the updated observation; and determining a location of the mobile device based on the candidate locations. 
     In one aspect, a mobile device includes a storage configured to store map data associated with a venue comprising a space accessible by a movable body and one or more constraints of movement of the movable body; and a processor configured to implement a state space estimator to determine candidate locations of the mobile device at a first time point based on candidate positions determined at a previous time point conditioned upon an observation of one or more environmental variables provided at the first time point. The processor is configured to receive a second observation of the one or more environment variables at a second time point, and use the state space estimator to perform a propagation step, taking into account of the map data, to determine the candidate locations of the mobile device at the second time point based on the candidate locations at the first time point and the second observation of the one or more environmental variables. The propagation step includes a plurality of sub-propagation steps in which a time length between the sub-propagation steps is less than half the time length between the first and second time points, and at each sub-propagation step each candidate location is propagated according to a stochastic process. The processor is configured to determine the location of the mobile device at the second time point based on the candidate locations at the second time point. 
     In one aspect, a mobile device includes one or more sensors to generate observations of one or more environment variables; a storage configured to store map data associated with a venue comprising a space accessible by a movable body and one or more constraints of movement of the movable body; and a processor configured to receive observations of the one or more environment variables from the one or more sensors, in which the observations are updated at a first time interval. The processor is configured to propagate, using a state space estimator, candidate locations of a mobile device at a second time interval that is smaller than the first time interval, the propagation being performed according to a stochastic process, taking into account of the map data, and when an updated observation is available, update the candidate locations based on the updated observation. The processor is configured to determine a location of the mobile device based on the candidate locations. 
     In some examples, reducing the impact of hard limit constraints in state space models may achieve one or more of the following advantages. A mobile device can determine a location more accurately when navigating in an area having constraints to movements. When using a state space model to propagate candidate locations, the likelihood that candidate locations are stuck in dead end situations is reduced. More accurate location estimates can be obtained in complicated venues. 
     The details of one or more implementations of location determination using a state space model with reduced impact of hard limit constraints are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of location determination using a state space model with reduced impact of hard limit constraints will become apparent from the description, the drawings, and the claims. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  is a diagram showing propagation of candidate locations in a venue having hard limit constraints. 
         FIGS. 2A to 2G  are diagrams showing propagation and re-propagation of candidate locations. 
         FIGS. 3A to 3D  are diagrams showing propagation and re-propagation of candidate locations. 
         FIG. 4  is a block diagram providing an overview of location determination with reduced impact of hard limit constraints on state space models. 
         FIG. 5  illustrates exemplary survey techniques for generating location fingerprint data. 
         FIG. 6  is a block diagram of an exemplary fingerprint engine for generating location fingerprint data. 
         FIG. 7  illustrates an exemplary feature vector in location fingerprint data. 
         FIG. 8  illustrates an exemplary logical structure of a location fingerprint database. 
         FIG. 9  illustrates exemplary techniques of estimating a current location using statistical classification. 
         FIG. 10  is a flowchart of an exemplary procedure of generating a location observation using kernel estimation. 
         FIG. 11  is a block diagram illustrating an exemplary mobile device estimating a current location using a particle filter. 
         FIG. 12  illustrates exemplary applications of constraints to a particle filter. 
         FIGS. 13A-13C  illustrate exemplary techniques of configuring a particle filter using readings from sensors of a mobile device. 
         FIG. 14  is a flowchart of an exemplary procedure of generating location fingerprint data. 
         FIG. 15  is a flowchart of an exemplary procedure of estimating a location using location fingerprint data. 
         FIG. 16  is a flowchart of an exemplary procedure of estimating a location using a particle filter. 
         FIG. 17  is a flowchart of an exemplary procedure of determining a location of a mobile device in a venue in which the impact of hard limit constraints is reduced. 
         FIG. 18  is a flowchart of an exemplary procedure for reducing the impact of hard limit constraints when estimating a location of a mobile device in a venue. 
         FIG. 19  is an exemplary user interface for displaying a location of a mobile device at a venue. 
         FIG. 20  is a block diagram of an exemplary system architecture for implementing the features and operations of  FIGS. 2A-19 . 
         FIG. 21  is a block diagram illustrating an exemplary device architecture of a mobile device implementing the features and operations described in reference to  FIGS. 2A-19 . 
         FIG. 22  is a block diagram of an exemplary network operating environment for the mobile devices of  FIGS. 4-19 . 
     
    
    
     Like reference symbols in the various drawings indicate like elements. 
     DETAILED DESCRIPTION 
     Reducing Hard Limit Constraints 
     A venue such as an office building, a shopping mall, or an airport often has structures or obstacles, e.g., walls or fountains that limit the movements of pedestrians. A mobile device can use a state space model to determine its location in the venue, which involves iteratively propagating candidate locations, performing measurement updates, assigning weights to the candidate locations based on the measurement updates, determining its current location based on the weighted candidate locations, and re-sampling candidate locations based on the weights. The weighted candidate locations represent a probability distribution of likely locations of the mobile device. 
     The system equations for determining the propagation step may be bound by constraints imposed by the structures or obstacles. For example, a state space estimator cannot propagate candidate locations through walls. While information on the constraints may improve the accuracy of location estimates, there is a risk that a non-recoverable error may occur due to the imposed constraints. For example, when a pedestrian is walking in a hallway, due to an estimator error condition, the state space estimator may propagate candidate locations in a way that the candidate locations converge in an office adjacent to the hallway. While the pedestrian keeps on walking in the hallway, the hard limit constraint imposed by the walls of the office will bound the estimation space to be the office. When a new measurement becomes available, the candidate locations in the office are assigned low weights, resulting in particle depletion. To avoid particle depletion, the propagation step is divided into several sub-propagation steps to explore potential routing paths for the candidate locations that may navigate around the constraints. 
     In this description, the mobile device uses a particle filter to estimate the candidate locations. State space estimator designates the candidate locations as samples (or “particles”) for propagation in the particle filter, in which the candidate locations at time k (representing current locations of the mobile device at time k) are determined based on the candidate locations at time k−1 (representing previous locations of the mobile device at time k−1), taking into account measurement data from sensors, such as data indicating the heading and velocity of the mobile device. Other filters can also be used. 
     Referring to  FIG. 1 , an exemplary venue  10  has walls  12  that define hallway  14  that bends around a corner of office  24 . A pedestrian walking in the venue carries a mobile device that can determine its location based on, e.g., location fingerprint data. The mobile device includes a location estimator that uses a state space model, such as a particle filter that samples candidate locations of the mobile device. The location estimator periodically receives readings from one or more sensor of the mobile device that measure one or more environment variables. The sensor readings, also referred to as observations of the one or more environment variables, are compared with a location fingerprint database to determine the probability that the mobile device is at each of the candidate locations. The location fingerprint database includes observations of environment variables, such as WiFi and cell phone signal strengths, at various locations in the venue. The closer the match between the sensor readings and observation data in the fingerprint database associated with a particular location, the higher the likelihood that the mobile device is at the particular location. 
     Based on a comparison between the sensor readings and observation data in the fingerprint database associated with each of the candidate locations, a weight value is assigned to each of the candidate locations. A higher weight value indicates a higher likelihood that the mobile device is at the candidate location. If the weight value for a candidate location is lower than a threshold, the candidate location is removed from further consideration. A re-sampling process is performed to determine a distribution of candidate locations. The candidate locations are propagated according to a motion model, taking into account sensor readings that indicate travel direction and velocity, and map data that show constraints of movements, such as walls  12 . When the next observation update becomes available, the candidate locations are weighted and re-sampled, and the process is repeated. 
     In the example of  FIG. 1 , the observations of the environment variables are updated every Δt seconds. At time t0, the pedestrian is at location  26 . The pedestrian walks along path  28 , and at time t1=t0+Δt, the pedestrian walks to location  16 . The pedestrian walks along path  18 , and after Δt seconds, at time t2=t1+Δt, the pedestrian walks to location  20 . Assume that the state space estimator determines candidate locations  16 ′ for the mobile device at time t1. The state space estimator, based on a motion model and map data, determines candidate locations  20 ′ at time t2. Candidate locations  20 ′ are assigned weight values based on the observations obtained at time t2. The candidate locations are re-sampled. At time t3=t1+2Δt, the pedestrian walks to location  22 . The state space estimator, based on a motion model and map data showing constraints imposed by walls  12 , determines that the candidate locations remain in office  24  at time t3. Observations of the environment variables obtained at time t3 indicate that the mobile device is outside of office  24 . There is a low matching between the observations at time t3 and the observation data in the fingerprint database associated with the candidate locations inside office  24 , so the candidate locations in office  24  are assigned low weight values, resulting in particle depletion. 
     To reduce the impact of hard limits constraints in the state space model, the propagation step of a state space estimator can be divided into sub-propagation steps, and a discretized Wiener process can be used to explore potential work-around routes. For example, each propagation step can be divided into 10 or more sub-propagation steps. Each sub-propagation step simulates a possible propagation of the mobile device within a time period that is smaller than the time period between observation updates. This allows the state space estimator to explore potential piecewise linear propagation routes between observation updates. 
     Referring to  FIG. 2A , in one example, observation updates are available to the mobile device at intervals of Δt. A pedestrian is at location  16  at time t1, walks along path  18 , and arrives at location  20  at time t2=t1+Δt. In this example, a propagation step is divided into 5 sub-propagation steps. Δt time t1, a state space estimator determines candidate locations  16 ′. Based on a motion model, the state space estimator determines the propagation of candidate locations  16 ′ as represented by arrows  38 . 
     Referring to  FIG. 2B , at time t1+Δt/5, based on the propagations represented by arrows  38 , the state space estimator determines candidate locations  30 . Based on the motion model, the state space estimator determines the propagation of candidate locations  30  as represented by arrows  32 . 
     Referring to  FIG. 2C , at time t1+2*Δt/5, based on the propagations represented by arrows  32 , the state space estimator determines candidate locations  34 . Based on the motion model, the state space estimator determines the propagation of candidate locations  34  as represented by arrows  36 . 
     Referring to  FIG. 2D , at time t1+3*Δt/5, based on the propagations represented by arrows  36 , the state space estimator determines candidate locations  40 . Based on the motion model, the state space estimator determines the propagation of candidate locations  40  as represented by arrows  42 . 
     Referring to  FIG. 2E , at time a+4*Δt/5, based on the propagations represented by arrows  42 , the state space estimator determines candidate locations  44 . Based on the motion model, the state space estimator determines the propagation of candidate locations  44  as represented by arrows  46 . 
     Referring to  FIG. 2F , at time t2=t1+Δt, based on the propagations represented by arrows  46 , the state space estimator determines candidate locations  48 . At time t2, a new observation update becomes available. The state space estimator assigns weights to candidate locations  48 , and re-samples the candidate locations. Note that the propagation of candidate locations shown in  FIGS. 2A to 2F  is merely an example, the candidate locations can propagate according to other routes. 
     In this example, after re-sampling, there are two candidate locations in hallway  14 , and two candidate locations in office  24 . Referring to  FIG. 2G , in the next iteration of the propagation step, five sub-propagation steps are performed at time t2, t2+Δt/5, t2+2*Δt/5, t2+3*Δt/5, and t2+4*Δt/5. At time t3=t2+Δt, the candidate locations outside of room  24  propagate to candidate locations  50 , while the candidate locations inside of room  24  remain in room  24 . At time t3, a new observation update becomes available. Comparing the new observation with the observation data in the location fingerprint database associated with candidate locations  50 , the match is high, and high weight values are assigned to candidate locations  50 . Comparing the new observation with the observation data in the location fingerprint database associated with candidate locations  52  in room  24 , the match is low, and low weight values are assigned to candidate locations  52 , resulting in removal of candidate locations  52 . The state space model re-samples candidate locations  50  to generate additional candidate locations to replace the removed candidate locations  52 . 
     The example of  FIGS. 2A to 2G  shows that dividing the time period between observation updates into sub-periods, and perform a sub-propagation step in each sub-period allows the state space model to explore piecewise-linear travel routes that may travel around walls or other constraints to movements. This reduces the impact of the hard limit constraints on the state space model. 
     In some implementations, a recovery mode is provided such that if the state space estimator determines that particle depletion has occurred due to hard limit constraints of movements, or that some candidate locations are blocked by the constraints, the state space estimator will increase the noise level in the motion model and try to propagate the candidate positions again. The increased noise level results in an increase in the randomness of the heading (or travel direction) and velocity of the candidate locations to allow exploration of a wider range of potential routes of the mobile device. 
     Referring to  FIG. 3A , in one example, a pedestrian is at location  54  at time t1, at location  56  at time t2=t1+Δt, and at location  58  at time t3=t2+Δt. At time t2, assume that the state space estimator determines candidate locations  60 . Based on the movement from location  54  to location  56 , the state space estimator determines that each candidate location  60  can have a range of propagation directions  62 . 
     Referring to  FIG. 3B , five sub-propagation steps are performed at time t2, t2+Δt/5, t2+2*Δt/5, t2+3*Δt/5, and t2+4*Δt/5, respectively. The candidate locations propagate toward walls  12  of room  24  and are blocked by walls  12 . 
     At time t3, an observation update becomes available. Comparisons of the observation update with observation values in the location fingerprint database corresponding to the candidate locations indicate low matches, so low weight values are assigned to the candidate locations, resulting in particle depletion. 
     Referring to  FIG. 3C , the state space estimator tries to propagate the particles again, starting from candidate locations  60 , with increased randomness in the heading and velocity of movements. In this iteration, the candidate locations  60  can have wider ranges of propagation directions  64  and wider ranges of velocities. Note that increasing the range of velocity means that the velocity can be higher or lower than a calculated value by a greater amount. For example, suppose an observation at t2 indicates that the mobile device is traveling at speed v. In the example of  FIG. 3B , each of the candidate locations  60  can propagate at a speed v±Δv, and in the example of  FIG. 3D  below, each of the candidate locations  60  can propagate at a speed v±2*Δv. 
     Referring to  FIG. 3D , in this second try to propagate the candidate locations, five sub-propagation steps are performed at times t2, t2+Δt/5, t2+2*Δt/5, t2+3*Δt/5, and t2+4*Δt/5, respectively. Two candidate locations  66  propagate toward walls  12  of room  24  and are blocked by walls  12 . Two candidate locations  68  propagate along routes in the hallway and traveled around walls  12  of room  24 . 
     At time t3, an observation update becomes available. Comparisons of the observation update with observation values in the location fingerprint database corresponding to the candidate locations  66  indicate low matches, so low weight values are assigned to candidate locations  66 , resulting in removal of candidate locations  66 . Comparisons of the observation update with observation values in the location fingerprint database corresponding to candidate locations  68  indicate high matches, so high weight values are assigned to candidate locations  68 . In the next iteration, the candidate locations are re-sampled and propagated. 
     In the example of  FIGS. 3A to 3D , when particle depletion occurs at time t3, the state space estimator retraces the candidate locations to time t2, and re-propagates the candidate locations starting from time t2 with an increased noise level to identify alternative routes that may go around the constraints of movements. In some implementations, if after a preset number of tries of propagation starting from time t2, alternative propagation routes that do not result in particle depletion cannot be found, the state space estimator retraces the candidate locations to time t1, and re-propagates the candidate locations starting from time a with an increased noise level. If re-propagating the candidate locations starting from time t1 does not prevent particle depletion at time t3, the state space estimator can re-propagate the candidate locations starting from time t0, and so forth. If after re-propagating the candidate locations starting from a preset maximum period of time prior to t3 still does not prevent particle depletion, the state space estimator ends the re-propagation process and performs a parallel re-sampling of a portion of the venue or the entire venue to recover from filter divergence. 
     In the examples of  FIGS. 2A to 2G  and  3 A to  3 D, the time period between observation updates is divided into sub-periods, and a sub-propagation step is performed at each of the sub-periods. At each sub-propagation step, each candidate location is propagated according to a stochastic process. This reduces the impact of hard limit constraints, such as walls  12 , on the state space modeling. The state space estimator still takes into account the hard limit constraints when propagating the candidate locations. However, the sub-propagation steps allow exploration of possible piecewise linear routes that can travel around the constraints. 
     After the state space estimator identifies the candidate locations that avoid particle depletion, the noise level in the state space model is reduced to the default value. The range of heading and velocity for the propagation of the candidate locations are set to the default values. The noise level remains at the default value until there is a need to re-propagate the candidate locations. The state space estimator then increases the noise level and tries to re-propagate the candidate locations, using the process described above. 
     Re-propagation of the candidate locations can be performed when one or more candidate locations cannot propagate further due to constraints of movements and are assigned low weight values after an observation update. The candidate locations that are blocked by the constraints of movements are re-propagated. For example, if the state space estimator propagates several candidate locations in a venue, a first portion of candidate locations can propagate without being blocked by walls, and a second portion of the candidate locations are blocked by walls and assigned low weight values, then the second portion of the candidate locations are re-propagated to determine whether there are propagation routes that can go around the constraints. 
     If during a first attempt of re-propagation of the second portion of the candidate locations, a third portion of the candidate locations can propagate without being blocked by the walls, and a fourth portion of the candidate locations are still blocked by walls and assigned low weight values, then the fourth portion of the candidate locations are re-propagated for a second time, and so forth. 
     In some implementations, when the state space estimator re-propagates the candidate locations, the randomness of heading and velocity is gradually increased. For example, with each successive re-try, the range of heading and velocity can be increased by a certain percentage, such as 10%. The amount of increase in the range of heading does not necessarily have to be the same as the amount of increase in the range of velocity. If the state space estimator tries to re-propagate the candidate locations for a preset number of times and still cannot find propagation routes that prevent the candidate locations from being blocked by the constraints of movements and assigned low weight values, the state space estimator can perform a resampling based on the particles that are not blocked by the constraints. If all particles are blocked by the constraints, the state space estimator can perform a parallel resampling of a portion of the venue or the entire venue to recover from filter divergence. 
     The following describes devices and systems for implementing the reduction of impact of hard limit constraints on the state space model discussed above. 
     Overview of System Implementing Reduction of Impact of Hard Limit Constraints 
       FIG. 4  is a block diagram providing an overview of location determination with reduced impact of hard limit constraints on state space models. Location server  102  can include one or more computers programmed to generate location fingerprint data and store the location fingerprint data in location fingerprint database  104 . Location server  102  can provide the location fingerprint data to mobile device  106 . Mobile device  106  can determine a location of mobile device  106  using the location fingerprint data received from location server  102 . 
     The map data generated by location server  102  can include a set of features associated with a venue. The venue can be a space (either indoors or outdoors) accessible by a pedestrian. The venue can include one or more constraints limiting the pedestrian&#39;s movement in the space. These constraints can include, for example, map constraints (e.g., walls, railings, or cubicle separators), pathway constraints (e.g., a pedestrian walking on a pathway defined by road signs tends to follow the pathway), or pedestrian motion constraints (e.g., a pedestrian cannot move faster than X miles per hour, or move vertically when not in a stairway or elevator). The venue can be a physical structure. The physical structure can be closed (e.g., a building) or open (e.g., an open stadium). The space can be indoor space inside of the physical structure, or space inside of a bounding space of the physical structure if the physical structure is open. The venue can be mobile (e.g., an airplane, a cruise ship, or a mobile oil platform). 
     For example, a venue can be a multi-story office building having a lobby, offices, walls, doors, elevators, and hallways. A pedestrian can be a human or a device that moves at a speed that is similar to a human&#39;s walking or running speed. 
     Location server  102  can generate the location fingerprint data by designating measurements of environment variables as the set of features associated with a venue. The environment variables can be signals from one or more signal sources. The measurements of environment variables can include data obtained through one or more Wi-Fi™ access point radio frequency (RF) scans. The data can include service set identifier (SSID) or received signal strength indicator (RSSI). The measurements of environment variables can include magnetic field properties, including static and dynamic properties. For example, the measurements can include a magnitude and a direction of a magnetic field and their respective rate of change. The measurements of environment variables can include Bluetooth™ scan data, e.g., an identifier or RSSI. The measurements of environment variables can include cellular data, e.g., cell identifier or RSSI. The measurements of environment variables can include vision-based features, e.g., light intensity, color, or visual features determined by a feature recognition device. The measurements of signals can include measurement of near field communication (NFC) signals or radio frequency identification (RFID) signals. 
     Location server  102  can generate location fingerprint data using fingerprint engine  108 . Fingerprint engine  108  can generate the location fingerprint data using survey or prediction. To generate location fingerprint data using survey, fingerprint engine  108  can receive crowd-sourced data, or survey data, from one or more sampling devices. Fingerprint engine  108  can generate the location fingerprint data based on the received crowd-sourced data using interpolation. The crowd-sourced data can include measurements of environment variables submitted by the one or more sampling devices. Each sampling device can be a mobile device having a sensor (e.g., an RF receiver) for measuring an environment variable (e.g., an RF signal) and configured to provide the measurement to fingerprint engine  108 . To measure the signal, the sampling device can be programmed to record detectable signals while being placed at various sampling points. For example, a user or a vehicle can carry the sampling device and walk or otherwise travel (e.g., move up or down with an elevator) inside of venue (e.g., a building). Meanwhile, the sample device can record measured signals, and submit the recorded signals to location server  102  in real time or in batches. The recorded signals can be from diverse signal sources. For example, the recorded signals can include some or all of magnetic field measurements, RF measurements, and light measurements. The recorded measurements and interpolation can be associated with the venue. 
     To generate location fingerprint data using prediction, fingerprint engine  108  can use predicted signal measurements generated by signal estimator  110 . Predication can include extrapolation using truth data on access points. The truth data can include known locations of the access points. Signal estimator  110  can be a component of location server  102  that is configured to generate estimated signal measurements based on a map (or other structural information specifying signal barriers) of a venue and the known locations of signal sources in the venue. Signal estimator  110  can receive the map, the locations, and attributes of signal sources. Signal estimator  110  can determine an estimated signal measurement at a given location based on attributes of the signal sources, locations of the signal sources, and features in the map. For example, signal estimator  110  can determine one or more sampling points in a venue, and determine a distance between a sampling point and a wireless access point. Based on a type, make, or model of the wireless access point, signal estimator  110  can determine a signal strength of the access point. Based on number of walls between the sampling point and the access point, signal estimator  110  can determine an attenuation of signal from the access point. Using the signal strength and attenuation, signal estimator  110  can determine the estimated measurement (e.g., RSSI) at the sampling point and provide the estimated measurement and coordinates of the sampling point to fingerprint engine  108 . 
     Location server  102  can send location fingerprint data to mobile device  106  upon receiving a request from mobile device  106 . Mobile device  106  can send the request to location server  102  on an as-needed basis, for example, when mobile device  106  enters a venue. Mobile device  106 , upon receiving the location fingerprint data, can store the location fingerprint data in location fingerprint database  112 . Mobile device  106  can obtain a set of measurements of environment variables (e.g., results from one or more Wi-Fi™ scans) using sensors  114 . Sensors  114  can send the measurements to scan analyzer  116  as measurement vectors. Scan analyzer  116  can be a component of mobile device  106  configured to derive a highest probable location of mobile device  106  based on the measurement vectors and location fingerprint data. Mobile device  106  can use scan analyzer  116  to match readings in the measurement vectors from sensors  114  against location fingerprint data stored in location fingerprint database  112 . The match can be multi-dimensional. For example, the match can be performed on a signal source dimension (measurement of signal source 1, measurement of signal source 2 . . . ) and a location dimension (e.g., latitude, longitude, and altitude). The match can include a statistical classification of the measurement vectors where the location fingerprint data are training data for the statistical classification. Scan analyzer  116  can derive the highest probable location as a function of the multidimensional match. 
     In some implementations, scan analyzer  116  can designate the highest probable location as a location observation, and provide the location observation to particle filter engine  118 . Particle filter engine  118  is a component of mobile device  106  configured to use available data to estimate a current location of mobile device  106 . Particle filter engine  118  can determine an initial location of mobile device  106 , for example, by using random location in the venue or using a first observation. In addition, particle filter engine  118  can receive from sensors  114  motion information of mobile device  106 . Using the motion information and a map of the venue, particle filter engine  118  can configure parameters of a particle filter to model candidate locations of mobile device  106 . The motion information can be used to determine the heading and velocity of the propagation of the candidate locations. 
     Between two observation updates, the propagation of the candidate locations is performed in several sub-propagation steps, in which the time duration for each sub-propagation step is less than the time period between the two observation updates. For example, the time period between two observation updates can be divided into several sub-periods, and a sub-propagation step is performed in each of the sub-periods to explore potential curved or piecewise linear routes that the candidate positions may propagate between the two observation updates. Particle filter engine  118  can then update the particle filter using the location observation from scan analyzer  116 . 
     If the particle filter detects that the propagation of candidate locations are blocked by constraints of movement resulting in a low matching between an updated observation and observation values in the fingerprint database associated with the candidate locations, and there are constraints of movement near the candidate locations, the particle filter may increase the ranges of possible heading and velocity of the propagation of the candidate locations, and re-propagate the candidate locations to find alternative propagation routes. 
     Updating the particle filter can include determining a current location estimate based on a past location estimate and the observation. The current location estimate can be determined using a probability density function on the candidate locations. Particle filter engine  118  can provide a representation of current location estimate as an output for display to a user of mobile device  106 . 
     In the example of  FIG. 4 , particle filter engine  118  receives an observation from scan analyzer  116 , which derives a highest probable location of mobile device  106  based on the measurement vectors and location fingerprint data. The process of re-propagating particles or candidate locations can be used for any type of particle filters, which do not necessarily have to use location fingerprint data. 
     Generating Location Fingerprint Data 
       FIG. 5  illustrates exemplary survey techniques for generating location fingerprint data. Sampling device  202  can survey available features of venue  204 . Surveying venue  204  can include measuring one or more environment variables using a sensor of sampling device  202 . Each environment variable can be a radio signal characteristic, a magnetic field intensity or direction, a temperature, a sound level, a light intensity or color. The environment variables can include signals from signal sources  206 ,  208 , and  210 . Signal sources  206 ,  208 , and  210  can transmit signals that are detectable by sampling device  202  inside of venue  204 . Signal sources  206 ,  208 , and  210  need not be physically located in venue  204 . 
     Sampling device  202  can be carried to various sampling points in venue  204 . Sampling device  202  can determine the sampling point based on a user input on a map of venue  204  displayed on sampling device  202 . At each sampling point, sampling device  202  can record a sensor reading measuring signals from one or more signal sources. For example, if signal sources  206 ,  208 , and  210  are wireless access points, sampling device  202  can record SSID received from the access points, and record RSSI from each wireless access point when sampling device  202  can detect a wireless signal from each wireless access point (as indicated in dashed lines in  FIG. 5 ). Sampling device  202  can designate the measurement at each sampling point as a measurement vector of the sampling point. At each sampling point, sampling device  202  need not detect signals from all signal sources to generate the measurement vector for a sampling point. Sampling device  202  can send the measurement vectors to location server  102  as survey data for additional processing. 
     Venue  204  may include space  214  for which no sampling data exist. Space  214  can be a space not reached by sampling device  202 , or a space where sampling device  202  moved through without staying long enough to obtain a reading of the signals. Fingerprint engine  108  of location server  102  can determine measurements at space  214  through interpolation or extrapolation. Additional details of operations of fingerprint engine  108  will be described below in reference to  FIG. 6 . 
       FIG. 6  is a block diagram of exemplary fingerprint engine  108  for generating location fingerprint data. Fingerprint engine  108  can be programmed to receive survey data from one or more individual sampling devices (e.g., sampling device  202  of  FIG. 5 ) and generate the location fingerprint data based on the received survey data. Fingerprint engine  108  can include data filter  302 . Data filter  302  is a component of fingerprint engine  108  configured to pre-process the received survey data. Pre-processing the survey data can include discarding abnormal survey data (e.g., incomplete readings or outliers) and compensating for differences among different sampling devices. 
     Fingerprint engine  108  can include data interpolator  304 . Data interpolator  304  is a component of fingerprint engine  108  configured to up-sample a feature resolution. Data interpolator  304  can determine that the survey data are sparse, and apply an interpolation scheme in the up-sampling. 
     Fingerprint engine  108  can include feature extrapolator  306 . Feature extrapolator  306  is a component of fingerprint engine  108  configured to determine whether a confidence value of a specific feature satisfies a threshold and to extrapolate a feature from survey data if the threshold is satisfied. The feature can reflect a characteristic of signals received at a given sampling point. 
     Fingerprint engine  108  can include data verifier  308 . Data verifier  308  is a component of fingerprint engine  108  configured to maintain integrity of the features by verifying a feature derived from survey data against one or more existing features stored in location fingerprint database  104 . Data verifier  308  can verify that each feature at a given venue that has a given set of constraints can yield at least one matching result at a high degree of confidence. Data verifier  308  can facilitate maintaining location fingerprint database  104 , including keeping location fingerprint database  104  up to date. In addition, data verifier  308  can evaluate integrity of location fingerprint database  104  by determining uniqueness of location fingerprint database  104  as a function of spatial difference. 
       FIG. 7  illustrates an exemplary feature vector in location fingerprint data. Sampling device  202  can conduct a survey in a venue. Sampling device  202  can detect four signal sources when sampling device  202  is inside of the venue. Each of the four signal sources can be a wireless access point. Each of the four signal sources can have an identifier, e.g., a media access control (MAC) address. The identifiers can be, for example, AP1, AP2, AP3, and AP4, respectively. A height of each vertical line in  FIG. 7  represents a measured signal strength. In this example, the vertical lines have equal height, and each corresponds to a circle. Each circle around a signal source represents a measurement (e.g., RSSI) of the corresponding signal source that is equal to a measurement represented (e.g., 20 dB) by the height of the vertical line. A circle (e.g., the one around AP2) can be larger than another one (e.g., the one around AP4). The different in size can indicate that sampling device  202  can receive signals having a same signal strength in a larger area around one signal source (AP2) than around another signal source (AP4). 
     At location  502 , sampling device  202  can detect signals from AP1, AP2, AP3, and AP4. The signal strength of the signals from AP1, AP2, AP3, and AP4 can be +20 dB, −95 dB, −95 dB, and −95 dB, respectively. Sampling device  202  can submit the signal strengths as measurement vector  504  to location server  102 . Location server  102  can determine feature vector  506  based on measurement vector  504 . Feature vector  506  can have multiple elements, each element corresponding to a signal source. A value of each element can indicate a probability that the corresponding signal source is detectable by a mobile device. Feature vector  506  can be derived from measurement vector  504 . Feature vector  506  can indicate that some measurements may bear more information than other measurements. For example, if at a given location, four access points AP1, AP2, AP3, and AP4 are detected, whereas signals from one access point (AP1) is very strong compared to signals from the other three access points. Location server  102  can determine that a strong RSSI measurement can only be observed in a spatially limited region, and accordingly, strong access point AP1 can have higher information content (entropy) than AP2, AP3, and AP4. For example, location server  102  can assign entropy values 0.7, 0.1, 0.1, and 0.1 to AP1 through AP4, respectively. Feature vector  506  can be associated with location  502 , indicating that, at location  502 , a mobile device is likely to detect a signal from AP1, but unlikely to detect signals from AP2, AP3, and AP4. Location server  102  can store feature vector  506  in a location fingerprint database as a portion of the location fingerprint data associated with the venue surveyed by sampling device  202 . 
     In some implementations, location server  102  can designate a feature vector as a good feature vector when a measurement pattern indicates a high probability that sampling device  202  is located proximate to a given signal source. Location server  102  can designate a feature vector as a good feature vector based on factors including observed power level or existence of a given frequency, among other factors. In the example shown, when location server  102  receives measurement vector  504 , location server  102  can determine sampling device  202  has a high likelihood of being close to AP1, if an area around AP1 where a device can measure an RSSI  of  20 dB is small. Accordingly, location server  102  can designate feature vector  506  as a good feature vector. A good feature vector can be associated with higher weight in location determination by a mobile device. 
     Exemplary Location Fingerprint Data 
       FIG. 8  illustrates an exemplary logical structure of a location fingerprint database. Location fingerprint data can include, for each location among multiple locations in a venue, at least one of measurements (or lack of measurements thereof) of various signal sources, expected measurements of the signal sources, variance of the expect measurements, and a feature vector. For example, location fingerprint data can include at least one of: wireless access point fingerprint data; RFID fingerprint data; NFC fingerprint data; Bluetooth™ fingerprint data; magnetic field fingerprint data; cellular fingerprint data; or computer vision fingerprint data. The various fingerprint data can be aggregated to form the location fingerprint data for a given location. 
     Location fingerprint data can be stored as multi-dimensional data in association with a venue. Some of the dimensions of the multi-dimensional data can be space dimensions. The space dimensions can include X (e.g., latitude), Y (e.g., longitude), and Z (e.g., altitude, not shown). The space dimension can be continuous, expressed in a function, or discrete, where the space dimension can include locations (e.g., locations  606 ,  608 ,  610 ,  612 , and  614 ) distributed in the venue. The distribution can be even and uniform, or concentrated around areas where good feature vectors exist. 
     At least one dimension of the multi-dimensional data can be a signal source dimension. Feature vector  602  can correspond to a location represented by (X, Y, Z), and have one or more values of each signal source. The values can include one or more of an expected value of an environment variable (e.g., an expected RSSI), a variance of the expected value, or a probability that a mobile device can detect the signal from the signal source. Fingerprint engine  108  of location server  102  can determine the expected value and variance based on measurements and variance of the measurements received from a sampling device (e.g., sampling device  202  of  FIG. 5 ). The measurements can be diverse. For example, the signal source dimension can include dimension variables AP1, AP2, and a magnetic field measurement. 
     In some implementations, the space dimensions can be normalized. Fingerprint engine  108  can receive measurements from one or more sampling devices. Each measurement can correspond to a sampling point. For example, a surveyor can carry the sample device and follow path  604  to survey a venue. Fingerprint engine  108  can normalize path  604  to locations  606 ,  608 ,  610 ,  612 , and  614  according to distribution of  606 ,  608 ,  610 ,  612 , and  614 . 
     Exemplary Location Estimate 
       FIG. 9  illustrates exemplary techniques of estimating a current location using statistical classification. Mobile device  106  (of  FIG. 4 ) can receive location fingerprint data  712  from location server  102 . Location fingerprint data  712  can be associated with a venue. Location fingerprint data  712  can include all data in a location fingerprint database specific for the venue. Mobile device  106  can match multi-dimensional measurement vector  702  derived from one or more sensors  114  against location fingerprint data  712  to derive a highest probable location of mobile device  106  at the venue. The highest probable location can be a function of multi-dimensional measurement vector  702 . 
     Scan analyzer  116  of mobile device  106  can determine the highest probable location of mobile device  106  using an adaptive scheme between statistical classification and regression. In the statistical classification, scan analyzer  116  can identify to which locations in a set of locations (e.g., locations  704 ,  706 ,  708 , or  710  of the venue) a vector of sensor measurements belong based on training data. The set of locations can be estimated locations of mobile device  106 . The vector of sensor measurements can include multi-dimensional measurement vector  702 . The training data can include measurements associated with known locations. Scan analyzer  116  can use location fingerprint data  712  as the training data. 
     Scan analyzer  116  of mobile device  106  can employ a point-wise kernel estimation procedure to determine a category of multi-dimensional measurement vector  702 . The category can be location  704 ,  706 ,  708 , or  710 . Scan analyzer  116  can determine a probability density function (PDF) of a location of mobile device  106  among locations  704 ,  706 ,  708 , and  710 . To determine the PDF, scan analyzer  116  can determine a probability that multi-dimensional measurement vector  702  is located at each of locations  704 ,  706 ,  708 , and  710  by applying a kernel function to a difference between multi-dimensional measurement vector  702  and respective feature vectors or measurement vectors corresponding to locations  704 ,  706 ,  708 , and  710 . Scan analyzer  116  can apply a symmetric function that integrates to one (e.g., a Gaussian function, uniform function, or cosine function) as a choice of the kernel function for the point-wise kernel estimation. 
     Scan analyzer  116  can employ the feature vector in the kernel estimation procedure. In some implementations, the feature vector can use a derived entropy vector. Scan analyzer  116  can use the feature vector to increase significance of an access point the signals from which measure strong. The entropy vector can include as elements entropy of each subset of the locations. Scan analyzer  116  can use the entropy vector to express information content of multi-dimensional measurement vector  702 . Scan analyzer  116  can determine that a subset of multi-dimensional measurement vector  702  having lower readings (e.g., lower RSSI measurements) possesses a lower information content than a subset of multi-dimensional measurement vector  702  having higher readings (e.g., higher RSSI measurements) possesses. The determination can indicate that, for a venue, a subset of regions having low readings can be greater than a subset of regions having higher readings. 
     In some implementations, scan analyzer  116  can optimize the determination by reducing a search space. A search space can correspond to a location of a mobile device and an uncertainty associated with the location. Scan analyzer  116  can start from an initial estimate, which can be designated as an initial search space. For example, when scan analyzer  116  has no information on location of mobile device  106 , scan analyzer can designate the world as the initial search space. When scan analyzer  116  obtain some location information, scan analyzer  116  can reduce the search space to the United States, the state of California, the city of Cupertino, or a particular street block or building, based on the location information. Each location estimate can be derived from the estimate before. 
     Reducing the search space can include reducing, when possible, a number of discrete points (e.g., locations) for calculating probabilities in the PDF. Scan analyzer  116  can execute the kernel function in an a priori domain provided to scan analyzer  116 . The a priori domain can be an a posteriori state estimate at time k given observations up to and including at time k by particle filter engine  118 . For example, particle filter engine  118  can determine that, based on a constraint of the venue (e.g., a wall) and a limit of a speed of movement of mobile device  106  (to a maximum speed of a human walking or running), location  710  is not a possible location and shall be filtered out. Scan analyzer  116  can then determine a location observation based on probability densities on locations  704 ,  706 , and  708 . The a priori domain can be associated with uncertainty, which may increase or decrease. For example, in an attempt to reduce the search space, mobile device  106  can lose signals, causing location uncertainty and search space to increase. 
       FIG. 10  is a flowchart of exemplary procedure  800  of generating a location observation using kernel estimation. Procedure  800  can be performed by exemplary scan analyzer  116  as described above in reference to  FIG. 4 . 
     Scan analyzer  116  can define ( 802 ) statistical classification parameters using location fingerprint data and sensor measurements. Scan analyzer  116  can define classification categories, a sample vector, and training data for the statistical classification. The classification categories can be one or more candidate locations of mobile device  106 . The candidate locations can be one or more locations in a location fingerprint database. The sample vector can be multi-dimensional measurement vector  702  received from one or more sensors. The training data can be vectors stored in the location fingerprint database. Scan analyzer  116  can map the sample vector into the location categories (or “bins”). The mapping can be classification or regression. Classification can include a strict association where the sample vector is mapped into exactly one bin. Regression can include a derived association, where the sample vector is mapped into multiple bins. In regression, scan analyzer  116  can derive a final category of the sample vector by performing statistical analysis on the multiple bins. 
     Scan analyzer  116  can define ( 804 ) information content of measurements. Defining information content of measurements can include determining a weight of each measurement in the multi-dimensional measurement vector by applying a feature vector (e.g., an entropy vector). 
     Scan analyzer  116  can reduce ( 806 ) search space by a priori estimate. Reducing the search space can include executing a kernel function over an a priori domain, which can be an a posteriori state estimate provided to scan analyzer  116  by particle filter engine  118 . 
     Scan analyzer  116  can generate ( 808 ) a location observation. Generating the location observation can include performing a point-wise kernel estimation procedure to estimate of a PDF of location of mobile device  106  in the reduced search space. Generating the location observation can include aggregating statistics out of a set of most likely matches according to the PDF. Scan analyzer  116  can provide the location observation to particle filter engine  118  for estimating a current location of mobile device  106 . 
     Exemplary Particle Filter 
       FIG. 11  is a block diagram illustrating an exemplary mobile device estimating a current location using a particle filter. The mobile device can be mobile device  106  as described in reference to  FIG. 4 . 
     Mobile device  106  can use “available information” to estimate a location when GPS signals are unavailable. The available information can include, for example, motion models, motion measurements, environmental constraints, and map constraints. Mobile device  106  can then use a state space model to fuse available information from different information sources. 
     The state space model can be a simulation-based estimation model, e.g., a particle filter. Particle filter engine  118  of mobile device  106  can estimate a probability density of current locations X k  of mobile device  106  using the particle filter based on a previous location X k−1  conditioned upon a current observation Z k , where k is a given point in time, k−1 is a point prior to k in time. The time length between k and k−1 can be configurable (e.g., one second or five seconds). 
     Particle filter engine  118  can include state space estimator  902 . State space estimator  902  can be configured to receive available information and fold the available information into location estimator  904 , which is a component of particle filter engine  118  configured to provide a location estimate. 
     State space estimator  902  can receive, from a storage device of a server or of mobile device  106 , map data  906 . Map data  906  can include attributes of one or more constraints in a venue that includes a space accessible by a pedestrian carrying mobile device  106 . The constraints can include structural constraints (e.g., walls). State space estimator  902  can determine that the pedestrian cannot transition through the structural constraint. State space estimator  902  can determine a likelihood where the pedestrian may move within a given time interval, given limited motion speed of the pedestrian. 
     The constraints in map data  906  can include attributes of regions in the space of the venue. For example, the constraints in map data  906  can define pathways (e.g., hallways) and an open area (e.g., a lobby, a cafeteria, or an office). The pathways can be represented by a path network including segments connected by joints. State space estimator  902  can determine that, when a pedestrian walks in the pathway, the pedestrian is likely to adhere to the pathway, whereas when the pedestrian walks in the open area, the pedestrian can float, e.g., move in random directions, without adhering to a pathway. State space estimator  902  can determine that the movement of the pedestrian is subject to constraint probabilities. For example, state space estimator  902  can determine a probability that the pedestrian enters an open space that opens to a pathway when a pedestrian is walking along a pathway. The probability that the pedestrian enters the open space can be higher or lower than a probability that the pedestrian stays on the pathway, based on a type of the open space (e.g., whether the open space is a lobby, a cafeteria, or an office) or a relative position of the pathway and the open space (e.g., whether the pathway ends at the open space). Additional details on determining limits on likelihood of where the pedestrian may move within a given time interval will be described below in reference to  FIG. 12 . 
     State space estimator  902  can receive, from sensors  114 , a motion context. The motion context can include readings of sensors  114 . Sensors  114  can include micro-electromechanical systems (MEMS) of mobile device  106 . For example, sensors  114  can include compass  907  configured to determine a direction of a pedestrian&#39;s heading, accelerometer  908  configured to determine whether a pedestrian&#39;s movement is walking or running, a pace of the movement, and a stride of the movement. Sensors  114  can include barometer  910  configured to determine whether a pedestrian is moving upwards or downwards (e.g., in an elevator or on stairs) based on air pressure. Sensors  114  can include gyroscope  912  configured to determine whether a pedestrian is turning. 
     Based on the motion context, state space estimator  902  can determine if a pedestrian carrying mobile device  106  is stationary or non-stationary. If state space estimator  902  determines that the pedestrian is stationary, state space estimator  902  can configure location estimator  904  using state space system noise (e.g., random locations). If state space estimator  902  determines that the pedestrian is non-stationary, state space estimator  902  can configure location estimator  904  using motion speed of the pedestrian to drive state space update of location estimator  904 . 
     State space estimator  902  can determine attitude information based on the motion context data received from sensor  114 . The attitude information can include a heading of the pedestrian determined using a series of motion context data received from sensor  114 . State space estimator  902  can receive the series of motion context data over time, and estimate a heading based on the series of motion context data using a filter configured to use a series of measurements observed over time to produce estimates of unknown variables. In some implementations, the filter can be a Kalman filter. 
     Based on the map constraints, the motion context, and the attitude information, state space estimator  902  can determine candidate locations of mobile device  106 . State space estimator  902  can designate the candidate locations as samples (or “particles”) for propagation in particle filter P(X k |X k−1 ), where X k  are current locations of mobile device  106  at time k, X k−1  are previous locations at time k−1. Propagating the particle filter can include applying the available information, including map data, motion context, and attitude information to the particle filter to determine probability density of the candidate locations in at least a portion of the venue, given previous locations. Propagating the particle filter can be based on a stochastic process for exploring some or all potential constraints. In some implementations, the stochastic process can be a discretized Wiener process. The time length between k and k−1 can be divided into several sub-periods, and a sub-propagation step can be performed in each sub-period according to a stochastic process. Propagating the particle filter can be subject to a multi-dimensional correlation function based on availability of the constraints. 
     State space estimator  902  can detect particle depletion when a number of candidate locations fall below a threshold number sufficient for probability density calculation. Upon such detection of particle depletion, for the candidate locations that are blocked by constraints of movement, state space estimator  902  can perform the propagation step again in which the noise level is increased such that the ranges of heading and velocity are increased. The candidate locations may be propagated at slightly different random directions, governed by a stochastic propagation model, e.g., a Gauss-Markov Process. State space estimator  902  tries to find alternative routes that may travel around the hard limit constraints. This is repeated several times for the candidate locations that are blocked by the constraints of movement, in which the noise level is increased with each successive try, until alternative propagation routes are found that do not result in particle depletion. If, after a preset number of tries, state space estimator  902  cannot find alternative propagation routes that do not result in particle depletion, state space estimator  902  can perform a parallel resampling of a portion of the venue or the entire venue to recover from filter divergence. 
     Upon propagating the particle filter, state space estimator  902  can provide the particle filter to location estimator  904  for update. Location estimator  904  can update the particle filter using a location observation received from a scan analyzer (e.g., scan analyzer  116  as described in reference to  FIG. 4 ). Updating the particle filter can include feeding estimated fingerprint location into the particle filter. The location observation can be subject to a measurement model having a given system uncertainty. Updating the particle filter can include calculating probability density P(X k |X k−1 , Z k ) where Z k  is a location observation at time k. In this step, the candidate locations are updated according to the new location observation. Location estimator  904  can then determine a current location of mobile device  106  (location at time k) using the probability density, including designating a most likely location of mobile device  106  as the current location of mobile device  106 . 
     When updating the particle filter it is determined that some candidate locations are blocked by constraints of movement, state space estimator  902  can re-propagate those candidate locations to find alternative propagation routes that allow the candidate locations to go around the constraints at time k. Upon detection of such candidate locations being blocked, state space estimator  902  can perform the propagation step again in which the noise level is increased such that the ranges of heading and velocity are increased. The candidate locations may be propagated at slightly different random directions, governed by the stochastic propagation model, e.g., a Gauss-Markov Process. State space estimator  902  tries to find alternative routes that may travel around the hard limit constraint. This is repeated several times, in which the noise level is increased with each successive try, until alternative propagation routes are found. If, after a present number of tries, state space estimator  902  cannot find alternative propagation routes that go around the constraints, location estimator  904  can perform a parallel resampling of a portion of the venue or the entire venue to recover from filter divergence. 
       FIG. 12  illustrates exemplary applications of constraints to a particle filter. A state space sampler (e.g., state space estimator  902  as described above in reference to  FIG. 11 ) can receive map data of venue  204 . The map data can specify that venue  204  includes open space  1002 , hallway  1004 , and office  1006 . 
     For a given time k, mobile device  106  can determine initial location  1007  corresponding to time k−1. The initial location can be a previously estimated location of mobile device  106 . Immediately after mobile device  106  entered venue  204 , or immediately after mobile device  106  is turned on at venue  204 , it is possible that mobile device  106  has not performed a previous location estimate. In such cases, mobile device  106  can determine that initial location  1007  is a random location in venue  204 . Initial location  1007  is illustrated as a single point. In some implementations, initial location  1007  can be a probability density function on multiple possible locations, each possible location being associated with a probability that mobile device  106  is located at that location. The probability density function can be discrete or continuous. 
     Mobile device  106  can determine, using one or more sensors, that mobile device  106  is stationary, e.g., when linear and angular speed and linear and angular acceleration are zero or near zero (e.g., undistinguishable from system error margin). Upon determining that mobile device  106  is stationary, mobile device  106  can generate candidate locations  1008 ,  1010 ,  1012 , and  1014  for time k for a particle filter. Candidate locations  1008 ,  1010 ,  1012 , and  1014  can be generated based on state space system noise. In addition, initial location  1007  can be a candidate location. Mobile device  106  can apply constraints of movement in venue  204  to the particle filter. For example, mobile device  106  can determine that, since initial location  1007  is in open space  1002 , no directional constraint need to be applied; candidate locations  1008 ,  1010 ,  1012 , and  1014  can be in any direction from initial location  1007 . In addition, mobile device  106  can determine that candidate location  1014  represents an impossibility, because mobile device  106  needs to go through a barrier (e.g., a wall) or to travel at a speed exceeding a walking or running speed for a pedestrian to go around hallway  1004  to reach candidate location  1014  from initial location  1007 . Mobile device  106  can remove candidate location  1014  from the particle filter based on the impossibility. 
     At given time t, mobile device  106  can determine initial location  1018  of mobile device  106 . Initial location  1018  can correspond to time t−1. Mobile device  106  can determine, using one or more sensors, that mobile device  106  is non-stationary, e.g., when linear or angular speed or acceleration is nonzero. Upon determining that mobile device  106  is non-stationary, mobile device  106  can generate candidate locations for time t for a particle filter. The candidate locations can include location distribution sampled by the particle filter. Mobile device  106  can decide that initial location  1018  is on a path in venue  204  following hallway  1004 . Accordingly, mobile device  106  can determine that a direction of movement of mobile device  106  is limited to a direction of the path as defined by hallway  1004 . Based on a heading of mobile device  106 , mobile device  106  can determine candidate location  1020 , which is in front of mobile device  106  according to the heading, and candidate location  1022 , which can be behind mobile device  106  according to the heading. Mobile device  106  can determine that candidate location  1020  is a more likely location of mobile device  106  than candidate location  1022  is. In addition, mobile device  106  can determine that initial location  1018  is sufficiently close to an entrance of office  1006  such that a pedestrian, moving at walking speed, can enter office  1006  during the time between t−1 and t. Accordingly, mobile device  106  can place candidate location  1024  in office  1006 . Mobile device  106  can assign a distinct weight to each of the candidate locations  1020 ,  1022 , and  1024  for the particle filter. 
       FIGS. 13A-13C  illustrate exemplary techniques of configuring a particle filter using readings from sensors of a mobile device. The mobile device can be mobile device  106  as described above in reference to  FIG. 4 . 
       FIG. 13A  illustrates determining current location estimates based on initial location  1102  when the mobile device is moving at velocity v1. The mobile device can determine the velocity v1 based on rate of change of readings of a sensor. In some implementations, the mobile device can determine the velocity v1 based on a frequency of change of acceleration measured by an accelerometer, where a higher frequency indicates a faster pace of a pedestrian. In addition, the mobile device can determine the velocity v1 based on a magnitude of the acceleration, where a greater magnitude indicates a larger stride. 
     The mobile device can determine current location estimates  1104 ,  1106 ,  1108 ,  1110 , and  1112 . The mobile device can generate more current location estimates (e.g., location estimates  1106 ,  1108 ,  1110 , and  1112 ) in a direction of the heading of mobile device than current location estimates (e.g., location estimates  1104 ) in a direction away from the heading. The difference in number of location estimates can simulate situation where the mobile device has a higher likelihood to continue moving in an original heading than to turn back. The current location estimates can be subject to constraints of a venue, e.g., wall  1114 . The mobile device can then configure a particle filter using the estimated locations  1104 ,  1106 ,  1108 ,  1110 , and  1112 , subject to a location observation provided by a scan analyzer (e.g., scan analyzer  116  of  FIG. 4 ). The observation can be derived from location fingerprint data and can include a single location or discrete or continuous probability densities of multiple locations. 
       FIG. 13B  illustrates determining current location estimates based on initial location  1118  when the mobile device is moving at velocity v2. The mobile device can determine that, based on readings of the sensors, velocity v2 is high (e.g., higher than velocity v1 of  FIG. 13A ). Upon determining that velocity v2 is high, the mobile device can determine that a pedestrian carrying the device is more likely to continue according to the current heading, and less likely to turn back than the pedestrian of  FIG. 13A . Accordingly, the mobile device can generate more current location estimates (e.g., location estimates  1120 ,  1122 ,  1124 ,  1126 ,  1128 , and  1130 ) in a direction of the heading. The mobile device can generate estimated location  1132  in a direction that is away from the heading, to model the possibility that the pedestrian turns back. 
     The mobile device can generate location estimates  1122  and  1126  on a path the mobile device is projected to be traveling. The mobile device can use location estimates  1122  and  1126  for calculating probabilities the pedestrian is traveling at different velocities, to verify or correct the current velocity (v2) as determined by the motion sensors. 
     The mobile device can generate location estimates  1120 ,  1124 ,  1128  and  1130  for calculating probabilities that the mobile device changes directions. Comparing to  FIG. 13A , the velocity v2 is higher than velocity v1. Accordingly, the distribution of location estimates  1120 ,  1122 ,  1124 ,  1126 ,  1128 , and  1130  can be more concentrated along the heading of the mobile device than location estimates  1106 ,  1108 ,  1110 , and  1112  are, where in a higher concentration, the location estimates are in a narrower beam along the heading and have less divergence away from the heading. For example, in some implementations, an expected number of location estimates is proportional to the velocity of the mobile device; a variance of directions of the location estimate can be inversely proportional to the velocity. 
       FIG. 13C  illustrates determining current location estimates based on initial location  1140  when the mobile device is moving along a pathway. A mobile device can determine initial location  1140  of the mobile device and a motion velocity v3. Based on map data of a venue, the mobile device can determine that the mobile device is heading in a hallway towards a corner. The mobile device can determine that movement of the mobile device is constrained by walls of the hallway. Accordingly, the mobile device can configure a particle filter using location estimates that are on the pathway, e.g., in the hallway. The mobile device can determine current location estimates  1142 ,  1144 ,  1146 , and  1148  that are not along the heading of the mobile device, but are locations the mobile device is likely to be if the mobile device continues on the heading and then turns to follow the hallway. The mobile device can place more current location estimates (e.g., current location estimates  1142 ,  1144 ,  1146 , and  1148 ) in front of the mobile device in the pathway than current location estimates (e.g., current location estimate  1150 ) behind the mobile device. 
     Exemplary Processes 
       FIG. 14  is a flowchart of exemplary procedure  1200  of generating location fingerprint data. Procedure  1200  can be performed by a location server, e.g., location server  102  of  FIG. 4 . 
     The location server can identify ( 1202 ) one or more environment variables to be associated with a venue. Each environment variable can measure a signal. Each environment variable can correspond to a signal source. The signal source can include a wireless access point, a light source, a sound source, a magnetic source, or a heat source. Identifying the one or more environment variables can include receiving an identifier of each signal source from a sampling device (e.g., sampling device  202  of  FIG. 5 ) that is configured to survey the venue. 
     The location server can determine ( 1204 ) multiple locations where the signal is detectable by a sensor of a mobile device when the mobile device is located at the venue. Each location can include location coordinates in a reference frame. For example, when the reference frame is Earth, the location coordinates can include latitude, longitude, and altitude. When the reference frame is the venue, the location coordinates can be vertical and horizontal distances from a given point in the venue. 
     The location server can determine ( 1206 ) location fingerprint data for the venue. The location fingerprint data can include a fingerprint for each of the locations. The fingerprint can include a set of one or more measurements that the mobile device is expected to receive when the mobile device measures the signal at the corresponding location. Each of the measurements can include at least one of an RSSI, a round-trip time, a magnetic field strength, a temperature, a sound level, or an air pressure level. 
     The location fingerprint data can include multi-dimensional data having an environment variable dimension and a location dimension. The environment variable dimension of the location fingerprint data can correspond to the one or more environment variables. The location dimension of the location fingerprint data corresponds to coordinates of the one or more locations. The location dimension can include a longitude sub-dimension, a latitude sub-dimension, and an altitude sub-dimension. One or more values in the location fingerprint data at a given location and given environment variable corresponds to a probability distribution that includes an expected value and a variance of the environment variable at the given location. 
     The location server can determine the location fingerprint data of a venue by surveying the venue. In a survey, the location server can receive, from a sampling device (e.g., sampling device  202  of  FIG. 5 ), measurements of signals from the one or more signal sources at one or more sampling locations. The location server can extrapolate an estimated measurement of the environment variables at each of the locations from the measurement of signals at the one or more sampling locations. The location server can then generate the location fingerprint data based on the received measurements, the extrapolated measurements, and the corresponding locations. 
     In some implementations, extrapolating the estimated measurement can include determining an attenuation of the measurements of signals based on the constraints. The constraints can include one or more walls, floors, or columns. 
     In some implementations, the location server can determine the location fingerprint data of a venue by prediction. Determining the location fingerprint data by prediction can include receiving a map of the venue, and receiving location coordinates of a signal source. The location coordinates can be absolute coordinates (e.g., latitude, longitude, and altitude) or relative coordinates (e.g., on second floor, north wall, three meters from the west corner). The location server can determine multiple locations and designate the locations as sampling points. The location server can determine a transmission characteristics of the signal source. The transmission characteristics can include a propagation pattern (e.g., a rate of attenuation) of a signal from the signal source in space and in various structural barriers (e.g., various types of walls and columns). For each of the sampling points, the location server can determine an expected measurement and a variance of a signal from the signal source based on a location of the signal source, spaces and barriers between the signal source and the sampling point, an estimated propagation pattern of the signal from the signal source in the spaces, and an estimated propagation pattern of the signal from the signal source in the barriers. The location server can store the expected measurements, the variance, an identifier of the signal source, and the corresponding location as the location fingerprint data. 
     The location server can provide ( 1208 ) the location fingerprint data and an identifier of the venue to a mobile device for determining a location of the mobile device at the venue. Providing the location fingerprint data to the mobile device can occur upon an entrance of the mobile device into the venue. The location server can receive a request for location fingerprint data of a venue from the mobile device. In some implementations, the request can be triggered when the mobile device loses reception of GPS signals. The request can include a last location determined by the GPS signals. The location server can determine a venue located at the last location, and provide the location fingerprint data of the venue to the mobile device. In some implementations, the request can be triggered when the mobile device is turned on inside a venue and receives a user request for location determination. The mobile device can send the request to the location server through a wireless access point. Based on an identifier of the wireless access point, the location server can determine a venue and provide location fingerprint data of the venue to the mobile device. 
       FIG. 15  is a flowchart of exemplary procedure  1300  of estimating a location using location fingerprint data. Procedure  1300  can be performed by a mobile device, e.g., mobile device  106  of  FIG. 4 . 
     The mobile device can receive ( 1302 ), from a server (e.g., location server  102  of  FIG. 4 ), location fingerprint data. The location fingerprint data can include multiple locations at a venue and a fingerprint of each location. The venue can include a space accessible by a pedestrian and one or more constraints of movement of the pedestrian. Each fingerprint can include one or more expected measurements of an environment variable at the corresponding location. Each environment variable can include a signal from a signal source detectable by the mobile device. The one or more signal sources can include at least one of an RF source (e.g., a wireless access point), a light source, a sound source, a magnetic source, or a heat source. The one or more expected measurements can include at least one of an RSSI, a round-trip time, a magnetic field strength, a temperature, a noise level, or an air pressure level. 
     The mobile device can receive the location fingerprint data by request. The mobile device can request the location fingerprint data from the server when the mobile device determines that the mobile device is located in proximity to the venue based on a threshold. For example, the mobile device can determine, based on GPS signals and a map stored on the mobile device, that the mobile device is located within a threshold distance to a building. The mobile device can then request location fingerprint data of the building from the server. The mobile device can receive the location fingerprint data in response. 
     The mobile device can receive ( 1304 ) a measurement vector from one or more sensors of the mobile device. The measurement vector can include one or more readings of the one or more sensors on the environment variable. 
     The mobile device can determine ( 1306 ) a location of the mobile device at the venue using the measurement vector and the location fingerprint data. Determining the location can include performing a statistical classification categorizing the measurement vector into one or more possible locations where the measurement vector can be received by the one or more sensors. Each possible location can be associated with a likelihood that the measurement vector matching a fingerprint of the respective possible location. Performing the statistical classification can include categorizing, based on training data, a sample vector to one or more categories each being associated with a probability that the sample vector belongs to the corresponding category. The mobile device can designate the location fingerprint data as the training data. The mobile device can designate the measurement vector as the sample vector. The one or more categories each can correspond to a possible location of the mobile device at the venue. The probability associated with each category can indicate a likelihood that the mobile device is located at the possible location corresponding to the category. 
     The mobile device can determine the probability associated with each category. Determining the probability can include determining a point-wise kernel estimation of a probability density of the measurement vector measured at each of the possible locations. The point-wise kernel estimation can have a kernel function. The mobile device can apply the kernel function to a difference between the measurement vector and a fingerprint of the respective possible location. The kernel function can be a symmetric function that integrates to one (e.g., a Gaussian function). 
     In some implementations, the mobile device can apply the kernel function to an a priori domain provided by a particle filter. The a priori domain can be a portion of search space represented in the location fingerprint data selected before the probability densities are calculated. The a priori domain can be provided by a particle filter. For example, the a priori domain can be an a posteriori state estimate from the particle filter. 
     In some implementations, determining the location of the mobile device comprises aggregating statistics of a group of possible locations. In some implementations, determining the location of the mobile device can include calculating the location using the group of locations based on a context. The context can be a motion context. The context can include one or more readings of at least one of an accelerometer, a magnetic sensor, a gyroscope, or a barometer. 
       FIG. 16  is a flowchart of exemplary procedure  1400  of estimating a location using a particle filter. Exemplary procedure  1400  can be performed by a mobile device, e.g., mobile device  106  of  FIG. 4 . 
     The mobile device can determine ( 1402 ) an initial location of the mobile device. The initial location can be at a venue (e.g., inside of a building). The venue can include a space accessible by a pedestrian and one or more constraints of movement of the pedestrian. The initial location can be an a priori location estimate being associated with a given uncertainty value. In some implementations, determining the initial location can include estimating the initial location based on a prior location observation using scan analyzer  116  of  FIG. 4 . In some implementations, when an initial observation is unavailable, the initial location can be a random location at or near the venue having an initial uncertainty value (e.g., plus or minus 1000 meters), or a last known location determined by GPS signals having an initial uncertainty value (e.g., a value calculated based on time of the last GPS location determination and current time). When the mobile device has no prior location knowledge (e.g., when a new device is turned on for the first time inside of a building), the mobile device can determine that the initial location is a random location, and the uncertainty value is infinity. 
     The mobile device can determine ( 1404 ), based on a reading of a sensor of the mobile device, a state of motion of the mobile device. Determining the state of motion can include determining at least one of a speed or a heading of the mobile device, or rate of change of the speed or heading of the mobile device. The speed, heading, and rate of change of the speed or heading can be determined based on a reading of at least one of an accelerometer, a magnetometer, a barometer, or a gyroscope of the mobile device. 
     The mobile device can determine ( 1406 ) multiple candidate location of the mobile device based at least in part on the initial location, the state of motion, and a map of the venue specifying the one or more constraints. Determining the candidate locations can include determining whether the mobile device is stationary. If the mobile device is stationary, the mobile device can generate the candidate locations based on a state space system noise model, e.g., by generating the candidate locations randomly around the initial location. If the mobile device moves, the mobile device can determine a likelihood that the mobile device is moving from the initial location in a direction that avoids the constraints. The mobile device can then generate the candidate locations. The mobile device can generate more candidate locations in a direction that is associated with a higher likelihood (e.g., a direction that is along a heading of the mobile device). 
     In some implementations, determining the likelihood that the mobile device is moving from the initial location in the direction that avoids the constraints can include determining a path (e.g., hallway) of the venue based on the constraints. The mobile device can determine a destination type of a point on the path based on the map. The destination type (e.g., office, cafeteria, or lobby) can be indicative of a likelihood that the pedestrian will move toward a destination of the path when the pedestrian is moving along the path. The point can be located at an end of the path or on the path. The mobile device can determine the likelihood that the mobile device is moving from the initial location in the direction based on the destination type of the path. For example, if the destination type of a point in the middle of the path is a cafeteria, lobby, or conference room, the mobile device can determine that a pedestrian is more likely to enter the cafeteria or lobby than if the destination type of the point is an office. 
     The mobile device can determine whether the candidate locations are depleted. The mobile device can determine that a count of the one or more candidate locations satisfies a depletion threshold. Upon such determination, the mobile device can generate a candidate location at a random location in the venue for location determination. 
     The mobile device can receive ( 1408 ) a location observation. The location observation can include an estimated location of the mobile device in the space of the venue. The estimated location can be determined based on readings of one or more sensors of the mobile device and location fingerprint data describing attributes of signals measurable by the one or more sensors when the mobile device is at the venue. 
     The mobile device can filter ( 1410 ) the candidate locations using the location observation, including determining a likely location of the mobile device based on the candidate locations, the observation, and a probability model. 
     If some candidate locations are blocked by constraints to movement, increase the noise level in the motion model and re-propagate ( 1412 ) the candidate locations. The noise level can be gradually increased in successive tries of re-propagation until propagation routes that go around the constraints are found. If after a preset number of tries, the candidate locations are still blocked by the constraints, the state space estimator can perform a parallel resampling of a portion of the venue or the entire venue to recover from filter divergence. 
     The mobile device can determine ( 1414 ) the likely location of the mobile device, including determining a probability density based on the updated candidate locations. The mobile device can provide the likely location for output as a current location of the mobile device. The mobile device can designate the current location as an initial location for estimating a next current location of the mobile device. Providing the likely location for output can include displaying the likely location as a pin on a map of the venue displayed on a screen of the mobile device. 
       FIG. 17  is a flowchart of exemplary procedure  1420  of determining a location of a mobile device in a venue in which the impact of hard limit constraints on a state space model is reduced. The venue includes a space accessible by a movable body carrying the mobile device and one or more constraints of movement of the movable body. Exemplary procedure  1420  can be performed by a mobile device, e.g., mobile device  106  of  FIG. 4 . Procedure  1420  can include determining ( 1422 ), using a state space estimator, candidate locations of the mobile device at a first time point based on candidate positions determined at a previous time point conditioned upon an observation of one or more environmental variables provided at the first time point. 
     Procedure  1420  can include receiving ( 1424 ) a second observation of the one or more environment variables at a second time point. 
     Procedure  1420  can include using ( 1426 ) the state space estimator to perform a propagation step to determine the candidate locations of the mobile device at the second time point based on the candidate locations at the first time point and the second observation of the one or more environmental variables. The propagation step includes a plurality of sub-propagation steps in which a time length between the sub-propagation steps is a fraction of the time length between the first and second time points, and at each sub-propagation step each candidate location is propagated according to a stochastic process. 
     Procedure  1420  can include determining ( 1428 ) the location of the mobile device at the second time point based on the candidate locations at the second time point. 
       FIG. 18  is a flowchart of exemplary procedure  1440  for reducing the impact of hard limit constraints on a state space model when estimating a location of a mobile device in a venue. Exemplary procedure  1440  can be performed by a mobile device, e.g., mobile device  106  of  FIG. 4 . 
     Procedure  1440  includes receiving ( 1442 ) observations of one or more environment variables, in which the observations are updated at a first time interval. 
     Using a state space estimator, candidate locations of a mobile device are propagated ( 1444 ) at a second time interval that is smaller than the first time interval, the propagation being performed according to a stochastic process, and when an updated observation is available, updating the candidate locations based on the updated observation. 
     The location of the mobile device is determined ( 1446 ) based on the candidate locations. 
     Exemplary System Architecture 
       FIG. 19  is an exemplary user interface for displaying a location of a mobile device at a venue. The mobile device can be mobile device  106  as described in reference to  FIG. 4 . 
     The user interface can include map  1502  of a venue, e.g., a building. Map  1502  can include walls, spaces, rooms, and room designations of a particular floor. The mobile device can estimate a current location of the mobile device, and provide the current location for display as location marker  1504  in map  1502  on a display device of the mobile device. The mobile device can determine which floor is displayed based on an altitude aspect of the estimate of a current location of the mobile device. The estimated location can include an uncertainty region. The uncertainty region can include a region around the estimated current location where probability density of the mobile device is located in locations in the region that exceeds a threshold. The uncertainty region can be displayed as uncertainty region area  1506  around location marker  1504 . Uncertainty region and uncertainty region area  1506  need not be a perfectly circular area, given locations rendered impossible by movement constraints in venue  204  and motion speed of a pedestrian. 
     The user interface can include search box  1508 . Search box  1508  can be configured to receive input for a search term. Upon receiving the search term through search box  1508 , the mobile device can search data associated with map  1502  and determine if the search term matches a portion of the venue. The mobile device can emphasize or otherwise mark the portion if a match is found. For example, when the mobile device receives a search term “kitchen” and a portion of the venue is designated as “kitchen,” the mobile device can highlight the kitchen portion on map  1502 . In some implementations, the mobile device can designate the found portion (e.g., “kitchen”) as a destination. The mobile device can determine path  1510  that leads from the current location to the destination, and display path  1510  on map  1502 . 
     Exemplary System Architecture 
       FIG. 20  is a block diagram of an exemplary system architecture for implementing the features and operations of  FIGS. 2A-19 . Other architectures are possible, including architectures with more or fewer components. In some implementations, architecture  1600  includes one or more processors  1602  (e.g., dual-core Intel® Xeon® Processors), one or more output devices  1604  (e.g., LCD), one or more network interfaces  1606 , one or more input devices  1608  (e.g., mouse, keyboard, touch-sensitive display) and one or more computer-readable mediums  1612  (e.g., RAM, ROM, SDRAM, hard disk, optical disk, flash memory, etc.). These components can exchange communications and data over one or more communication channels  1610  (e.g., buses), which can utilize various hardware and software for facilitating the transfer of data and control signals between components. 
     The term “computer-readable medium” refers to a medium that participates in providing instructions to processor  1602  for execution, including without limitation, non-volatile media (e.g., optical or magnetic disks), volatile media (e.g., memory) and transmission media. Transmission media includes, without limitation, coaxial cables, copper wire and fiber optics. 
     Computer-readable medium  1612  can further include operating system  1614  (e.g., a Linux® operating system), network communication module  1616 , survey manager  1620 , fingerprint manager  1630 , and fingerprint distributor  1640 . Operating system  1614  can be multi-user, multiprocessing, multitasking, multithreading, real time, etc. Operating system  1614  performs basic tasks, including but not limited to: recognizing input from and providing output to devices  1606 ,  1608 ; keeping track and managing files and directories on computer-readable mediums  1612  (e.g., memory or a storage device); controlling peripheral devices; and managing traffic on the one or more communication channels  1610 . Network communications module  1616  includes various components for establishing and maintaining network connections (e.g., software for implementing communication protocols, such as TCP/IP, HTTP, etc.). 
     Survey manager  1620  can include computer instructions that, when executed, cause processor  1602  to provide survey instructions and maps to a sampling device (e.g., sampling device  202  of  FIG. 5 ) and receive survey data from the sampling device. Fingerprint manager  1630  can include computer instructions that, when executed, cause processor  1602  to perform operations of signal estimator  110  and fingerprint engine  108  as described above in reference to  FIG. 4 . Fingerprint distributor  1640  can include computer instructions that, when executed, cause processor  1602  to respond to a fingerprint request from a mobile device (e.g., mobile device  106  of  FIG. 4 ), including sending location fingerprint data to the requesting mobile device. 
     Architecture  1600  can be implemented in a parallel processing or peer-to-peer infrastructure or on a single device with one or more processors. Software can include multiple software components or can be a single body of code. 
     The described features can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, in a computer to perform a certain activity or bring about a certain result. A computer program can be written in any form of programming language (e.g., Objective-C, Java), including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, a browser-based web application, or other unit suitable for use in a computing environment. 
     Suitable processors for the execution of a program of instructions include, by way of example, both general and special purpose microprocessors, and the sole processor or one of multiple processors or cores, of any kind of computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memories for storing instructions and data. Generally, a computer will also include, or be operatively coupled to communicate with, one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits). 
     To provide for interaction with a user, the features can be implemented on a computer having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor or a retina display device for displaying information to the user. The computer can have a touch surface input device (e.g., a touch screen) or a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the computer. The computer can have a voice input device for receiving voice commands from the user. 
     The features can be implemented in a computer system that includes a back-end component, such as a data server, or that includes a middleware component, such as an application server or an Internet server, or that includes a front-end component, such as a client computer having a graphical user interface or an Internet browser, or any combination of them. The components of the system can be connected by any form or medium of digital data communication such as a communication network. Examples of communication networks include, e.g., a LAN, a WAN, and the computers and networks forming the Internet. 
     The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. In some embodiments, a server transmits data (e.g., an HTML page) to a client device (e.g., for purposes of displaying data to and receiving user input from a user interacting with the client device). Data generated at the client device (e.g., a result of the user interaction) can be received from the client device at the server. 
     A system of one or more computers can be configured to perform particular actions by virtue of having software, firmware, hardware, or a combination of them installed on the system that in operation causes or cause the system to perform the actions. One or more computer programs can be configured to perform particular actions by virtue of including instructions that, when executed by data processing apparatus, cause the apparatus to perform the actions. 
     While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination. 
     Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products. 
     Thus, particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. 
     Exemplary Mobile Device Architecture 
       FIG. 21  is a block diagram of exemplary architecture  1700  for the mobile devices of  FIGS. 2A-19 . A mobile device (e.g., mobile device  106 ) can include memory interface  1702 , one or more data processors, image processors and/or processors  1704 , and peripherals interface  1706 . Memory interface  1702 , one or more processors  1704  and/or peripherals interface  1706  can be separate components or can be integrated in one or more integrated circuits. Processors  1704  can include application processors, baseband processors, and wireless processors. The various components in mobile device  106 , for example, can be coupled by one or more communication buses or signal lines. 
     Sensors, devices, and subsystems can be coupled to peripherals interface  1706  to facilitate multiple functionalities. For example, motion sensor  1710 , light sensor  1712 , and proximity sensor  1714  can be coupled to peripherals interface  1706  to facilitate orientation, lighting, and proximity functions of the mobile device. Location processor  1715  (e.g., GPS receiver) can be connected to peripherals interface  1706  to provide geopositioning. Electronic magnetometer  1716  (e.g., an integrated circuit chip) can also be connected to peripherals interface  1706  to provide data that can be used to determine the direction of magnetic North. Thus, electronic magnetometer  1716  can be used as an electronic compass. Motion sensor  1710  can include one or more accelerometers configured to determine change of speed and direction of movement of the mobile device. Barometer  1717  can include one or more devices connected to peripherals interface  1706  and configured to measure pressure of atmosphere around the mobile device. 
     Camera subsystem  1720  and an optical sensor  1722 , e.g., a charged coupled device (CCD) or a complementary metal-oxide semiconductor (CMOS) optical sensor, can be utilized to facilitate camera functions, such as recording photographs and video clips. 
     Communication functions can be facilitated through one or more wireless communication subsystems  1724 , which can include radio frequency receivers and transmitters and/or optical (e.g., infrared) receivers and transmitters. The specific design and implementation of the communication subsystem  1724  can depend on the communication network(s) over which a mobile device is intended to operate. For example, a mobile device can include communication subsystems  1724  designed to operate over a GSM network, a GPRS network, an EDGE network, a Wi-Fi™ or WiMax™ network, and a Bluetooth™ network. In particular, the wireless communication subsystems  1724  can include hosting protocols such that the mobile device can be configured as a base station for other wireless devices. 
     Audio subsystem  1726  can be coupled to a speaker  1728  and a microphone  1730  to facilitate voice-enabled functions, such as voice recognition, voice replication, digital recording, and telephony functions. Audio subsystem  1726  can be configured to receive voice commands from the user. 
     I/O subsystem  1740  can include touch screen controller  1742  and/or other input controller(s)  1744 . Touch-screen controller  1742  can be coupled to a touch screen  1746  or pad. Touch screen  1746  and touch screen controller  1742  can, for example, detect contact and movement or break thereof using any of a plurality of touch sensitivity technologies, including but not limited to capacitive, resistive, infrared, and surface acoustic wave technologies, as well as other proximity sensor arrays or other elements for determining one or more points of contact with touch screen  1746 . 
     Other input controller(s)  1744  can be coupled to other input/control devices  1748 , such as one or more buttons, rocker switches, thumb-wheel, infrared port, USB port, and/or a pointer device such as a stylus. The one or more buttons (not shown) can include an up/down button for volume control of speaker  1728  and/or microphone  1730 . 
     In one implementation, a pressing of the button for a first duration may disengage a lock of the touch screen  1746 ; and a pressing of the button for a second duration that is longer than the first duration may turn power to mobile device  106  on or off. The user may be able to customize a functionality of one or more of the buttons. The touch screen  1746  can, for example, also be used to implement virtual or soft buttons and/or a keyboard. 
     In some implementations, mobile device  106  can present recorded audio and/or video files, such as MP3, AAC, and MPEG files. In some implementations, mobile device  106  can include the functionality of an MP3 player. Mobile device  106  may, therefore, include a pin connector that is compatible with the iPod. Other input/output and control devices can also be used. 
     Memory interface  1702  can be coupled to memory  1750 . Memory  1750  can include high-speed random access memory and/or non-volatile memory, such as one or more magnetic disk storage devices, one or more optical storage devices, and/or flash memory (e.g., NAND, NOR). Memory  1750  can store operating system  1752 , such as Darwin, RTXC, LINUX, UNIX, OS X, WINDOWS, or an embedded operating system such as VxWorks. Operating system  1752  may include instructions for handling basic system services and for performing hardware dependent tasks. In some implementations, operating system  1752  can include a kernel (e.g., UNIX kernel). 
     Memory  1750  may also store communication instructions  1754  to facilitate communicating with one or more additional devices, one or more computers and/or one or more servers. Memory  1750  may include graphical user interface instructions  1756  to facilitate graphic user interface processing; sensor processing instructions  1758  to facilitate sensor-related processing and functions; phone instructions  1760  to facilitate phone-related processes and functions; electronic messaging instructions  1762  to facilitate electronic-messaging related processes and functions; web browsing instructions  1764  to facilitate web browsing-related processes and functions; media processing instructions  1766  to facilitate media processing-related processes and functions; GPS/Navigation instructions  1768  to facilitate GPS and navigation-related processes and instructions; camera instructions  1770  to facilitate camera-related processes and functions; magnetometer data  1772  and calibration instructions  1774  to facilitate magnetometer calibration. The memory  1750  may also store other software instructions (not shown), such as security instructions, web video instructions to facilitate web video-related processes and functions, and/or web shopping instructions to facilitate web shopping-related processes and functions. In some implementations, the media processing instructions  1766  are divided into audio processing instructions and video processing instructions to facilitate audio processing-related processes and functions and video processing-related processes and functions, respectively. An activation record and International Mobile Equipment Identity (IMEI) or similar hardware identifier can also be stored in memory  1750 . Memory  1750  can include venue location instructions  1776  that can be used to request location fingerprint data and determine a location of the mobile device when the mobile device is at a venue, e.g., inside of a building where GPS signals are unavailable. 
     Each of the above identified instructions and applications can correspond to a set of instructions for performing one or more functions described above. These instructions need not be implemented as separate software programs, procedures, or modules. Memory  1750  can include additional instructions or fewer instructions. Furthermore, various functions of the mobile device may be implemented in hardware and/or in software, including in one or more signal processing and/or application specific integrated circuits. 
     Exemplary Operating Environment 
       FIG. 22  is a block diagram of exemplary network operating environment  1800  for the mobile devices of  FIGS. 4-19 . Mobile devices  1802   a  and  1802   b  can, for example, communicate over one or more wired and/or wireless networks  1810  in data communication. For example, a wireless network  1812 , e.g., a cellular network, can communicate with a wide area network (WAN)  1814 , such as the Internet, by use of a gateway  1816 . Likewise, an access device  1818 , such as an 802.11g wireless access point, can provide communication access to the wide area network  1814 . 
     In some implementations, both voice and data communications can be established over wireless network  1812  and the access device  1818 . For example, mobile device  1802   a  can place and receive phone calls (e.g., using voice over Internet Protocol (VoIP) protocols), send and receive e-mail messages (e.g., using Post Office Protocol 3 (POP3)), and retrieve electronic documents and/or streams, such as web pages, photographs, and videos, over wireless network  1812 , gateway  1816 , and wide area network  1814  (e.g., using Transmission Control Protocol/Internet Protocol (TCP/IP) or User Datagram Protocol (UDP)). Likewise, in some implementations, the mobile device  1802   b  can place and receive phone calls, send and receive e-mail messages, and retrieve electronic documents over the access device  1818  and the wide area network  1814 . In some implementations, mobile device  1802   a  or  1802   b  can be physically connected to the access device  1818  using one or more cables and the access device  1818  can be a personal computer. In this configuration, mobile device  1802   a  or  1802   b  can be referred to as a “tethered” device. 
     Mobile devices  1802   a  and  1802   b  can also establish communications by other means. For example, wireless device  1802   a  can communicate with other wireless devices, e.g., other mobile devices, cell phones, etc., over the wireless network  1812 . Likewise, mobile devices  1802   a  and  1802   b  can establish peer-to-peer communications  1820 , e.g., a personal area network, by use of one or more communication subsystems, such as the Bluetooth™ communication devices. Other communication protocols and topologies can also be implemented. 
     The mobile device  1802   a  or  1802   b  can, for example, communicate with one or more services  1830  and  1840  over the one or more wired and/or wireless networks. For example, one or more location services  1830  can conduct surveys of venues, generate location fingerprint data for each venue, and provide the location fingerprint data to mobile device  1802   a  or  1802   b . Map service  1840  can, for example, provide maps of venues, e.g., maps of structures of buildings to mobile device  1802   a  or  1802   b.    
     Mobile device  1802   a  or  1802   b  can also access other data and content over the one or more wired and/or wireless networks. For example, content publishers, such as news sites, Really Simple Syndication (RSS) feeds, web sites, blogs, social networking sites, developer networks, etc., can be accessed by mobile device  1802   a  or  1802   b . Such access can be provided by invocation of a web browsing function or application (e.g., a browser) in response to a user touching, for example, a Web object. 
     A number of implementations of the invention have been described. Nevertheless, it will be understood that various modifications can be made without departing from the spirit and scope of the invention. For example, the number of sub-propagation steps between observation updates can vary on successive tries. For example, when some candidate locations are blocked by constraints to movement, the state space estimator may use 10 sub-propagation steps, each for a time period ΔT/10, to find alternative routes. In the next try, the state space estimator may use 30 sub-propagation steps, each for a time period ΔT/30, to find alternative routes, and so forth. The number of sub-propagation steps between observation updates can vary depending on the complexity of the venue. For example, in an open space, the state space estimator may use 10 sub-propagation steps, each for a time period ΔT/10, between observation updates, and in an office building having complex hallways, the state space estimator may use 50 sub-propagation steps, each for a time period ΔT/50, between observation updates. The location fingerprint database may include information about the complexity of constraints of movement at various locations in the venue, such that when the mobile device travels to a region in the venue, the mobile device may select the number of sub-propagation steps suitable for that particular venue. 
     The mobile device may keep a record of the locations where particle depletion occurred or where some candidate locations were blocked by constraints to movement, so that the next time the mobile device travels to these locations, the state space estimator can automatically increase the noise level or increase the number of discretized propagation steps between observation updates to allow exploration of a wider range of alternative propagation routes for the candidate locations. The particle filter engine  118  ( FIG. 4 ) can be replaced with other types of location estimators that use state space models. The sensors  114  can sense environment variables other than those described above. 
     Reducing the impact of hard limit constraints on state space models to improve location estimates is not limited to mobile devices that can be carried by a pedestrian. Other types of machines can also perform reduction of the impact of hard limit constraints on state space models in order to navigate around the constraints to movement. For example, a robot may reduce the impact of hard limit constraints on state space models using the processes described above as it moves around a venue. Accordingly, other implementations are within the scope of the following claims.

Metadata:
Filing Date: 20121130
Publication Date: 20150331
Grant Date: 20150331
Priority Date: 20121130
Inventors: MARTI LUKAS M.
MA SHANNON M.
Assignee: APPLE INC
CPC Classifications: [{"code": "G01S5/0252", "inventive": true, "first": true, "tree": "[]"}, {"code": "G01C21/3896", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0278", "inventive": true, "first": true, "tree": "[]"}, {"code": "G01S5/02521", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/02521", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0252", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0294", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01C21/00", "inventive": true, "first": true, "tree": "[]"}, {"code": "G01S5/0278", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0278", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0294", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0294", "inventive": true, "first": false, "tree": "[]"}, {"code": "G01S5/0252", "inventive": true, "first": true, "tree": "[]"}, {"code": "G01C21/3896", "inventive": true, "first": false, "tree": "[]"}]
Family ID: 49766154