Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Improve Convergence Speed of Multi-Agent Q-Learning for Cooperative Task Planning
by
Konar, Amit
, Sadhu, Arup Kumar
in
fast cooperative multi‐agent Q‐learning
/ multi‐agent cooperative planning
/ reinforcement leaning
/ task‐planning
/ traditional multi‐agent Q‐learning
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Improve Convergence Speed of Multi-Agent Q-Learning for Cooperative Task Planning
by
Konar, Amit
, Sadhu, Arup Kumar
in
fast cooperative multi‐agent Q‐learning
/ multi‐agent cooperative planning
/ reinforcement leaning
/ task‐planning
/ traditional multi‐agent Q‐learning
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Improve Convergence Speed of Multi-Agent Q-Learning for Cooperative Task Planning
Book Chapter
Improve Convergence Speed of Multi-Agent Q-Learning for Cooperative Task Planning
2020
Request Book From Autostore
and Choose the Collection Method
Overview
This chapter aims at extending traditional multi‐agent Q‐learning (MAQL) algorithms to improve their speed of convergence by incorporating two interesting properties, concerning exploration of the team‐goal and selection of joint action at a given joint state. It begins by reviewing the preliminaries of reinforcement leaning (RL). The motivation of RL is to derive the optimal action at a given environmental state for which the agent would be able to derive the maximum reward. Such formulation of deriving optimal action at a given state based on the learned experience of interaction with the environment has plenty of interesting applications, including generating moves in a game, and complex task‐planning and motion‐planning of a mobile robot in a constrained environment. The chapter then introduces the proposed fast cooperative multi‐agent Q‐learning algorithms. The chapter deals with multi‐agent cooperative planning algorithms and includes experiments and results.
Publisher
John Wiley & Sons, Incorporated,John Wiley & Sons, Inc
Subject
ISBN
9781119699033, 1119699037
This website uses cookies to ensure you get the best experience on our website.