Asynchronous aggregation and consistency in distributed constraint satisfaction

Authors:
Marius-Calin Silaghi;Boi Faltings
Affiliations:
Computer Sciences Department, Florida Institute of Techology, Melbourne, FL;Artificial Intelligence Laboratory, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
Venue:
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Year:
2005

Citing 13
Cited 8

On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
Distributed snapshots: determining global states of distributed systems

ACM Transactions on Computer Systems (TOCS)
Chaotic iteration for distributed constraint propagation

Proceedings of the 1999 ACM symposium on Applied computing
Determining the usefulness of information from its use during problem solving

AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Asynchronous Search with Aggregations

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Asynchronous Search for Numeric DisCSPs

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
An Approach to Over-constrained Distributed Constraint Satisfaction Problems: Distributed Hierarchical Constraint Satisfaction

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
A fast and simple algorithm for bounds consistency of the all different constraint

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Dynamic prioritization of complex agents in distributed constraint satisfaction problems

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Dynamic Ordering for Asynchronous Backtracking on DisCSPs

Constraints
An Agent Based QoS Conflict Mediation Framework for Web Services Compositions

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Dynamic Asynchronous Aggregate Search for Solving QoS Compositions of Web Services

WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Asynchronous Forward-checking for DisCSPs

Constraints
Feasible distributed CSP models for scheduling problems

Engineering Applications of Artificial Intelligence
Min-domain retroactive ordering for Asynchronous Backtracking

Constraints
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking

Autonomous Agents and Multi-Agent Systems
Dynamic DFS tree in ADOPT-ing

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly, many of these tasks pose themselves in a distributed setting where variables and constraints are distributed among different agents.A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains.