Modeling and solving distributed constraint satisfaction problems (dcsps) Academic Article uri icon

abstract

  • Constraint satisfaction problems (CSP) are part of many real world domains, such as computer vision and scheduling problems. Often, CSPs are solved in real life by several agents, each of them working on a part of the problem [3, 4]. A distributed CSP can be viewed as a set of constraint networks(CN), each CN being solved by a different agent, where the CNs are connected by constraints. A major assumption of the present paper is that checking constraints inside the distributed components has a much lower cost than checking constraints across different …

publication date

  • August 19, 1996