Advertisement

Distributed Constraint Satisfaction

Foundations of Cooperation in Multi-agent Systems

  • Makoto Yokoo
Book

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

Table of contents

  1. Front Matter
    Pages I-XVII
  2. Makoto Yokoo
    Pages 1-45
  3. Makoto Yokoo
    Pages 55-68
  4. Makoto Yokoo
    Pages 69-79
  5. Makoto Yokoo
    Pages 81-92
  6. Makoto Yokoo
    Pages 93-100
  7. Makoto Yokoo
    Pages 101-111
  8. Makoto Yokoo
    Pages 113-132
  9. Makoto Yokoo
    Pages 133-135
  10. Back Matter
    Pages 137-141

About this book

Introduction

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.

Keywords

Agent Cooperation Agent Techology Constraint Satisfaction Distributed Artificial Intelligence Distributed Constraint Satisfaction Extension Multi-agent Systems (MAS) Search Algorithms algorithms artificial intelligence cognition complexity constraint satisfaction problem multi-agent system search algorithm

Authors and affiliations

  • Makoto Yokoo
    • 1
  1. 1.NTT Communication Science LaboratoriesKyotoJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-59546-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-64020-9
  • Online ISBN 978-3-642-59546-2
  • Series Print ISSN 1619-7119
  • Series Online ISSN 1866-7333
  • Buy this book on publisher's site
Industry Sectors
Pharma
Materials & Steel
Automotive
Chemical Manufacturing
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Law
Consumer Packaged Goods
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering