Reasoning with uncertainties over existence of objects

AAAI Fall Symposium - Technical Report

Volumn FS-13-02, Issue , 2013, Pages 120-125

  Vien, Ngo Anh ^a   Toussaint, Marc ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; NEURAL NETWORKS;

DYNAMIC BAYESIAN NETWORKS; INFERENCE METHODS; PLANNING PROBLEM; REASONING WITH UNCERTAINTY; REJECTION SAMPLINGS; REVERSIBLE-JUMP MCMC; TIME SLICE;

MARKOV PROCESSES;

EID: 84898871269     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. B.-N, V., and Ma, W.-K. 2005. A closed-form solution for the probability hypothesis density filter. In Proc. Int'l Conf. on Information Fusion, volume 2, 25-28.
2. B.-N, V.; S., S.; and A., D. 2003. Sequential monte carlo implementation of the PHD filter for multi-target tracking. In Proc. Int'l Conf. on Information Fusion, 792799.
3. Beal, M. J.; Ghahramani, Z.; and Rasmussen, C. E. 2001. The infinite hidden Markov model. In NIPS, 577-584.
4. Carbonetto, P.; Kisynski, J.; de Freitas, N.; and Poole, D. 2005. Nonparametric Bayesian logic. In UAI, 85-93.
5. Doshi, F.; Wingate, D.; Tenenbaum, J. B.; and Roy, N. 2011. Infinite dynamic Bayesian networks. In ICML, 913-920.
6. Doshi-Velez, F. 2009. The infinite partially observable Markov decision process. In NIPS, 477-485.
7. Gael, J. V.; Teh, Y. W.; and Ghahramani, Z. 2008. The infinite factorial hidden Markov model. In NIPS, 1697-1704.
8. Goodman, N. D.; Mansinghka, V. K.; Roy, D. M.; Bonawitz, K.; and Tenenbaum, J. B. 2008. Church: a language for generative models. In UAI, 220-229.
9. Goodman, I.; Mahler, R. P. S.; and Nguyen, H. T. 1997. Mathematics of Data Fusion. Springer.
10. Green, P. J. 1995. Reversible jump Markov chain monte carlo computation and Bayesian model determination. Biometrika 82(4):711-732.
11. Griffiths, T. L., and Ghahramani, Z. 2011. The indian buffet process: An introduction and review. Journal of Machine Learning Research 12:1185-1224.
12. Hastings, W. K. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1):97-109.
13. Lang, T., and Toussaint, M. 2009. Approximate inference for planning in stochastic relational worlds. In ICML, 74.
14. Latouche, G., and Ramaswami, V. 1987. Introduction to Matrix Analytic Methods in Stochastic Modeling. Society for Industrial and Applied Mathematics.
15. Mahler, R. P. S. 2000. Technical report, Lockheed Martin Technical Monograph. An Introduction to Multisource-Multitarget Statistics and its Applications.
16. Mahler, R. P. S. 2002. An extended first-order Bayes filter for force aggregation. In SPIE Conference on Signal and Data Processing of Small Targets, volume 4729.
17. Mahler, R. P. S. 2007. PHD filters of higher order in target number. IEEE Transactions on Aerospace and Electronic Systems 43(4):1523-1543.
18. Milch, B.; Marthi, B.; Russell, S. J.; Sontag, D.; Ong, D. L.; and Kolobov, A. 2005. Blog: Probabilistic models with unknown objects. In IJCAI, 1352-1359.
19. Pasula, H. M.; Zettlemoyer, L. S.; and Kaelbling, L. P. 2007. Learning symbolic models of stochastic domains. J. Artif. Intell. Res. (JAIR) 29:309-352. (Pubitemid 47477595)
20. Sidenbladh, H. 2003. Multi-target particle filtering for the probability hypothesis density. In Proc. Int'l Conf. on Information Fusion, 279-290.
21. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2009. Abstract planning with unknown object quantities and properties. In SARA.
22. Teh, Y. W.; Jordan, M. I.; Beal, M. J.; and Blei, D. M. 2004. Sharing clusters among related groups: Hierarchical dirichlet processes. In NIPS.