Add to ORKGAbstract: We consider the problem of determining a most preferred path from a start node to a goal node set in an acyclic OR-graph, given a multiattribute preference function, a multiobjective reward structure, and heuristic information about this reward structure. We present an algorithm which is shown to terminate with a most preferred path, given an admissible heuristic set. The algorithm illustrates how Artificial Intelligence techniques can be productively employed to solve multiobjective problems
Building on previous work of the authors, this paper formally defines and reviews the first approach...
Shortest Path Problems (SPP) are one of the most extensively studied problems in the fields of Artif...
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. Thes...
We consider the problem of determining a most preferred path from a start node to a goal node set in...
ABSTRACT: In this thesis we investigate path finding problems, that is, plan-ning routes from a star...
International audienceWe propose an introduction to the use of incremental preference elicita-tion m...
Heuristics have been widely used in artificial intelligence related fields including path finding. I...
The research presented in this dissertation is motivated by the problem of determining routes, from ...
International audienceThe problem investigated in this paper concerns the integration of a decision ...
In multi-criteria decision making approaches it is typical to consider an underlying preference func...
In this paper, we develop an interactive algorithm that finds the most preferred solution of a decis...
The aim of this paper is to propose a new approach interweaving preference elicitation and search to...
This dissertation is concerned with the development, analysis, and application of solution technique...
The multiobjective search model is a framework for solving multi-criteria optimization problems usin...
Multiobjective heuristic search in state space graphs generally aims at determining the exact set of...
Building on previous work of the authors, this paper formally defines and reviews the first approach...
Shortest Path Problems (SPP) are one of the most extensively studied problems in the fields of Artif...
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. Thes...
We consider the problem of determining a most preferred path from a start node to a goal node set in...
ABSTRACT: In this thesis we investigate path finding problems, that is, plan-ning routes from a star...
International audienceWe propose an introduction to the use of incremental preference elicita-tion m...
Heuristics have been widely used in artificial intelligence related fields including path finding. I...
The research presented in this dissertation is motivated by the problem of determining routes, from ...
International audienceThe problem investigated in this paper concerns the integration of a decision ...
In multi-criteria decision making approaches it is typical to consider an underlying preference func...
In this paper, we develop an interactive algorithm that finds the most preferred solution of a decis...
The aim of this paper is to propose a new approach interweaving preference elicitation and search to...
This dissertation is concerned with the development, analysis, and application of solution technique...
The multiobjective search model is a framework for solving multi-criteria optimization problems usin...
Multiobjective heuristic search in state space graphs generally aims at determining the exact set of...
Building on previous work of the authors, this paper formally defines and reviews the first approach...
Shortest Path Problems (SPP) are one of the most extensively studied problems in the fields of Artif...
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. Thes...