基于多目标教学学习的多喂食机器人任务分配问题优化器

IF 6.6 1区 计算机科学 Q1 Multidisciplinary Tsinghua Science and Technology Pub Date : 2024-03-02 DOI:10.26599/TST.2023.9010075
Nianbo Kang;Zhonghua Miao;Quan-Ke Pan;Weimin Li;M. Fatih Tasgetiren
{"title":"基于多目标教学学习的多喂食机器人任务分配问题优化器","authors":"Nianbo Kang;Zhonghua Miao;Quan-Ke Pan;Weimin Li;M. Fatih Tasgetiren","doi":"10.26599/TST.2023.9010075","DOIUrl":null,"url":null,"abstract":"With the emergence of the artificial intelligence era, all kinds of robots are traditionally used in agricultural production. However, studies concerning the robot task assignment problem in the agriculture field, which is closely related to the cost and efficiency of a smart farm, are limited. Therefore, a Multi-Weeding Robot Task Assignment (MWRTA) problem is addressed in this paper to minimize the maximum completion time and residual herbicide. A mathematical model is set up, and a Multi-Objective Teaching-Learning-Based Optimization (MOTLBO) algorithm is presented to solve the problem. In the MOTLBO algorithm, a heuristic-based initialization comprising an improved Nawaz Enscore, and Ham (NEH) heuristic and maximum load-based heuristic is used to generate an initial population with a high level of quality and diversity. An effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule. A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the algorithm. Finally, a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the literature. Experimental results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 5","pages":"1249-1265"},"PeriodicalIF":6.6000,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10517982","citationCount":"0","resultStr":"{\"title\":\"Multi-Objective Teaching-Learning-Based Optimizer for a Multi-Weeding Robot Task Assignment Problem\",\"authors\":\"Nianbo Kang;Zhonghua Miao;Quan-Ke Pan;Weimin Li;M. Fatih Tasgetiren\",\"doi\":\"10.26599/TST.2023.9010075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the emergence of the artificial intelligence era, all kinds of robots are traditionally used in agricultural production. However, studies concerning the robot task assignment problem in the agriculture field, which is closely related to the cost and efficiency of a smart farm, are limited. Therefore, a Multi-Weeding Robot Task Assignment (MWRTA) problem is addressed in this paper to minimize the maximum completion time and residual herbicide. A mathematical model is set up, and a Multi-Objective Teaching-Learning-Based Optimization (MOTLBO) algorithm is presented to solve the problem. In the MOTLBO algorithm, a heuristic-based initialization comprising an improved Nawaz Enscore, and Ham (NEH) heuristic and maximum load-based heuristic is used to generate an initial population with a high level of quality and diversity. An effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule. A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the algorithm. Finally, a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the literature. Experimental results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.\",\"PeriodicalId\":48690,\"journal\":{\"name\":\"Tsinghua Science and Technology\",\"volume\":\"29 5\",\"pages\":\"1249-1265\"},\"PeriodicalIF\":6.6000,\"publicationDate\":\"2024-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10517982\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tsinghua Science and Technology\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10517982/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Multidisciplinary\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10517982/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Multidisciplinary","Score":null,"Total":0}
引用次数: 0

摘要

随着人工智能时代的到来,各种机器人被广泛应用于农业生产。然而,农业领域的机器人任务分配问题与智能农场的成本和效率密切相关,相关研究却十分有限。因此,本文探讨了一个多播种机器人任务分配(MWRTA)问题,以最小化最大完成时间和残留除草剂。本文建立了一个数学模型,并提出了一种基于多目标教学学习的优化算法(MOTLBO)来解决该问题。在 MOTLBO 算法中,采用了一种基于启发式的初始化方法,包括改进的 Nawaz Enscore, and Ham (NEH) 启发式和基于最大负荷的启发式,以生成一个具有高质量和多样性的初始种群。通过动态分组机制和重新定义的个体更新规则,设计了一个有效的基于教学的优化过程。提供了一种基于多邻域的局部搜索策略,以平衡算法的开发和探索。最后,我们进行了一项综合实验,将所提出的算法与文献中几种最先进的算法进行了比较。实验结果表明,所提出的算法在解决所考虑的问题方面具有明显的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-Objective Teaching-Learning-Based Optimizer for a Multi-Weeding Robot Task Assignment Problem
With the emergence of the artificial intelligence era, all kinds of robots are traditionally used in agricultural production. However, studies concerning the robot task assignment problem in the agriculture field, which is closely related to the cost and efficiency of a smart farm, are limited. Therefore, a Multi-Weeding Robot Task Assignment (MWRTA) problem is addressed in this paper to minimize the maximum completion time and residual herbicide. A mathematical model is set up, and a Multi-Objective Teaching-Learning-Based Optimization (MOTLBO) algorithm is presented to solve the problem. In the MOTLBO algorithm, a heuristic-based initialization comprising an improved Nawaz Enscore, and Ham (NEH) heuristic and maximum load-based heuristic is used to generate an initial population with a high level of quality and diversity. An effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule. A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the algorithm. Finally, a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the literature. Experimental results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Tsinghua Science and Technology
Tsinghua Science and Technology COMPUTER SCIENCE, INFORMATION SYSTEMSCOMPU-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
10.20
自引率
10.60%
发文量
2340
期刊介绍: Tsinghua Science and Technology (Tsinghua Sci Technol) started publication in 1996. It is an international academic journal sponsored by Tsinghua University and is published bimonthly. This journal aims at presenting the up-to-date scientific achievements in computer science, electronic engineering, and other IT fields. Contributions all over the world are welcome.
期刊最新文献
Contents Front Cover LP-Rounding Based Algorithm for Capacitated Uniform Facility Location Problem with Soft Penalties A P4-Based Approach to Traffic Isolation and Bandwidth Management for 5G Network Slicing Quantum-Inspired Sensitive Data Measurement and Secure Transmission in 5G-Enabled Healthcare Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1