• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Search for Compromise Solutions in Multiobjective State Space Graphs

Galand, Lucie; Perny, Patrice (2006), Search for Compromise Solutions in Multiobjective State Space Graphs, in Traverso, Paolo, Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), IOS Press : Tokyo, p. 93-97

View/Open
compromise_galand.PDF (111.9Kb)
Type
Communication / Conférence
Date
2006
Conference country
ITALY
Book title
Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006)
Book author
Traverso, Paolo
Publisher
IOS Press
Published in
Tokyo
ISBN
1-58603-642-4
Pages
93-97
Metadata
Show full item record
Author(s)
Galand, Lucie
Perny, Patrice
Abstract (EN)
The aim of this paper is to introduce and solve new search problems in multiobjective state space graphs. Although most of the studies concentrate on the determination of the entire set of Pareto optimal solution paths, the size of which can be, in worst case, exponential in the number of nodes, we consider here more specialized problems where the search is focused on Pareto solutions achieving a well-balanced compromise between the conflicting objectives. After introducing a formal definition of the compromise search problem, we discuss computational issues and the complexity of the problem. Then, we introduce two algorithms to find the best compromise solution-paths in a state space graph. Finally, we report various numerical tests showing that, as far as compromise search is concerned, both algorithms are very efficient (compared to MOA*) but they present contrasted advantages discussed in the conclusion.
Subjects / Keywords
space graphs; algorithms

Related items

Showing items related by title and author.

  • Thumbnail
    Bidirectional Preference-based Search for Multiobjective State Space Graph Problems 
    Galand, Lucie; Ismaili, Anisse; Perny, Patrice; Spanjaard, Olivier (2013) Communication / Conférence
  • Thumbnail
    Bidirectional versus Unidirectional Heuristic Search for Multiojective Optimization in State Space Graphs 
    Galand, Lucie; Ismaili, Anisse; Perny, Patrice; Spanjaard, Olivier (2013) Communication / Conférence
  • Thumbnail
    Interactive Search for Compromise Solutions in Multicriteria Graph Problems 
    Galand, Lucie (2006) Communication / Conférence
  • Thumbnail
    Dominance Rules for the Choquet Integral in Multiobjective Dynamic Programming 
    Galand, Lucie; Lesca, Julien; Perny, Patrice (2013) Communication / Conférence
  • Thumbnail
    OWA-Based Search in State Space Graphs with Multiple Cost Functions 
    Galand, Lucie; Spanjaard, Olivier (2007) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo