Heuristic Search as Evidential Reasoning

03/27/2013
by   Othar Hansson, et al.
0

BPS, the Bayesian Problem Solver, applies probabilistic inference and decision-theoretic control to flexible, resource-constrained problem-solving. This paper focuses on the Bayesian inference mechanism in BPS, and contrasts it with those of traditional heuristic search techniques. By performing sound inference, BPS can outperform traditional techniques with significantly less computational effort. Empirical tests on the Eight Puzzle show that after only a few hundred node expansions, BPS makes better decisions than does the best existing algorithm after several million node expansions

READ FULL TEXT

page 1

page 2

page 3

page 5

page 6

page 7

page 8

page 9

research
03/20/2013

Symbolic Probabilistic Inference with Continuous Variables

Research on Symbolic Probabilistic Inference (SPI) [2, 3] has provided a...
research
03/15/2012

Bayesian Inference in Monte-Carlo Tree Search

Monte-Carlo Tree Search (MCTS) methods are drawing great interest after ...
research
03/27/2013

Defeasible Decisions: What the Proposal is and isn't

In two recent papers, I have proposed a description of decision analysis...
research
10/19/2012

Systematic vs. Non-systematic Algorithms for Solving the MPE Task

The paper continues the study of partitioning based inference of heurist...
research
10/19/2012

Value Elimination: Bayesian Inference via Backtracking Search

Backtracking search is a powerful algorithmic paradigm that can be used ...
research
11/11/2022

Understanding Approximation for Bayesian Inference in Neural Networks

Bayesian inference has theoretical attractions as a principled framework...
research
05/08/2021

Survey of Parallel A* in Rust

A* is one of the most popular Best First Search (BFS) techniques for gra...

Please sign up or login with your details

Forgot password? Click here to reset