%0 Journal Article %1 citeulike:777801 %A Sanghai, Sumit %A Domingos, Pedro %A Weld, Daniel %D 2005 %J Journal of Artificial Intelligence Research %K bayesian proj:o4p relational toread %P 759--797 %T Relational Dynamic Bayesian Networks %U http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume24/sanghai05a.pdf %V 24 %X Stochastic processes that involve the creation of objects and relations over time are widespread, but relatively poorly studied. For example, accurate fault diagnosis in factory assembly processes requires inferring the probabilities of erroneous assembly operations, but doing this efciently and accurately is difcult. Modeled as dynamic Bayesian networks, these processes have discrete variables with very large domains and extremely high dimensionality. In this paper, we introduce relational dynamic Bayesian networks (RDBNs), which are an extension of dynamic Bayesian networks (DBNs) to rst-order logic. RDBNs are a generalization of dynamic probabilistic relational models (DPRMs), which we had proposed in our previous work to model dynamic uncertain domains. We rst extend the Rao-Blackwellised particle ltering described in our earlier work to RDBNs. Next, we lift the assumptions associated with Rao-Blackwellization in RDBNs and propose two new forms of particle ltering. The rst one uses abstraction hierarchies over the predicates to smooth the particle lter's estimates. The second employs kernel density estimation with a kernel function specically designed for relational domains. Experiments show these two methods greatly outperform standard particle ltering on the task of assembly plan execution monitoring.

@article{citeulike:777801, abstract = {Stochastic processes that involve the creation of objects and relations over time are widespread, but relatively poorly studied. For example, accurate fault diagnosis in factory assembly processes requires inferring the probabilities of erroneous assembly operations, but doing this efciently and accurately is difcult. Modeled as dynamic Bayesian networks, these processes have discrete variables with very large domains and extremely high dimensionality. In this paper, we introduce relational dynamic Bayesian networks (RDBNs), which are an extension of dynamic Bayesian networks (DBNs) to rst-order logic. RDBNs are a generalization of dynamic probabilistic relational models (DPRMs), which we had proposed in our previous work to model dynamic uncertain domains. We rst extend the Rao-Blackwellised particle ltering described in our earlier work to RDBNs. Next, we lift the assumptions associated with Rao-Blackwellization in RDBNs and propose two new forms of particle ltering. The rst one uses abstraction hierarchies over the predicates to smooth the particle lter's estimates. The second employs kernel density estimation with a kernel function specically designed for relational domains. Experiments show these two methods greatly outperform standard particle ltering on the task of assembly plan execution monitoring.}, added-at = {2008-01-12T12:39:53.000+0100}, author = {Sanghai, Sumit and Domingos, Pedro and Weld, Daniel}, biburl = {https://www.bibsonomy.org/bibtex/28b34c18e7a6193030ab8d0a95b907faa/wnpxrz}, citeulike-article-id = {777801}, description = {CiteULike: Relational Dynamic Bayesian Networks}, interhash = {0064c70c150d38e93591a753ea9dfb13}, intrahash = {8b34c18e7a6193030ab8d0a95b907faa}, journal = {Journal of Artificial Intelligence Research}, keywords = {bayesian proj:o4p relational toread}, pages = {759--797}, priority = {4}, timestamp = {2008-01-12T12:39:53.000+0100}, title = {Relational Dynamic Bayesian Networks}, url = {http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume24/sanghai05a.pdf}, volume = 24, year = 2005 }