Learning Hidden Markov Models with Geometrical Constraints

Hidden Markov models (HMMS) and partially observable Markov decision processes (POMDPS)form a useful tool for modeling dynamical systems. They are particularly useful for representing environments such as road networks and office buildings, which are typical for robot navigation and planning. The work presented here is concerned with acquiring such models. We demonstrate how domain-specific information and consaaints can be incorporated into the statistical estimation process, greatly improving the learned models in terms of the model quality, the number of iterations required for convergence and robustness to reduction in the amount of available data. We present new initialization heuristics which can be used even when the data suffers from cumulative rotational error, new update rules for the model parameters, as an instance of generalized EM, and a strategy for enforcing complete geometrical consistency in the model. Experimental results demonstrate the effectiveness of our approach for both simulated and real robot data, in traditionally hard-to-learn environments.

[1]  Reid G. Simmons,et al.  Passive Distance Learning for Robot Navigation , 1996, ICML.

[2]  Leslie Pack Kaelbling,et al.  Acting under uncertainty: discrete Bayesian models for mobile-robot navigation , 1996, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS '96.

[3]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[4]  Donald B. Rubin,et al.  Max-imum Likelihood from Incomplete Data , 1972 .

[5]  K. Mardia Statistics of Directional Data , 1972 .

[6]  David Heckerman,et al.  Learning Bayesian Networks: A Unification for Discrete and Gaussian Domains , 1995, UAI.

[7]  D. Fox,et al.  A Probabilistic Approach for Concurrent Map Acquisition and Localization for Mobile Robots , 1997 .

[8]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

[9]  Illah R. Nourbakhsh,et al.  DERVISH - An Office-Navigating Robot , 1995, AI Mag..

[10]  R. Simmons,et al.  Probabilistic Navigation in Partially Observable Environments , 1995 .

[11]  Walter L. Smith Probability and Statistics , 1959, Nature.

[12]  Hans P. Moravec,et al.  High resolution maps from wide angle sonar , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[13]  Huaiyu Zhu On Information and Sufficiency , 1997 .

[14]  Leslie Pack Kaelbling,et al.  Learning Topological Maps with Weak Local Odometric Information , 1997, IJCAI.

[15]  Reid G. Simmons,et al.  Unsupervised learning of probabilistic models for robot navigation , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[16]  L. R. Rabiner,et al.  A probabilistic distance measure for hidden Markov models , 1985, AT&T Technical Journal.

[17]  Robert Bartels,et al.  Estimation in a bidirectional mixture of von Mises distributions , 1984 .

[18]  Reid G. Simmons,et al.  Probabilistic Robot Navigation in Partially Observable Environments , 1995, IJCAI.

[19]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[20]  Leslie Pack Kaelbling,et al.  Learning models for robot navigation , 1999 .

[21]  G. McLachlan,et al.  The EM algorithm and extensions , 1996 .

[22]  Minoru Asada,et al.  Map building for a mobile robot from sensory data , 1990, IEEE Trans. Syst. Man Cybern..

[23]  E. Gumbel,et al.  The Circular Normal Distribution: Theory and Tables , 1953 .

[24]  Peter Cheeseman,et al.  A stochastic map for uncertain spatial relationships , 1988 .

[25]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.