On preference-based search in state space graphs

Authors:
Patrice Perny;Olivier Spanjaard
Affiliations:
LIP6 - University of Paris VI, 4 Place Jussieu, 75252 Paris Cedex 05, France;LAMSADE - University of Paris IX, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 12
Cited 6

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Multiobjective A*

Journal of the ACM (JACM)
Searching game trees under a partial order

Artificial Intelligence
Refinements of the maximin approach to decision-making in a fuzzy environment

Fuzzy Sets and Systems - Special issue on fuzzy optimization
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
A* with bounded costs

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An axiomatic treatment of three qualitative decision criteria

Journal of the ACM (JACM)
Partial order bounding: a new approach to evaluation in game tree search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Efficient information gathering on the Internet

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the axiomatization of qualitative decision criteria

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of 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
A new approach to multiobjective A* search

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiobjective A* search with consistent heuristics

Journal of the ACM (JACM)
An axiomatic approach to robustness in search problems with multiple scenarios

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Some representation and computational issues in social choice

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A case of pathology in multiobjective heuristic search

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to introduce a general framework for preference-based search in state space graphs with a focus on the search of the preferred solutions. After introducing a formal definition of preference-based search problems, we introduce the PBA* algorithm, a generalization of the A* algorithm, designed to process quasi-transitive preference relations defined over the set of solutions. Then, considering a particular subclass of preference structures characterized by two axioms called Weak Preadditivity and Monotonicity, we establish termination, completeness and admissibility results for PBA*. We also show that previous generalizations of A* are particular instances of PBA*. The interest of our algorithm is illustrated on a preference-based web access problem.