Some Experiments with Real-Time Decision Algorithms

02/13/2013
by   Bruce D'Ambrosio, et al.
0

Real-time Decision algorithms are a class of incremental resource-bounded [Horvitz, 89] or anytime [Dean, 93] algorithms for evaluating influence diagrams. We present a test domain for real-time decision algorithms, and the results of experiments with several Real-time Decision Algorithms in this domain. The results demonstrate high performance for two algorithms, a decision-evaluation variant of Incremental Probabilisitic Inference [D'Ambrosio 93] and a variant of an algorithm suggested by Goldszmidt, [Goldszmidt, 95], PK-reduced. We discuss the implications of these experimental results and explore the broader applicability of these algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 5

research
03/06/2013

Two Procedures for Compiling Influence Diagrams

Two algorithms are presented for "compiling" influence diagrams into a s...
research
05/02/2022

Real-Time BDI Agents: a model and its implementation

The BDI model proved to be effective for developing applications requiri...
research
11/25/2022

Efficient Incremental Text-to-Speech on GPUs

Incremental text-to-speech, also known as streaming TTS, has been increa...
research
04/30/2021

Human strategic decision making in parametrized games

Many real-world games contain parameters which can affect payoffs, actio...
research
12/16/2009

On Backtracking in Real-time Heuristic Search

Real-time heuristic search algorithms are suitable for situated agents t...
research
07/02/2020

Incremental methods for checking real-time consistency

Requirements engineering is a key phase in the development process. Ensu...
research
08/18/2021

Analogical Learning in Tactical Decision Games

Tactical Decision Games (TDGs) are military conflict scenarios presented...

Please sign up or login with your details

Forgot password? Click here to reset