The Optimality of Satisficing Solutions
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
Text
Hansson and Mayer. "The Optimality of Satisficing Solutions." Conference on Uncertainty in Artificial Intelligence, 1988.Markdown
[Hansson and Mayer. "The Optimality of Satisficing Solutions." Conference on Uncertainty in Artificial Intelligence, 1988.](https://mlanthology.org/uai/1988/hansson1988uai-optimality/)BibTeX
@inproceedings{hansson1988uai-optimality,
title = {{The Optimality of Satisficing Solutions}},
author = {Hansson, Othar and Mayer, Andy},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1988},
url = {https://mlanthology.org/uai/1988/hansson1988uai-optimality/}
}