Hanjie Gu , Yanyong Feng , Deke Yu , Junwei Fang , Yuliang Sun , Fengjun Hu , Ezzeddine Touti
{"title":"HAC-FRL: A learning-driven distributed task allocation framework for large-scale warehouse automation","authors":"Hanjie Gu , Yanyong Feng , Deke Yu , Junwei Fang , Yuliang Sun , Fengjun Hu , Ezzeddine Touti","doi":"10.1016/j.ipm.2025.104430","DOIUrl":null,"url":null,"abstract":"<div><div>Hybrid Auction-Consensus with Fine-tuned Recurrent Learning (HAC-FRL) is a framework that is presented in this research for the purpose of distributed task allocation in large-scale warehouse automation. For the purpose of enhancing conflict resolution, accelerating recovery, and optimizing energy use, HAC-FRL incorporates proximal optimization with a mine blast algorithm for training data execution. Unlike previous approaches, which are plagued by agent conflicts, inefficient learning, and poor deadlock recovery, HAC-FRL gives robots the ability to dynamically alter their strategy prior to the assignment of tasks. When compared to baseline approaches, simulation trials using 1000 robots and 5000 tasks indicate considerable gains. These advantages include a 26.2 % increase in task success rate, a 1.24 % reduction in deadlocks, an 84 % faster recovery, a 38 % higher energy efficiency, and a 62 % lower message loss. In light of these findings, it is clear that HAC-FRL offers a solution that is both fault-tolerant and scalable, enabling multi-agent task allocation that is both reliable and efficient in terms of energy consumption for mission-critical systems. The system that has been suggested improves the dependability and scalability of warehouse automation by guaranteeing that learning is efficient and distributed coordination is resilient.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 2","pages":"Article 104430"},"PeriodicalIF":6.9000,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325003711","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Hybrid Auction-Consensus with Fine-tuned Recurrent Learning (HAC-FRL) is a framework that is presented in this research for the purpose of distributed task allocation in large-scale warehouse automation. For the purpose of enhancing conflict resolution, accelerating recovery, and optimizing energy use, HAC-FRL incorporates proximal optimization with a mine blast algorithm for training data execution. Unlike previous approaches, which are plagued by agent conflicts, inefficient learning, and poor deadlock recovery, HAC-FRL gives robots the ability to dynamically alter their strategy prior to the assignment of tasks. When compared to baseline approaches, simulation trials using 1000 robots and 5000 tasks indicate considerable gains. These advantages include a 26.2 % increase in task success rate, a 1.24 % reduction in deadlocks, an 84 % faster recovery, a 38 % higher energy efficiency, and a 62 % lower message loss. In light of these findings, it is clear that HAC-FRL offers a solution that is both fault-tolerant and scalable, enabling multi-agent task allocation that is both reliable and efficient in terms of energy consumption for mission-critical systems. The system that has been suggested improves the dependability and scalability of warehouse automation by guaranteeing that learning is efficient and distributed coordination is resilient.
期刊介绍:
Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing.
We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.