Abstract
A temporal reasoning problem can often be naturally characterized as a collection of constraints with associated local preferences for times that make up the admissible values for those constraints. Globally preferred solutions to such problems emerge as a result of well-defined operations that compose and order temporal assignments. The overall objective of this work is a characterization of different notions of global temporal preference within a temporal constraint reasoning framework, and the identification of tractable sub-classes of temporal reasoning problems incorporating these notions. This paper extends previous results by refining the class of useful notions of global temporal preference that are associated with problems that admit of tractable solution techniques. This paper also resolves the hitherto unanswered question of whether the solutions that are globally preferred from a utilitarian criterion for global preference can be found tractably. A technique is described for identifying and representing the entire set of utilitarian-optimal solutions to a temporal problem with preferences.
This is a preview of subscription content, log in via an institution to check access.
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
Ajili, F., El Sakkout, H.: A probe-based algorithm for piecewise linear optimization in scheduling. Annals of Operations Research 118, 25–48 (2003)
Bacchus, F., Grove, A.: Graphical models for preference and utility. In: Proceedings of the Eleventh Conference of Uncertainty in Artificial Intelligence, pp. 3–10. Morgan Kaufmann, San Francisco (1995)
Bresina, J., Golden, K., Smith, D., Washington, R.: Increased flexibility and robustness of mars rovers. In: Proceedings of the 5th International Symposium on Artificial Intelligence, Robotics and Automation for Space, ESTEC, Noordwijk, Netherlands (1999)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Dubois, D., Fargier, H., Prade, H.: Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Applied Intelligence 6(4), 287–309 (1996)
Ehrgott, M.: Discrete decision problems, multiple criteria optimization classes and lexicographic max-ordering. In: Trends in Multicriteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol. 465, pp. 31–44. Springer, Heidelberg (1998)
Junker, U.: Preference-based search and multi-criteria optimization. In: Proceedings of AAAI 2002, AAAI Press, Menlo Park (2003)
Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal reasoning about preferences. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, USA, Morgan Kaufmann, San Francisco (2001)
Khatib, L., Morris, P., Morris, R., Venable, B.: Tractable pareto optimization of temporal preferences. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acupulco, Mexico, Morgan Kaufmann, San Francisco (2003)
Muscettola, N., Morris, P., Tsamardinos, I.: Reformulating temporal plans for efficient execution. In: Proceedings of Sixth International Conference on Principles of Knowledge Representation and Reasoning, KR 1998 (1998)
El Sakkout, H., Wallace, M., Richards, T.: Minimal perturbance in dynamic scheduling. In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI 1998), pp. 504–508 (1998)
Schrijver, A.: Theory of linear and integer programming. John Wiley and Sons, NY (1986)
Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morris, P., Morris, R., Khatib, L., Ramakrishnan, S., Bachmann, A. (2004). Strategies for Global Optimization of Temporal Preferences. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive