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. r 2002 Elsevier Science Ltd. All rights reserved.

[1]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[5]  Sang M. Lee,et al.  Goal programming for decision analysis , 1972 .

[6]  Chelsea C. White,et al.  Multiobjective intelligent computer-aided design , 1991, IEEE Trans. Syst. Man Cybern..

[7]  H. Pastijn.  Handbook of critical issues in goal programming: Carlos Romero Pergamon Press, Oxford, 1990, xi + 124 pages, £25.00, ISBN 008 0406610 , 1992 .

[8]  Francisco Ruiz,et al.  Advances in Multiple Objective and Goal Programming , 1997 .

[9]  John S. Gero,et al.  Artificial Intelligence in Design ’00 , 2000, Springer Netherlands.

[10]  H. Van Dyke Parunak.  Book review: Exploration and Innovation in Design: Towards a Computational Model By D. Navinchandra (Springer Verlag, 1991) , 1992 .

[11]  Javier Gonzalez,et al.  Mobile robot path planning: a multicriteria approach , 1999 .

[12]  RaphaelBertram,et al.  Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972 .

[13]  A. Charnes,et al.  Management Models and Industrial Applications of Linear Programming , 1961 .

[14]  D. Navinchandra.  Exploration and Innovation in Design: Towards a Computational Model , 1990 .

[15]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[16]  L. Mandow,et al.  Goal Programming and Heuristic Search , 1997 .

[17]  Alan K. Mackworth,et al.  Exploration and Innovation in Design , 1991, Symbolic Computation.

[18]  H. Moskowitz,et al.  Generalized dynamic programming for multicriteria optimization , 1990 .

[19]  H. Simon,et al.  A Behavioral Model of Rational Choice , 1955 .

[20]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[21]  Lawrence Mandow,et al.  The Role of Multicriteria Problem Solving in Design , 2000, AID.

[22]  Chelsea C. White,et al.  Multiobjective A* , 1991, JACM.

[23]  H. Simon,et al.  Rational choice and the structure of the environment. , 1956, Psychological review.