Distributed constraint satisfaction for formalizing distributed problem solving
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques used in constraint satisfaction problems, is presented. Experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely coupled.<>Keywords
This publication has 4 references indexed in Scilit:
- DATMS: A Framework for Distributed Assumption Based ReasoningPublished by Elsevier ,1989
- Multistage Negotiation in Distributed PlanningPublished by Elsevier ,1988
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978