Optimal satisficing tree searches

Authors:
Dan Geiger;Jeffrey A. Barnett
Affiliations:
Northrop Research and Technology Center, Palos Verdes, CA;Northrop Research and Technology Center, Palos Verdes, CA
Venue:
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Year:
1991

Citing 1
Cited 1

An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions

Journal of the ACM (JACM)

Finding optimal satisficing strategies for and-or trees

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an algorithm that finds optimal search strategies for AND trees and OR trees. Our model includes three outcomes when a node is explored: (1) finding a solution, (2) not finding a solution and realizing that there are no solutions beneath the current node (pruning), and (3) not finding a solution but not pruning the nodes below. The expected cost of examining a node and the probabilities of the three outcomes are given. Based on this input, the algorithm generates an order that minimizes the expected search cost.