Support-based distributed search: a new approach for multiagent constraint processing

Authors:
Peter Harvey;Chee Fon Chang;Aditya Ghose
Affiliations:
University of Wollongong, NSW, Australia;University of Wollongong, NSW, Australia;University of Wollongong, NSW, Australia
Venue:
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Year:
2006

Citing 5
Cited 3

Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
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
Distributed Dynamic Backtracking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Distributed breakout revisited

Eighteenth national conference on Artificial intelligence
Practical Application of Support-Based Distributed Search

ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence

Hypotheses refinement under topological communication constraints

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
SBDO: A New Robust Approach to Dynamic Distributed Constraint Optimisation

PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
SBDO: a new robust approach to dynamic distributed constraint optimisation

PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed Constraint Satisfaction Problems provide a natural mechanism for multiagent coordination and agreement. To date, algorithms for Distributed Constraint Satisfaction Problems have tended to mirror existing non-distributed global-search or local-search algorithms. Unfortunately, existing distributed global-search algorithms derive from classical backtracking search methods and require a total ordering over agents for completeness. Distributed variants of local-search algorithms (such as distributed breakout) inherit the incompleteness properties of their predecessors, or depend on the creation of new communication links between agents. This paper presents an algorithm in which a global ordering is not required, while avoiding the problems of existing local-search algorithms.