Multiobjektive Heuristic Search in AND/OR Graphs

The multiobjective search model is a framework for solving multi-criteria optimization problems using heuristic search techniques. In this framework, the different non-commensurate optimization criteria are mapped into distinct dimensions of a vector valued cost structure and partial order search techniques are used to determine the set of non-inferior solutions. Multiobjective state space search has been studied and generalizations of algorithms such asA* to the multiobjective framework have been considered. In this paper we address the problem of multiobjective heuristic (best-first) search of acyclic additive AND/OR graphs. We establish two results which show that in the multiobjective framework, the task of identifying a non-dominated cost potential solution graph is NP-hard in general. This indicates that by extending popular AND/OR graph search algorithms such asAO* to the multiobjective framework we will not be able to preserve some of their desirable properties. Under such circumstances, we investigate the task of developing effective algorithms for the multiobjective problem and present a linear space AND/OR graph search algorithm calledMObj*. Upper bounds on time and space complexities of this algorithm have been presented. It has also been established that when applied to OR graphs, the proposed algorithm is superior to the algorithm proposed by Stewart and White (MultiobjectiveA*,J. Assoc. Comput. Mech.38, No. 4 (1991), 775?814) in terms of the worst case set of nodes expanded.

[1]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[2]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[3]  Matthijs Kok,et al.  The interface with decision makers and some experimental results in interactive multiple objective programming methods , 1986 .

[4]  Jean-Claude Vansnick.  On the problem of weights in multiple criteria decision making (the noncompensatory approach) , 1986 .

[5]  P. P. Chakrabarti,et al.  Heuristic Search in Restricted Memory , 1989, Artif. Intell..

[6]  P. P. Chakrabarti,et al.  Admissibility of A0* when Heuristics Overestimate , 1987, Artif. Intell..

[7]  P. P. Chakrabarti,et al.  Generalized best first search using single and multiple heuristics , 1992, Inf. Sci..

[8]  A. Bagchi,et al.  AND/OR graph heuristic search methods , 1985, JACM.

[9]  Peter Bogetoft,et al.  General communication schemes for multiobjective decision making , 1986 .

[10]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

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

[12]  Alberto Martelli,et al.  Optimizing decision trees through heuristically guided search , 1978, CACM.

[13]  David Gelperin,et al.  The optimality of A , 1988 .

[14]  Jyrki Wallenius,et al.  A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems , 1986, Oper. Res..

[15]  B. Mond,et al.  Interactive weight assessment in multiple attribute decision making , 1985 .

[16]  B. Stewart.  Heuristic search with a general order relation , 1988 .

[17]  Pekka Korhonen.  A hierarchical interactive method for ranking alternatives with multiple qualitative criteria , 1986 .

[18]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[19]  László Méro,et al.  A Heuristic Search Algorithm with Modifiable Estimate , 1984, Artif. Intell..

[20]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  A. Bagchi,et al.  Search Algorithms Under Different Kinds of Heuristics—A Comparative Study , 1983, JACM.

[22]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..