Cargando…
Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning
This paper presents a multi-agent reinforcement learning (MARL) algorithm to address the scheduling and routing problems of multiple automated guided vehicles (AGVs), with the goal of minimizing overall energy consumption. The proposed algorithm is developed based on the multi-agent deep determinist...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10301467/ https://www.ncbi.nlm.nih.gov/pubmed/37420781 http://dx.doi.org/10.3390/s23125615 |
_version_ | 1785064818759172096 |
---|---|
author | Ye, Xianfeng Deng, Zhiyun Shi, Yanjun Shen, Weiming |
author_facet | Ye, Xianfeng Deng, Zhiyun Shi, Yanjun Shen, Weiming |
author_sort | Ye, Xianfeng |
collection | PubMed |
description | This paper presents a multi-agent reinforcement learning (MARL) algorithm to address the scheduling and routing problems of multiple automated guided vehicles (AGVs), with the goal of minimizing overall energy consumption. The proposed algorithm is developed based on the multi-agent deep deterministic policy gradient (MADDPG) algorithm, with modifications made to the action and state space to fit the setting of AGV activities. While previous studies overlooked the energy efficiency of AGVs, this paper develops a well-designed reward function that helps to optimize the overall energy consumption required to fulfill all tasks. Moreover, we incorporate the e-greedy exploration strategy into the proposed algorithm to balance exploration and exploitation during training, which helps it converge faster and achieve better performance. The proposed MARL algorithm is equipped with carefully selected parameters that aid in avoiding obstacles, speeding up path planning, and achieving minimal energy consumption. To demonstrate the effectiveness of the proposed algorithm, three types of numerical experiments including the ϵ-greedy MADDPG, MADDPG, and Q-Learning methods were conducted. The results show that the proposed algorithm can effectively solve the multi-AGV task assignment and path planning problems, and the energy consumption results show that the planned routes can effectively improve energy efficiency. |
format | Online Article Text |
id | pubmed-10301467 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-103014672023-06-29 Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning Ye, Xianfeng Deng, Zhiyun Shi, Yanjun Shen, Weiming Sensors (Basel) Article This paper presents a multi-agent reinforcement learning (MARL) algorithm to address the scheduling and routing problems of multiple automated guided vehicles (AGVs), with the goal of minimizing overall energy consumption. The proposed algorithm is developed based on the multi-agent deep deterministic policy gradient (MADDPG) algorithm, with modifications made to the action and state space to fit the setting of AGV activities. While previous studies overlooked the energy efficiency of AGVs, this paper develops a well-designed reward function that helps to optimize the overall energy consumption required to fulfill all tasks. Moreover, we incorporate the e-greedy exploration strategy into the proposed algorithm to balance exploration and exploitation during training, which helps it converge faster and achieve better performance. The proposed MARL algorithm is equipped with carefully selected parameters that aid in avoiding obstacles, speeding up path planning, and achieving minimal energy consumption. To demonstrate the effectiveness of the proposed algorithm, three types of numerical experiments including the ϵ-greedy MADDPG, MADDPG, and Q-Learning methods were conducted. The results show that the proposed algorithm can effectively solve the multi-AGV task assignment and path planning problems, and the energy consumption results show that the planned routes can effectively improve energy efficiency. MDPI 2023-06-15 /pmc/articles/PMC10301467/ /pubmed/37420781 http://dx.doi.org/10.3390/s23125615 Text en © 2023 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Ye, Xianfeng Deng, Zhiyun Shi, Yanjun Shen, Weiming Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning |
title | Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning |
title_full | Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning |
title_fullStr | Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning |
title_full_unstemmed | Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning |
title_short | Toward Energy-Efficient Routing of Multiple AGVs with Multi-Agent Reinforcement Learning |
title_sort | toward energy-efficient routing of multiple agvs with multi-agent reinforcement learning |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10301467/ https://www.ncbi.nlm.nih.gov/pubmed/37420781 http://dx.doi.org/10.3390/s23125615 |
work_keys_str_mv | AT yexianfeng towardenergyefficientroutingofmultipleagvswithmultiagentreinforcementlearning AT dengzhiyun towardenergyefficientroutingofmultipleagvswithmultiagentreinforcementlearning AT shiyanjun towardenergyefficientroutingofmultipleagvswithmultiagentreinforcementlearning AT shenweiming towardenergyefficientroutingofmultipleagvswithmultiagentreinforcementlearning |