A new approach to multiobjective A* search

Authors:
J. L. P´erez De la Cruz;J. L. P´erez De la Cruz;L. Mandow;L. Mandow
Affiliations:
Dpto. Lenguajes y Ciencias de la Universidad de M´alaga 29071 - M´alaga, Spain;Dpto. Lenguajes y Ciencias de la Universidad de M´alaga 29071 - M´alaga, Spain;Dpto. Lenguajes y Ciencias de la Universidad de M´alaga 29071 - M´alaga, Spain;Dpto. Lenguajes y Ciencias de la Universidad de M´alaga 29071 - M´alaga, Spain
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 5
Cited 17

Generalized best-first search strategies and the optimality of A*

Journal of the ACM (JACM)
Multiobjective A*

Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
Optimal paths in graphs with stochastic or multidimensional weights

Communications of the ACM
On preference-based search in state space graphs

Eighteenth national conference on Artificial intelligence

Search for Compromise Solutions in Multiobjective State Space Graphs

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Frontier Search for Bicriterion Shortest Path Problems

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Near Admissible Algorithms for Multiobjective Search

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Cost-algebraic heuristic search

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
A multiobjective frontier search algorithm

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
State space search for risk-averse agents

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Multiobjective A* search with consistent heuristics

Journal of the ACM (JACM)
A memory-efficient search strategy for multiobjective shortest path problems

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
A note on the complexity of some multiobjective A* search algorithms

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
An empirical comparison of some multiobjective graph search algorithms

KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Decision making with multiple objectives using GAI networks

Artificial Intelligence
Heuristic multiobjective search for hazmat transportation problems

CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Comparison of heuristics in multiobjective a* search

CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
An analysis of multiobjective search algorithms and heuristics

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Dominance rules for the choquet integral in multiobjective dynamic programming

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem

Applied Soft Computing
A case of pathology in multiobjective heuristic search

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new algorithm for multiobjective heuristic graph search problems. The algorithm presents some nice properties that are easily proven. Additionally, empirical tests show that substantial savings in memory can be achieved over previous proposals.