The Optimality of Satisficing Solutions

03/27/2013
by   Othar Hansson, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset