Learning in Cooperative Multi-Agent Systems : Distributed Reinforcement Learning Algorithms and their Application to Scheduling Problems

Thomas Gabel

ISBN 10: 3838110366 / ISBN 13: 9783838110363

Published by Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG, 2009

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - In a distributed system, a number of individually acting agents coexist. In order to achieve a common goal, coordinated cooperation between the agents is crucial. Many real-world applications are well-suited to be formulated in terms of spatially or functionally distributed entities. Job-shop scheduling represents one such application. Multi-agent reinforcement learning (RL) methods allow for automatically acquiring cooperative policies based solely on a specification of the desired joint behavior of the whole system. However, the decentralization of the control and observation of the system among independent agents has a significant impact on problem complexity. The author Thomas Gabel addresses the intricacy of learning and acting in multi-agent systems by two complementary approaches. He identifies a subclass of general decentralized decision-making problems that features provably reduced complexity. Moreover, he presents various novel model-free multi-agent RL algorithms that are capable of quickly obtaining approximate solutions in the vicinity of the optimum. All algorithms proposed are evaluated in the scope of various established scheduling benchmark problems.

Seller Inventory # 9783838110363

Bibliographic Details

• Title: Learning in Cooperative Multi-Agent Systems : Distributed Reinforcement Learning Algorithms and their Application to Scheduling Problems
• Publisher: Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG
• Publication Date: 2009
• Language: English
• ISBN 10: 3838110366
• ISBN 13: 9783838110363
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 13D millimeters 220 millimeters width by 150 millimeters height by 13 millimeters depth
• Weight: 304 grams

About this title

Synopsis

In a distributed system, a number of individually acting agents coexist. In order to achieve a common goal, coordinated cooperation between the agents is crucial. Many real-world applications are well-suited to be formulated in terms of spatially or functionally distributed entities. Job-shop scheduling represents one such application. Multi-agent reinforcement learning (RL) methods allow for automatically acquiring cooperative policies based solely on a specification of the desired joint behavior of the whole system. However, the decentralization of the control and observation of the system among independent agents has a significant impact on problem complexity. The author Thomas Gabel addresses the intricacy of learning and acting in multi-agent systems by two complementary approaches. He identifies a subclass of general decentralized decision-making problems that features provably reduced complexity. Moreover, he presents various novel model-free multi-agent RL algorithms that are capable of quickly obtaining approximate solutions in the vicinity of the optimum. All algorithms proposed are evaluated in the scope of various established scheduling benchmark problems.

About the Author

Thomas Gabel, Dr. rer. nat., studied Computer Scienceat the University of Kaiserslautern. Subsequently, hewas working as scientific researcher at the University of Osnabrück with focus on learning in multi-agent systems, reinforcement learning, as well as knowledge management and case-based reasoning. He received his doctoral degree in 2009.