INTRODUCTION Automatically measuring the location of a person or device for ubiquitous computing always involves the conversion of a raw measurement into a location measurement. While this process is a prepackaged part of some sensors (e.g. GPS and cell phones), researchers are often faced with making this conversion on their own as part of their efforts to deploy novel sensing technologies. This paper describes and discusses various general techniques that researchers have adopted for processing sensor readings into location measurements, emphasizing probabilistic approaches. Reasoning probabilistically is attractive because it naturally accounts for the uncertainty and ambiguity of sensor data, and a probabilistic representation is a good way to communicate uncertainty to higher level modules that exploit location. The paper concludes by advocating recursive filtering as the best general technique to use, with particle filtering having a slight advantage over the next best recursive technique, the hidden Markov model.
[1]
Samuel S. Blackman,et al.
Multiple-Target Tracking with Radar Applications
,
1986
.
[2]
Henry A. Kautz,et al.
Voronoi tracking: location estimation using sparse and noisy sensor data
,
2003,
Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).
[3]
William H. Press,et al.
Numerical recipes in C
,
2002
.
[4]
Lawrence R. Rabiner,et al.
A tutorial on hidden Markov models and selected applications in speech recognition
,
1989,
Proc. IEEE.
[5]
A.H. Haddad,et al.
Applied optimal estimation
,
1976,
Proceedings of the IEEE.
[6]
Richard O. Duda,et al.
Pattern classification and scene analysis
,
1974,
A Wiley-Interscience publication.