Abstract
Predicting motion of humans, animals and other objects which move according to internal plans is a challenging problem. Most existing approaches operate in two stages: (a) learning typical motion patterns by observing an environment and (b) predicting future motion on the basis of the learned patterns. In existing techniques, learning is performed off-line, hence, it is impossible to refine the existing knowledge on the basis of the new observations obtained during the prediction phase. We propose an approach which uses hidden Markov models (HMMs) to represent motion patterns. It is different from similar approaches because it is able to learn and predict in a concurrent fashion thanks to a novel approximate learning approach, based on the growing neural gas algorithm, which estimates both HMM parameters and structure. The found structure has the property of being a planar graph, thus enabling exact inference in linear time with respect to the number of states in the model. Our experiments demonstrate that the technique works in real-time, and is able to produce sound long-term predictions of people motion.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bar-Shalom Y. and Fortmann T.E. (1988). Tracking and data association. No. 179 in Mathematics in science and engineering. Academic Press, Boston
Baum L.E. (1972). An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. In: Shisha, O. (eds) Inequalities III: Proceedings of the Third Symposium on Inequalities, pp. 1–8, pp. Academic Press, University of California, Los Angeles
Bennewitz M., Burgard W., Cielniak G. and Thrun S. (2005). Learning motion patterns of people for compliant robot motion. Int. J. Robot. Res. 24(1): 31–48
Bennewitz, M., Burgard, W., Thrun, S.: Learning motion patterns of persons for mobile service robots. In: Proceedings of the IEEE Int. Conf. On Robotics and Automation, pp. 3601–3606. Washington, USA (2002)
Binsztok, H., Artières, T.: Learning model structure from data: an application to on-line handwriting. Electron. Lett. Comput. Vis. Image Anal. 5(2) (2005)
Brand, M.: Structure learning in conditional probability models via an entropic prior and parameter extinction. Tech. rep., MERL a Mitsubishi Electric Research Laboratory (1998)
Brand M. (1999). Structure learning in conditional probability models via an entropic prior and parameter extinction. Neural Comput. 11(5): 1155–1182
Bui H., Venkatesh S. and West G. (2002). Policy recognition in the abstract hidden markov models. J. Artif. Intell. Res. 17: 451–499
Burlina, P., DeMenthon, D., Davis, L.S.: Navigation with uncertainty: reaching a goal in a high collision risk region. In: Proceedings of the 1992 IEEE Int. Conf. on Robotics and Automation, Nice, France (1992)
Caporossi, A., Hall, D., Reignier, P., Crowley, J.: Robust visual tracking from dynamic control of processing. In: International Workshop on Performance Evaluation of Tracking and Surveillance, pp. 23–31. Prague, Czech Republic (2004)
Chien, Y., Koivo, A.: Visual feedback to predict obstacle motion for on-line collision-free trajectory planning of cylindrical robots. In: IEEE/RSJ International Workshop on Intellingent Robots and Systems, pp. 612–618 (1989)
Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theory IT-14(3) (1968)
Dempster A., Laird N. and Rubin D. (1977). Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. Series B 9(1): 1–38
Diestel R. (2005). Graph Theory, 3rd edn. Graduate Texts in Mathematics. Springer, Heidelberg
Durbin R., Eddy S., Krogh A. and Mitchison G. (1998). Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge
Dwyer R.A. (1989). Higher-dimensional Voronoi diagrams in linear expected time. ACM Press, New York
Freitag, D., McCallum, A.: Information extraction with hmm structures learned by stochastic optimization. In: Proc. of the Seventeenth Nat. Conf. on Artificial Intelligence and Twelfth Conf. on Innovative Applications of Artificial Intelligence, pp. 584–589. AAAI Press / The MIT Press, Austin (2000)
Fritzke, B.: A growing neural gas network learns topologies. Adv. Neural Inf. Process. Systems (1995) (in press)
Fritzke, B.: Some competitive learning methods (1998). Paper Draft. URL ftp://ftp.neuroinformatik.ruhr-uni-bochum.de/pub/software/NN/DemoGNG/sclm.ps.gz
Gaffney S. and Smyth P. (1999). Trajectory clustering with mixtures of regression models. Tech. Rep. 99-15. University of Californa, Irvine
Han, K., Veloso, M.: Physical model based multi-objects tracking and prediction in robosoccer. In: Working Notes of the AAAI 1997 Fall Symposium on Model-directed Autonomous Systems, MIT, Boston (1997)
Heinke, D., Hamker, F.H.: Comparing neural networks: a benchmark on growing neural gas, growing cell structures and fuzzy artmap. IEEE Trans. Neural Netw. 9(6) (1998)
Kalman R. (1960). A new approach to linear filtering and prediction problems. Trans. Am. Soc. Mech. Eng., Series D, J. Basic Eng. 82: 35–45
Kawase, T., Tsurunosono, H., Ehara, N., Sasao, I.: Two-stage kalman estimator using advanced circular prediction for maneuvering target tracking. In: Proc. of the IEEE Int. Conf. on Acoustics, Speech and Signal Processing, pp. 2453–2456. Seattle, WA (1998)
Kruse, E., Gusche, R., Wahl, F.M.: Acquisition of statistical motion patterns in dynamic environments and their application to mobile robot motion planning. In: Proceedings of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 713–717. Grenoble, France (1997)
Kruse, E., Gutsche, R., Wahl, F.: Estimation of collision probabilities in dynamic environments for path planning with minimum collision probability. In: Proceedings of IROS, pp. 1288–1295 (1996)
Liu, P.X., Meng, M., Hu, C.: Online data-driven fuzzy clustering with applications to real-time robotic tracking. In: Proceedings of the IEEE Int. Conf. On Robotics and Automation. New Orleans, LO (2004)
Marsland, S., Shapiro, J., Nehmzow, U.: A self-organizing network that grows when required. Neural Netw. (2002) (in press)
Murphy, K.P.: Dynamic bayesian networks: Representation, inference and learning. Ph.D. thesis, University of California, Berkeley (2002)
Nam, Y.S., Lee, B.H., Kim, M.S.: View-time based moving obstacle avoidance using stochastic prediction of obstacle motion. In: Proceedings of the 1996 IEEE Int. Conf. on Robotics and Automation, Minneapolis (1996)
Neal R.M. and Hinton G.E. (1998). A new view of the EM algorithm that justifies incremental, sparse and other variants. In: Jordan, M.I. (eds) Learning in Graphical Models, pp. 355–368, pp. Kluwer, Dordrecht
Osentoski, S., Manfredi, V., Mahadevan, S.: Learning hierarchical models of activity. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai (2004)
Rabiner, L.R.: A tutorial on hidden markov models and selected applications in speech recognition. In: Readings in Speech Recognition, pp. 267–296 (1990)
Reif, J., Sharir, M.: Motion planning in the presence of moving obstacles. In: Symp. on the Foundations of Computer Science, pp. 144–154, Portland (1985)
Singer, Y., Warmuth, M.K.: Training algorithms for hidden markov models using entropy based distance functions. In: Advances in Neural Information Processing Systems, vol. 9, NIPS, pp. 641–647. MIT Press, Denver (1996)
Stolcke A. and Omohundro S. (1993). Hidden markov model induction by bayesian model merging. In: Hanson, S.J., Cowan, J.D. and Giles, C.L. (eds) Advances in Neural Information Processing Systems, vol. 5, pp 11–18. Morgan Kaufmann, Morgan
Tadokoro, S., Hayashi, M., Manabe, Y., Nakami, Y., Takamori, T.: Motion planner of mobile robots which avoid moving human obstacles on the basis of stochastic prediction. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 3286–3291 (1995)
Vasquez, D., Fraichard, T.: Motion prediction for moving objects: a statistical approach. In: Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 3931–3936. New Orleans (2004)
Viterbi A.J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory IT- 13(2): 260–269
Won K.J., Prügel-Bennet A. and Krogh A. (2004). Training hmm structure with genetic algorithm for biological sequence analysis. Bioinformatics 20(18): 3613–3619
Zhang Z. (2000). A flexible new technique for camera calibration. IEEE Trans. Pattern Anal. Mach. Intell. 22(11): 1330–1334
Zhu, Q.: A stochastic algorithm for obstacle motion prediction in visual guidance of robot motion. In: The IEEE International Conference on Systems Engineering, pp. 216–219 (1990)
Zhu Q. (1991). Hidden markov model for dynamic obstacle avoidance of mobile robot navigation. IEEE Trans. Robot. Autom. 7: 390–397
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Vasquez, D., Fraichard, T., Aycard, O. et al. Intentional motion on-line learning and prediction. Machine Vision and Applications 19, 411–425 (2008). https://doi.org/10.1007/s00138-007-0116-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00138-007-0116-9