Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Distributed Constraint Satisfaction

Foundations of Cooperation in Multi-agent Systems

  • Book
  • © 2001

Overview

Authors:
  1. Makoto Yokoo

    1. NTT Communication Science Laboratories, Kyoto, Japan

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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: sn.pub/extras

Part of the book series: Springer Series on Agent Technology (SSAT)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

  1. Front Matter

    Pages I-XVII
    Download chapter PDF

  2. Constraint Satisfaction Problem

    • Makoto Yokoo
    Pages 1-45

  3. Distributed Constraint Satisfaction Problem

    • Makoto Yokoo
    Pages 47-54

  4. Asynchronous Backtracking

    • Makoto Yokoo
    Pages 55-68

  5. Asynchronous Weak-Commitment Search

    • Makoto Yokoo
    Pages 69-79

  6. Distributed Breakout

    • Makoto Yokoo
    Pages 81-92

  7. Distributed Consistency Algorithm

    • Makoto Yokoo
    Pages 93-100

  8. Handling Multiple Local Variables

    • Makoto Yokoo
    Pages 101-111

  9. Handling Over-Constrained Situations

    • Makoto Yokoo
    Pages 113-132

  10. Summary and Future Issues

    • Makoto Yokoo
    Pages 133-135

  11. Back Matter

    Pages 137-141
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • NTT Communication Science Laboratories, Kyoto, Japan

    Makoto Yokoo

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation