Near Admissible Algorithms for Multiobjective Search

Patrice Perny 1 Olivier Spanjaard 1
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01303000
Contributor : Lip6 Publications <>
Submitted on : Monday, July 10, 2017 - 5:56:18 PM
Last modification on : Thursday, March 21, 2019 - 2:19:26 PM
Document(s) archivé(s) le : Wednesday, January 24, 2018 - 6:03:11 PM

File

pub_1052_1_ECAI08.pdf
Files produced by the author(s)

Identifiers

Citation

Patrice Perny, Olivier Spanjaard. Near Admissible Algorithms for Multiobjective Search. 18th European Conference on Artificial Intelligence ECAI-08, Aug 2008, Patras, Greece. IOS Press, 18th European Conference on Artificial Intelligence ECAI-08, 178, pp.490-494, Frontiers in Artificial Intelligence and Applications. 〈10.3233/978-1-58603-891-5-490〉. 〈hal-01303000〉

Share

Metrics

Record views

163

Files downloads

66