19 citations · 22 across the 2 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2018
A New Result on the Complexity of Heuristic Estimates for the A* Algorithm
Othar Hansson, Andrew Mayer, Marco Valtorta
Relaxed models are abstract problem descriptions generated by ignoring constraints that are present in base-level problems. They play an important role in planning and search algor…
cs.AI2013★ 3 cited
The Optimality of Satisficing Solutions
Othar Hansson, Andy Mayer
This paper addresses a prevailing assumption in single-agent heuristic search theory- that problem-solving algorithms should guarantee shortest-path solutions, which are typically…
cs.AI2013★ 19 cited
Heuristic Search as Evidential Reasoning
Othar Hansson, Andy Mayer
BPS, the Bayesian Problem Solver, applies probabilistic inference and decision-theoretic control to flexible, resource-constrained problem-solving. This paper focuses on the Bayesi…