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 called optimal. Optimality implies a metric for judging solution quality, where the optimal solution is the solution with the highest quality. When path-length is the metric, we will distinguish such solutions as p-optimal.
PDF Link: /papers/88/p148-hansson.pdf
AUTHOR = "Othar Hansson
and Andy Mayer",
TITLE = "The Optimality of Satisficing Solutions",
BOOKTITLE = "Proceedings of the Fourth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-88)",
PUBLISHER = "AUAI Press",
ADDRESS = "Corvallis, Oregon",
YEAR = "1988",
PAGES = "148--157"