Harvey, Peter; Chang, Chee Fon; and Ghose, Aditya K., 2006, Support-based distributed search: A new approach for multiagent constraint processing, in P. Stone & G. Weiss (Eds.), International Conference on Autonomous Agents and Multiagent Systems, Japan: ACM, 377-383.
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.