Search Results for author:
Found 3 papers, 0 papers with code
A New Result on the Complexity of Heuristic Estimates for the A* Algorithm
In this paper, we review the traditional definition of problem relaxation and show that searching in the abstraction hierarchy created by problem relaxation will not reduce the computational effort required to find optimal solutions to the base- level problem, unless the relaxed problem found in the hierarchy can be transformed by some optimization (e. g., subproblem factoring).
The Optimality of Satisficing Solutions
This paper addresses a prevailing assumption in single-agent heuristic search theory- that problem-solving algorithms should guarantee shortest-path solutions, which are typically called optimal.
Heuristic Search as Evidential Reasoning
BPS, the Bayesian Problem Solver, applies probabilistic inference and decision-theoretic control to flexible, resource-constrained problem-solving.
