基于强化学习的农业多机器人集群任务分配优化方法

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Zaiwang Lu , Yancong Wang , Feng Dai , Yike Ma , Long Long , Zixu Zhao , Yucheng Zhang , Jintao Li
{"title":"基于强化学习的农业多机器人集群任务分配优化方法","authors":"Zaiwang Lu ,&nbsp;Yancong Wang ,&nbsp;Feng Dai ,&nbsp;Yike Ma ,&nbsp;Long Long ,&nbsp;Zixu Zhao ,&nbsp;Yucheng Zhang ,&nbsp;Jintao Li","doi":"10.1016/j.compeleceng.2024.109752","DOIUrl":null,"url":null,"abstract":"<div><div>The Agricultural multi-robot task allocation (AMRTA) can allocate the optimal operation sequence for the cluster of agricultural robots and improve overall operational efficiency, which is an important research direction for the development of intelligent agriculture. In this paper, we first analyzed the practical requirements of multi-robot task allocation in agriculture and reformulate it as Node Workload-Constrained Multi Traveling Salesman Problem (NWC-MTSP), aiming to minimize the maximum operating time of sub-robots while ensuring a balanced distribution of workload as much as possible. Then, we implemented path planning algorithm required for task allocation and constructed an objective function based on it; we also constructed a graph structure containing workloads of nodes, used graph neural networks to obtain node feature information, and propose a Reinforcement Learning-based Attention Mechanism Policy Optimization Network (NWC-APONet) method to find the optimal allocation scheme. Finally, our model evaluated using real agricultural datasets, i.e., the TSPLIB public dataset and random datasets. Experiments results demonstrate that NWC-APONet achieves superior task allocation, which prove our model’s practical applicability and effectiveness in AMRTA.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"120 ","pages":"Article 109752"},"PeriodicalIF":4.0000,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A reinforcement learning-based optimization method for task allocation of agricultural multi-robots clusters\",\"authors\":\"Zaiwang Lu ,&nbsp;Yancong Wang ,&nbsp;Feng Dai ,&nbsp;Yike Ma ,&nbsp;Long Long ,&nbsp;Zixu Zhao ,&nbsp;Yucheng Zhang ,&nbsp;Jintao Li\",\"doi\":\"10.1016/j.compeleceng.2024.109752\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The Agricultural multi-robot task allocation (AMRTA) can allocate the optimal operation sequence for the cluster of agricultural robots and improve overall operational efficiency, which is an important research direction for the development of intelligent agriculture. In this paper, we first analyzed the practical requirements of multi-robot task allocation in agriculture and reformulate it as Node Workload-Constrained Multi Traveling Salesman Problem (NWC-MTSP), aiming to minimize the maximum operating time of sub-robots while ensuring a balanced distribution of workload as much as possible. Then, we implemented path planning algorithm required for task allocation and constructed an objective function based on it; we also constructed a graph structure containing workloads of nodes, used graph neural networks to obtain node feature information, and propose a Reinforcement Learning-based Attention Mechanism Policy Optimization Network (NWC-APONet) method to find the optimal allocation scheme. Finally, our model evaluated using real agricultural datasets, i.e., the TSPLIB public dataset and random datasets. Experiments results demonstrate that NWC-APONet achieves superior task allocation, which prove our model’s practical applicability and effectiveness in AMRTA.</div></div>\",\"PeriodicalId\":50630,\"journal\":{\"name\":\"Computers & Electrical Engineering\",\"volume\":\"120 \",\"pages\":\"Article 109752\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Electrical Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0045790624006797\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790624006797","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

农业多机器人任务分配(AMRTA)可以为农业机器人集群分配最优作业序列,提高整体作业效率,是智能农业发展的重要研究方向。本文首先分析了农业领域多机器人任务分配的实际需求,并将其重新表述为节点工作量约束的多旅行推销员问题(NWC-MTSP),目的是在保证工作量均衡分配的前提下,尽可能减少子机器人的最大作业时间。然后,我们实现了任务分配所需的路径规划算法,并在此基础上构建了目标函数;我们还构建了包含节点工作量的图结构,利用图神经网络获取节点特征信息,并提出了基于强化学习的注意机制策略优化网络(NWC-APONet)方法,以找到最优分配方案。最后,我们利用真实的农业数据集(即 TSPLIB 公共数据集和随机数据集)对模型进行了评估。实验结果表明,NWC-APONet 实现了更优越的任务分配,证明了我们的模型在 AMRTA 中的实用性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A reinforcement learning-based optimization method for task allocation of agricultural multi-robots clusters
The Agricultural multi-robot task allocation (AMRTA) can allocate the optimal operation sequence for the cluster of agricultural robots and improve overall operational efficiency, which is an important research direction for the development of intelligent agriculture. In this paper, we first analyzed the practical requirements of multi-robot task allocation in agriculture and reformulate it as Node Workload-Constrained Multi Traveling Salesman Problem (NWC-MTSP), aiming to minimize the maximum operating time of sub-robots while ensuring a balanced distribution of workload as much as possible. Then, we implemented path planning algorithm required for task allocation and constructed an objective function based on it; we also constructed a graph structure containing workloads of nodes, used graph neural networks to obtain node feature information, and propose a Reinforcement Learning-based Attention Mechanism Policy Optimization Network (NWC-APONet) method to find the optimal allocation scheme. Finally, our model evaluated using real agricultural datasets, i.e., the TSPLIB public dataset and random datasets. Experiments results demonstrate that NWC-APONet achieves superior task allocation, which prove our model’s practical applicability and effectiveness in AMRTA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信