Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems

· Springer Science & Business Media
3.0
1 則評論
電子書
143
頁數
評分和評論未經驗證 瞭解詳情

關於這本電子書

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.

評分和評論

3.0
1 則評論

為這本電子書評分

請分享你的寶貴意見。

閱讀資訊

智能手機和平板電腦
請安裝 Android 版iPad/iPhone 版「Google Play 圖書」應用程式。這個應用程式會自動與你的帳戶保持同步,讓你隨時隨地上網或離線閱讀。
手提電腦和電腦
你可以使用電腦的網絡瀏覽器聆聽在 Google Play 上購買的有聲書。
電子書閱讀器及其他裝置
如要在 Kobo 等電子墨水裝置上閱覽書籍,你需要下載檔案並傳輸到你的裝置。請按照說明中心的詳細指示,將檔案傳輸到支援的電子書閱讀器。