Dynamic distributed backjumping

Authors:
Viet Nguyen;Djamila Sam-Haroud;Boi Faltings
Affiliations:
Laboratory of Autonomous Systems, Ecole Polytechnique Federale de Lausanne (EPFL), Lausanne, Switzerland;Laboratory of Artificial Intelligence, Ecole Polytechnique Federale de Lausanne (EPFL), Lausanne, Switzerland;Laboratory of Artificial Intelligence, Ecole Polytechnique Federale de Lausanne (EPFL), Lausanne, Switzerland
Venue:
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Year:
2004

Citing 7
Cited 3

Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
An introduction to distributed algorithms

An introduction to distributed algorithms
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems

Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
High Performance Computing

High Performance Computing
Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
Asynchronous Search with Aggregations

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Dynamic backtracking

Journal of Artificial Intelligence Research

Effect of DisCSP variable-ordering heuristics in scale-free networks

PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Nogood-based asynchronous forward checking algorithms

Constraints
Effect of DisCSP variable-ordering heuristics in scale-free networks

Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed version of the centralized BackJumping algorithm, called the Dynamic Distributed BackJumping – DDBJ algorithm. The advantage is twofold: DDBJ inherits the strength of synchronous algorithms that enables it to easily combine with a powerful dynamic ordering of variables and values, and still it maintains some level of autonomy for the agents. Experimental results show that DDBJ outperforms the DiDB and AFC algorithms by a factor of one to two orders of magnitude on hard instances of randomly generated DisCSPs.