Abstract
Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i.e. the problems are distributed over a number of agents and change over time. Dynamic Distributed Constraint Satisfaction Problems (DDisCSP) [1] are an emerging field for the resolution of problems that are dynamic and distributed in nature. In this paper, we propose DynABT, a new Asynchronous algorithm for DDisCSPs which combines solution and reasoning reuse i.e. it handles problem changes by modifying the existing solution while re-using knowledge gained from solving the original (unchanged) problem. The benefits obtained from this approach are two-fold: (i) new solutions are obtained at a lesser cost and; (ii) resulting solutions are stable i.e. close to previous solutions. DynABT has been empirically evaluated on problems of varying difficulty and several degrees of changes has been found to be competitive for the problem classes tested.
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
Mailler, R.: Comparing two approaches to dynamic, distributed constraint satisfaction. In: AAMAS 2005: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pp. 1049–1056. ACM Press, New York (2005)
Dechter, A., Dechter, R.: Belief maintenance in dynamic constraint networks. In: Seventh National Conference on Artificial Intelligence (AAAI), pp. 37–42. St. Paul, MN (1988)
Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints 10(3), 253–281 (2005)
Verfaillie, G., Schiex, T.: Dynamic backtracking for dynamic constraint satisfaction problems. In: Proceedings of the ECAI 1994 Workshop on Constraint Satisfaction Issues Raised by Practical Applications, Amsterdam, The Netherlands, pp. 1–8 (1994)
Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: National Conference on Artificial Intelligence, pp. 307–312 (1994)
Yokoo, M.: Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Springer, London (2001)
Meisels, A.: Distributed constraints satisfaction algorithms, performance, communication. In: Tenth International Conference on Principles and Practice of Constraint Programming, Canada, pp. 161–166 (2004)
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction for formalizing distributed problem solving. In: Proc. of the 12th. DCS, pp. 614–621 (1992)
Yokoo, M.: Asynchronous weak-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., Hirayama, K.: Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: Second International Conference on Multiagent Systems, pp. 401–408 (1996)
Morris, P.: The breakout method for escaping from local minima. In: AAAI, pp. 40–45 (1993)
Zivan, R., Meisels, A.: Dynamic ordering for asynchronous backtracking on discsps. Constraints 11(2-3), 179–197 (2006)
Silaghi, M.C., Sam-Haroud, D.B.: Generalized dynamic ordering for asynchronous backtracking on discsps. In: Second Asia-Pacific Conference on Intelligent Agent Technology (IAT), Maebashi, Japan (2001)
Silaghi, M.C., Sam-Haroud, D., Hybridizing, B.: abt and awc into a polynomial space, complete protocol with reordering. TR4 EPFL-TR-01/36, Swiss Federal Institute of Technology, Lussane, Switzerland (May 2001)
Bessière, C., Maestre, A., Brito, I., Meseguer, P.: Asynchronous backtracking without adding links: a new member in the abt family. Artif. Intell. 161(1-2), 7–24 (2005)
Ginsberg, M.L.: Dynamic backtracking. Journal of Artificial Intelligence Research 1, 25–46 (1993)
Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing performance of distributed constraints processing algorithms. In: Proceedings of the AAMAS 2002 Workshop on Distributed Constraint Reasoning, Bologna, July 2002, pp. 86–93 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Omomowo, B., Arana, I., Ahriz, H. (2008). DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs. In: Dochev, D., Pistore, M., Traverso, P. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2008. Lecture Notes in Computer Science(), vol 5253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85776-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-85776-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85775-4
Online ISBN: 978-3-540-85776-1
eBook Packages: Computer ScienceComputer Science (R0)