DynABT: dynamic asynchronous backtracking for dynamic DisCSPs.

Omomowo, Bayo; Arana, In�s; Ahriz, Hatem

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 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.

Citation

OMOMOWO, B., ARANA, I. and AHRIZ, H. 2008. DynABT: dynamic asynchronous backtracking for dynamic DisCSPs. In Dochev, D., Pistore, M. and Traverso, P. (eds.) Proceedings of the 13th International conference on artificial intelligence: methodology, systems and applications (AIMSA 2008), 4-6 September 2008, Varna, Bulgaria. Lecture notes in computer science, 5253. Berlin: Springer [online], pages 285-296. Available from: https://doi.org/10.1007/978-3-540-85776-1_24

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 13th International conference on artificial intelligence: methodology, systems and applications (AIMSA 2008)
• Start Date: Sep 4, 2008
• End Date: Sep 6, 2008
• Acceptance Date: Dec 31, 2008
• Online Publication Date: Dec 31, 2008
• Publication Date: Dec 31, 2008
• Deposit Date: Dec 23, 2008
• Publicly Available Date: Dec 23, 2008
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Pages: 285-296
• Series Title: Lecture notes in computer science
• Series Number: 5253
• ISBN: 3540857753; 9783540857754
• DOI: https://doi.org/10.1007/978-3-540-85776-1_24
• Keywords: Constraint satisfaction; Distributed AI; Dynamic problems
• Public URL: http://hdl.handle.net/10059/282
• Contract Date: Dec 23, 2008