Abstract
Problems from various domains can be modeled as dynamic constraint satisfaction problems, where the constraints, the variables or the variable domains change overtime. The aim, when solving this kind of problems, is to decrease the number of variables for which their assignment changes between consecutive problems, a concept known as distance or stability. This problem of stability has previuosly been studied, but only for variations in the constraints of a given problem. This paper describes a wider analysis on the stability problem, when modifying variables, domains, constraints and combinations of these elements for the resource allocation problem, modeled as a DCSP. Experiments and results are presented related to efficiency, distance and a new parameter called global stability for several techniques such as solution reuse, reasoning reuse and a combination of both. Additionaly, results show that the distance behavior is linear with respect to the variations.
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
Jonsson, A.K., Frank, J.: A framework for dynamic constraint reasoning using procedural constraints. In: European Artificial Intelligence Conference (2000)
Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proceedings of the Sixth National Conference on Artificial Intelligence, pp. 37–42 (1988)
Schiex, T., Verfaillie, G.: Two approaches to the solution maintenance problem in dynamic constraint satisfaction problems (1993)
Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: AAAI, vol. 1, pp. 307–312 (1994)
Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58(1-3), 161–205 (1992)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems (1993)
Plaunt, C., Jonsson, A.K., Frank, J.: Run-time satellite tele-communications call handling as dynamic constraint satisfaction. In: Proceedings of the IEEE Aerospace Conference 1999, pp. 165–174 (1999)
Alanyali, M., Hajek, B.: On simple algorithms for dynamic load balancing. In: INFOCOM, vol. 1, pp. 230–238 (1995)
Choueiry, B.Y., Noubir, G., Faltings, B.: Blending AI and mathematics: the case of resource allocation. In: Fourth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, pp. 32–37 (1996)
Gomes, C.P., Hsu, J.: ABA: An assignment based algorithm for resource allocation. SIGART Bulletin 7(1), 2–8 (1996)
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
Angles-Domínguez, M.I., Terashima-Marín, H. (2004). Stability Analysis for Dynamic Constraint Satisfaction Problems. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds) MICAI 2004: Advances in Artificial Intelligence. MICAI 2004. Lecture Notes in Computer Science(), vol 2972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24694-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24694-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21459-5
Online ISBN: 978-3-540-24694-7
eBook Packages: Springer Book Archive