Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems
When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-agent constraints. More specifically, a distributed CSP is a constraint satisfaction problem (CSP) in which multiple agents are involved. A constraint satisfaction problem is a problem in which the goal is to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of artificial intelligence (AI) problems can be formalized as CSPs. Therefore, the research on CSPs has a long and distinguished history in AI (Mackworth 1992; Dechter 1992; Tsang 1993; Kumar 1992). A distributed CSP is a CSP in which variables and constraints are distributed among multiple autonomous agents. Various application problems in Multi-agent Systems (MAS) that are concerned with finding a consistent combination of agent actions can he formalized as dis tributed CSPs. Therefore, we can consid(~r distributed CSPs as a general framework for MAS, and algorithms for solving distributed CSPs as impor tant infrastructures for cooperation in MAS. This book gives an overview of the research on distributed CSPs, as well as introductory material on CSPs. In Chapter 1. we show the problem defi nition of normal, centralized CSPs and describe algorithms for solving CSPs.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Constraint Satisfaction Problem
Distributed Constraint Satisfaction Problem
6 other sections not shown
Other editions - View all
Distributed Constraint Satisfaction: Foundations of Cooperation in Multi ...
Limited preview - 2012
2-consistency 3-Coloring Problems 3-SAT Problems agenLview agent xi agent-view Algorithm Execution algorithms for solving application problems asynchronous backtracking algorithm asynchronous weak-commitment search Average Number Branch and Bound changes its value Chapter clause density computation consistent value Constraint Network Constraint Satisfaction Problem constraint violations current-value distributed ATMS distributed breakout algorithm distributed maximal CSPs domain efficient empty set evaluation value Example of Algorithm find a solution formalization GSAT higher priority agents hill-climbing algorithms importance values local-minimum min-conflict backtracking min-conflict heuristic multi-agent systems multiple local variables my-termination-counter neighbors node nogood message number of constraint number of cycles number of local-minima number of restarts optimal solution partial solution performs phase transition plan fragments priority order priority value problem instances procedure quasi-local-minimum randomly ratio rithm satisfies all constraints send ok sends a nogood solution-reachable solving distributed CSPs threshold truth maintenance system value assignment variable values weak-commitment search algorithm Yokoo