Coordination in Multi-Agent Systems

Coordination in Multi-Agent Systems

EnglishPaperback / softbackPrint on demand
Chen, Gang
LAP Lambert Academic Publishing
EAN: 9783838307237
Print on demand
Delivery on Friday, 21. of August 2026
€69.46
Common price €77.18
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

Coordination, as an art of managing interdependency among activities, will be extensively studied in this book under the multi-agent system paradigm. To model the information essential to agent coordination, this book proposes a Fuzzy Subjective Task Structure (FSTS) model, through which agent coordination is viewed as a Decision-Theoretic Planning problem, to which reinforcement learning can be applied. Two learning algorithms, "coarse-grained" and "fine-grained" are presented to address agent coordination at two different levels. The "coarse-grained" algorithm operates at one level and tackles hard system constraints, while the "fine-grained" at another level and for soft constraints. Besides reinforcement learning, this book also proposes a bio-inspired approach to agent coordination. A dynamic coordination model inspired by biological metabolic system is presented. Agent coordination is achieved as every agent performs iteratively a dynamic optimization process, which utilizes explicitly the global dynamics captured through the metabolic model. All research results presented in this book are experimentally evaluated to be effective and useful in practice.
EAN 9783838307237
ISBN 3838307232
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Publication date August 6, 2009
Pages 196
Language English
Dimensions 229 x 152 x 11
Country Germany
Readership General
Authors Chen, Gang
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.