Distributed Reinforcement Learning for Optimizing Resource Allocation in Autonomous Logistics Processes

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper examines multi-agent coordination for resource allocation tasks in autonomous logistics processes. It identifies requirements for the learning of optimal behavior in a multi-agent setting. Based on a real-world logistics application, the paper distinguishes between single resource allocation by independent agents and joint activities by agent teams. For both cases it introduces adaptations of the Q-learning algorithm and evaluates their convergence as well as their scalability for large scenarios. The results demonstrate that the known conditions for the convergence of multi-agent reinforcement learning are insufficient. This leads to the identification of an additional requirement for convergence in this paper.

Cite

CITATION STYLE

APA

Berndt, J. O., & Herzog, O. (2013). Distributed Reinforcement Learning for Optimizing Resource Allocation in Autonomous Logistics Processes. In Lecture Notes in Logistics (pp. 429–439). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-642-35966-8_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free