Distributed Constraint Satisfaction Foundations of Cooperation in Mu
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 combinat
- PDF / 14,033,759 Bytes
- 154 Pages / 439 x 666 pts Page_size
- 89 Downloads / 193 Views
Springer
Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Singapore Tokyo
Makoto Yokoo
Distributed Constraint Satisfaction Foundations of Cooperation in Multi -agent Systems
With 82 Figures and 22 Tables
,
Springer
Makoto Yokoo NTT Communication Science Laboratories 2-4 Hikaridai, Seika-cho Soraku-gun, Kyoto 619-0237 Japan E-mail: [email protected]
Library of Congress Cataloging-in-Publication Data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Yokoo, Makoto: Distributed constraint satisfaction: foundations of cooperation in multi-agent systems; with tables/Makoto Yakoo. - Berlin; Heidelberg; New York; Barcelona; Hong Kong; London; Milan; Paris; Singapore; Tokyo: Springer, 2001 (Springer series on agent technology) ISBN-13: 978-3-642-64020-9 e-ISBN-13: 978-3-642-59546-2 DOl: 10.1007/978-3-642-59546-2
ACM Subject Classification (1998): 1.2.11, C.2.4, F.2 ISBN 978-3-642-64020-9 Springer-Verlag Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under the German Copyright Law. Springer-Verlag Berlin Heidelberg New York a member of BertelsmannSpringer Science+ Business Media GmbH © Springer-Verlag Berlin Heidelberg 2001 Softcover reprint of the hardcover 1st edition 2001
The use of general descriptive names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by the author Cover Design: design + production, Heidelberg SPIN 10722913 - 06/3142SR - 5 4 3 2 1 0
Preface
When multiple agents are in a shared environment, there usually exist constraints 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 distribut
Data Loading...
