Result: Pareto optimization of temporal decisions

Title:
Pareto optimization of temporal decisions
Authors:
KHATIB, Lina, MORRIS, Paul, MORRIS, Robert
Source:
Abstraction, reformulation, and approximation (Kananaskis AB, 2-4 August 2002)Lecture notes in computer science. :116-125
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Résolution de problèmes, jeux, Problem solving, game playing, Fonction objectif, Objective function, Función objetivo, Optimisation sous contrainte, Constrained optimization, Optimización con restricción, Optimum Pareto, Pareto optimum, Optimo Pareto, Planification, Planning, Planificación, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Solution optimale, Optimal solution, Solución óptima, Contrainte temporelle, Temporal constraint
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
NASA Ames Research Center, MS 269-2, Moffett Field, CA 94035, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15133236
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.15133236
Database:
PASCAL Archive

Further Information

The focus of this paper is on constrained optimization problems where the objective is to maximize a set of local preferences for times at which events occur. Previous work by the same authors has resulted in a reformulation of a subclass of these problems into a generalization of Temporal Constraint Satisfaction Problems, using a semi-ring as the underlying structure for reasoning about preferences. A tractable strategy for combining and comparing preferences was proposed, wherein computing global preferences consists of taking the minimum of the component preference values. This strategy, which we here dub the weakest link optimization (WLO) strategy, is a coarse method for comparing solutions, and therefore can easily be demonstrated to have drawbacks. To formalize this observation, we show here that the optimal solutions generated by WLO are not in general Pareto optimal. To compensate for these limitations, we make WLO more robust by combining it with a process that involves iteratively committing to temporal values in the set of optimal solutions, concomitantly fixing the preference value for the projection of the solution to the local preference. The intuition is simple: by applying WLO iteratively to reduced problems, WLO might be able to improve the preference values of the remaining temporal variables. We demonstrate the improvement gained from applying this technique on examples from Mars Rover planning domain, and prove that the combined strategy results in solutions that are in the set of Pareto optimal solutions.