Near Admissible Algorithms for Multiobjective Search - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Near Admissible Algorithms for Multiobjective Search

Patrice Perny
Olivier Spanjaard

Résumé

In this paper, we propose near admissible multiobjective search algorithms to approximate, with performance guarantee, the set of Pareto optimal solution paths in a state space graph. Approximation of Pareto optimality relies on the use of an epsilon-dominance relation between vectors, significantly narrowing the set of non-dominated solutions. We establish correctness of the proposed algorithms, and discuss computational complexity issues. We present numerical experimentations, showing that approximation significantly improves resolution times in multiobjective search problems.
Fichier principal
Vignette du fichier
pub_1052_1_ECAI08.pdf (191.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01303000 , version 1 (10-07-2017)

Identifiants

Citer

Patrice Perny, Olivier Spanjaard. Near Admissible Algorithms for Multiobjective Search. 18th European Conference on Artificial Intelligence ECAI-08, Aug 2008, Patras, Greece. pp.490-494, ⟨10.3233/978-1-58603-891-5-490⟩. ⟨hal-01303000⟩
150 Consultations
130 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More