论文信息 - A Multiobjective Frontier Search Algorithm

A Multiobjective Frontier Search Algorithm

The paper analyzes the extension of frontier search to the multiobjective framework. A frontier multiobjective A* search algorithm is developed, some formal properties are presented, and its performance is compared to those of other multiobjective search algorithms. The new algorithm is adequate for both monotone and non-monotone heuristics.

Lawrence Mandow | José-Luis Pérez-de-la-Cruz

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

[2] Richard E. Korf,et al. Iterative-Deepening-A*: An Optimal Admissible Tree Search , 1985, IJCAI.

[3] Lawrence Mandow,et al. A New Approach to Multiobjective A* Search , 2005, IJCAI.

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

[5] Ioannis P. Vlahavas,et al. Multiobjective heuristic state-space planning , 2003, Artif. Intell..

[6] Brian Logan,et al. State Space Search with Prioritised Soft Constraints , 2004, Applied Intelligence.

[7] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[8] James F. Annett. Vieweg, Braunschweig/Wiesbaden 1999 , 1999 .

[9] Richard E. Korf,et al. Linear-Space Best-First Search , 1993, Artif. Intell..

[10] J. Schmidhuber,et al. Frontier Search , 2009 .

[11] Pallab Dasgupta,et al. Multiobjective Heuristic Search , 1999, Computational Intelligence.

[12] Shashi Kumar,et al. Iterative Deepening Multiobjective A , 1996, Inf. Process. Lett..

[13] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.