| 书目名称 | Distributed Constraint Satisfaction |
| 副标题 | Foundations of Coope |
| 编辑 | Makoto Yokoo |
| 视频video | |
| 概述 | The book adapts results from classical constraint satisfaction for multi-agent systems and consolidates recent research and presents new results in a consistent way.Includes supplementary material: |
| 丛书名称 | Springer Series on Agent Technology |
| 图书封面 |  |
| 描述 | 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, |
| 出版日期 | Book 2001 |
| 关键词 | Agent Cooperation; Agent Techology; Constraint Satisfaction; Distributed Artificial Intelligence; Distri |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-59546-2 |
| isbn_softcover | 978-3-642-64020-9 |
| isbn_ebook | 978-3-642-59546-2Series ISSN 1619-7119 Series E-ISSN 1866-7333 |
| issn_series | 1619-7119 |
| copyright | Springer-Verlag Berlin Heidelberg 2001 |
发表于 2025-3-21 19:18:29
