
Distributed Search by Constrained Agents
Algorithms, Performance, Communication
Amnon Meisels(Author)
Springer (Publisher)
Published on 3. December 2007
Book
Hardback
XX, 216 pages
978-1-84800-039-1 (ISBN)
Description
Distributed search by agents is an important topic of distributed AI and has not been treated thoroughly as such. While the scope of work on multi-agent systems has grown steadily over the last decade, very little of it has spilled into distributed search. In conrast, the constraints processing community has produced a sizable body of work on distributed constrained search. Parado- cally, a community that concentrates on search algorithms and heuristics has created a distributed model for agents that cooperate on solving hard search problems. Traditionally, this ?eld has been named Ditributed Constraints S- isfaction and lately also distributed constraints optimization. The present book attempts to prompt deeper response from the MAS community and hopefully to give rise to cooperative work on distributed search by agents. In order to achieve this high goal, the book presents the large body of work on distributed search by constrained agents. The presentation emphasizes many aspects of distributed computation that connect naturally to multi-agent systems, - pecially measures of performance for distributed search algorithms and the impact of delays in communication. Distributed Constraints Satisfaction Problems (DisCSPs) have been st- ied over the last decade, starting with the pioneering proposal by Makoto Yokoo [18]. The ?rst distributed search algorithm for DisCSPs - As- chronous Backtracking (ABT) - was ?rst published in complete format in 1998 [64]. The ?rst book on Distributed Constraints Satisfaction Problems has appeared as early as 2000 [61].
More details
Series
Edition
2008 ed.
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Research
Product notice
sewn/stitched
Cloth over boards
Illustrations
XX, 216 p.
Dimensions
Height: 243 mm
Width: 167 mm
Thickness: 25 mm
Weight
480 gr
ISBN-13
978-1-84800-039-1 (9781848000391)
DOI
10.1007/978-1-84800-040-7
Schweitzer Classification
Other editions
Additional editions

Book
10/2010
Springer
€106.99
Shipment within 15-20 days

E-Book
12/2007
1st Edition
Springer
€96.29
Available for download
Content
Constraints Satisfaction Problems - CSPs.- Constraints Optimization Problems - COPs.- Distributed Search.- Asynchronous Backtracking (ABT).- Asynchronous Forward-Checking.- Concurrent Dynamic Backtracking.- Distributed Ordering Heuristics.- Asynchronous Ordering Heuristics.- Performance measures for distributed search.- Experimental Evaluation of DisCSP Algorithms.- The Impact of Communication - Message Delays.- Message Delays and DisCSP Search Algorithms.- Distributed Constraint Optimization Problems (DisCOPs).- Asynchronous Optimization for DisCOPs.- Asynchronous Forward-Bounding.- Extending AFB - BackJumping.- Empirical Evaluation of DisCOP algorithms.