A heuristic search algorithm with lexicographic goals
This paper describes a new general algorithm for graph search problems with additive lexicographic goals. The use of lexicographic goals in the formulation of search problems provides greater control and expressive power over the properties of solution paths. The algorithm, called METAL-A(N)* can be used to find the set of all solutions to a goal problem. The fundamental concepts of the algorithm are explained and a simple example is used to trace its behaviour. Sufficient conditions that guarantee the completeness and admissibility of METAL-A(N)* are also presented. (C) 2002 Elsevier Science Ltd. All rights reserved.
heuristic search lexicographic goals multicriteria decision theory goal satisfaction