Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bistarelli, S., Montanari, U., and Rossi, F. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201–236, 1997.
Dechter, R., Meiri, I. and Pearl, J. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.
Khatib, L., Morris, P., Morris, R., and Rossi, F. Temporal Reasoning about Preferences. Proceedings of IJCAI-01.
Krulwich, Bruce. Planning for Soft Goals. Proceedings of AIPS-92, 289–290.
Pinedo, Michael. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.
Tsang, E. Foundations of constraint satisfaction. Ed. Academic Press, New York, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khatib, L., Morris, P., Morris, R. (2002). Pareto Optimization of Temporal Decisions. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-45622-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43941-7
Online ISBN: 978-3-540-45622-3
eBook Packages: Springer Book Archive