Abstract

An effective method to use centralized Q-learning in multi-robot task allocation

Highlights

  • With the rapid growth of technology, multi-robot systems (MRS) become most popular especially for complex applications

  • To emphasize the impact and successful results of the proposed approach, subG-CQL, algorithm, it is compared with the three other methods given in literature, centralized Q-learning, semi-centralized Q-learning and decentralized Q-learning

  • Q-learning method provides optimal solution for robotic applications, but it is problematic to use in multi-robot domains

Read more

Summary

Introduction

With the rapid growth of technology, multi-robot systems (MRS) become most popular especially for complex applications. Auction-based task allocation approaches have advantages of implementation simplicity and distributed planning centralized decision-making ability [7]. As an example of learning-based coordination, robots use their past task allocation experiences for bidding future tasks [16]. One way to use QL in MRS is distributed learning approach in which the robots learn only for their own state-action pairs. The other way is centralized learning that works on joint state and joint action spaces Learning process takes place based on the feedback which is the measure of the changes in environment states as a result of agent’s action. In QL proposed by [22], an agent learns Q values of each state-action pair by using reward received as a feedback of its actions’ effect on environment states. Theoretical details of QL for both single-agent and multiagent cases are given below

Single agent Q-Learning
Multi agent Q-Learning
System structure
Performance metrics
Experimental results
Learning space dimension
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.