A Monte-Carlo Algorithm for Dempster-Shafer Belief

03/20/2013
by   Nic Wilson, et al.
0

A very computationally-efficient Monte-Carlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster's Rule of belief functions Bel, ..., Bel,7, then, for subset b of the frame C), Bel(b) can be calculated in time linear in 1(31 and m (given that the weight of conflict is bounded). The algorithm can also be used to improve the complexity of the Shenoy-Shafer algorithms on Markov trees, and be generalised to calculate Dempster-Shafer Belief over other logics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2013

Rules, Belief Functions and Default Logic

This paper describes a natural framework for rules, based on belief func...
research
11/14/2022

Monte Carlo Planning in Hybrid Belief POMDPs

Real-world problems often require reasoning about hybrid beliefs, over b...
research
10/05/2021

Deep Synoptic Monte Carlo Planning in Reconnaissance Blind Chess

This paper introduces deep synoptic Monte Carlo planning (DSMCP) for lar...
research
03/15/2012

Rollout Sampling Policy Iteration for Decentralized POMDPs

We present decentralized rollout sampling policy iteration (DecRSPI) - a...
research
03/20/2013

Structuring Bodies of Evidence

In this article we present two ways of structuring bodies of evidence, w...
research
04/15/2019

Cooperation on the monte carlo rule Prison's dilemma game on the grid

In this paper, we investigate the prison's dilemma game with monte carlo...
research
12/04/2019

Accelerating Surface Tension Calculation in SPH via Particle Classification Monte Carlo Integration

Surface tension has a strong influence on the shape of fluid interfaces....

Please sign up or login with your details

Forgot password? Click here to reset