Applying interchangeability techniques to the distributed breakout algorithm

Authors:
Adrian Petcu;Boi Faltings
Affiliations:
Artificial Intelligence Laboratory, Swiss Federal Institute of Technology, Lausanne, Switzerland;Artificial Intelligence Laboratory, Swiss Federal Institute of Technology, Lausanne, Switzerland
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 3
Cited 3

On the computation of local interchangeability in discrete constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Communication and Computation in Distributed CSP Algorithms

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Symmetry breaking and local search spaces

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A value ordering heuristic for local search in distributed resource allocation

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood partial and full interchangeability techniques to keep conflicts localized and avoid spreading them to neighboring areas. Our experiments on distributed sensor networks show that such techniques can significantly reduce the number of cycles required to solve the problems (therefore also reduce communication and time requirements), especially on difficult problems. Moreover, the improved algorithms are able to solve a higher proportion of the test problems.