The Optimality of Satisficing Solutions
Artificial Intelligence
2013-04-10 v1
Abstract
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.
Cite
@article{arxiv.1304.2356,
title = {The Optimality of Satisficing Solutions},
author = {Othar Hansson and Andy Mayer},
journal= {arXiv preprint arXiv:1304.2356},
year = {2013}
}
Comments
Appears in Proceedings of the Fourth Conference on Uncertainty in Artificial Intelligence (UAI1988)