Abstract
Constraint Programming research is currently aimed at solving problems in a dynamically changing environment. This paper addresses the problem of solving a Dynamic Distributed Constraint Satisfaction Problem (Dynamic DCSP). The solution proposed is an algorithm implemented in a multi- agent system. A Dynamic DCSP is a problem in which variables, values and constraints are distributed among various agents. Agents can be freely added to or removed from the system. Most advanced applications cannot be represented by DCSPs, but they can be modeled by Dynamic DCSPs. The algorithm described in this paper is an extension of the Asynchronous Weak Commitment Search algorithm (AWCS) originally proposed by Yukoo [10]. The extended algorithm is designed to cope with the dynamically changing parameters of a Dynamic DCSP. The proposed algorithm differs from other Dynamic DCSP algorithms because it allows an unlimited number of changes to any of the variables, values, or constraints. This paper describes an agent system implementing the modified AWCS algorithm and verifies its effectiveness by applying it to a dynamic N-Queens problem. The results prove the applicability of the modified algorithm to Dynamic DCSP.
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
Bessiere, C.: Arc-consistency in dynamic constraint satisfaction problem. In: Proceeding of the Ninth National Conference on Artificial Intelligence, pp. 221–226 (1991)
Hannebauer, M., Müller, S.: Distributed constraint optimization for medical appointment scheduling. In: Proceedings of the fifth international conference on Autonomous agents, pp. 139–140 (2001)
Minton, S., Johnson, M.D., Phillips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 161–205 (1992)
Modi, P.J., Jung, H., Tambe, M., Shen, W.M., Kullkarni, S.: Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach. In: Revised Papers from the 8th International Workshop on Intelligent Agents VIII, August 01-03, 2001, pp. 264–276 (2001)
Paulussen, T.O., Zöller, A., Heinzl, A., Pokahr, A., Braubach, L., Lamersdorf, W.: Dynamic patient scheduling in hospitals. In: Coordination and Agent Technology in Value Networks (2004)
Rybski, P., Stoeter, S.A., Gini, M., Hougen, D.F., Papanikolopoulos, N.: Dynamic Scheduling of Fixed Bandwidth Communications channels for controlling multiple robots. In: Proceedings of the fifth international conference on Autonomous agents, pp. 153–154 (2001)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfaction problems. In: Procedding of the Tenth National Conference on Artificail Intelligence, pp. 440–446 (1992)
Tumer, K., Lawson, J.: Collectives for multiple resource job scheduling across heterogeneous severs. In: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, pp. 1142–1143 (2003)
Yokoo, M.: Asynchronous waek-commitment search for solving distributed constraint satisfaction problems. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 88–102. Springer, Heidelberg (1995)
Yokoo, M.: Distributed Constraint Satisfaction: Foundation of cooperation in multi-agent systems. Springer, Heidelberg (2001)
Yokoo, M.: Weak-Commitment search for solving constraint satisfaction problems. In: Proceeding of the Twelth Natinal Conference on Artificial Intelligence, pp. 313–318 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saenchai, K., Benedicenti, L., Paranjape, R. (2006). Solving Dynamic Distributed Constraint Satisfaction Problems with a Modified Weak-Commitment Search Algorithm. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds) Engineering Self-Organising Systems. ESOA 2005. Lecture Notes in Computer Science(), vol 3910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11734697_10
Download citation
DOI: https://doi.org/10.1007/11734697_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33342-5
Online ISBN: 978-3-540-33352-4
eBook Packages: Computer ScienceComputer Science (R0)