Distributed Constraint Satisfaction

This book gives an overview of constraint satisfaction problems (CSPs), adapts related search algorithms and consistency algorithms for applications to multi-agent systems, and consolidates recent research devoted to cooperation in such systems. The techniques introduced are applied to various problems in multi-agent systems. Among the new approaches is a hybrid-type algorithm for weak-commitment search combining backtracking and iterative improvement; also, an extension of the basic CSP formalization called partial CSP is introduced in order to handle over-constrained CSPs. The book is written for advanced students and professionals interested in multi-agent systems or, more generally, in distributed artificial intelligence and constraint satisfaction. Researchers active in the area will appreciate this book as a valuable source of reference.

שנה

2001

שפה

English

סדרה

Springer Series on Agent Technology

הוצאה

Springer Berlin Heidelberg

מהדורות

3

עמודים

143

ISBN

9783642640209

מקור הנתונים: Wikidata