Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.11025

Help | Advanced Search

Computer Science > Robotics

arXiv:2509.11025 (cs)
[Submitted on 14 Sep 2025 (v1) , last revised 16 Sep 2025 (this version, v2)]

Title: Multi-objective task allocation for electric harvesting robots: a hierarchical route reconstruction approach

Title: 多目标任务分配用于电动收获机器人:一种分层路径重构方法

Authors:Peng Chen, Jing Liang, Hui Song, Kang-Jia Qiao, Cai-Tong Yue, Kun-Jie Yu, Ponnuthurai Nagaratnam Suganthan, Witold Pedrycz
Abstract: The increasing labor costs in agriculture have accelerated the adoption of multi-robot systems for orchard harvesting. However, efficiently coordinating these systems is challenging due to the complex interplay between makespan and energy consumption, particularly under practical constraints like load-dependent speed variations and battery limitations. This paper defines the multi-objective agricultural multi-electrical-robot task allocation (AMERTA) problem, which systematically incorporates these often-overlooked real-world constraints. To address this problem, we propose a hybrid hierarchical route reconstruction algorithm (HRRA) that integrates several innovative mechanisms, including a hierarchical encoding structure, a dual-phase initialization method, task sequence optimizers, and specialized route reconstruction operators. Extensive experiments on 45 test instances demonstrate HRRA's superior performance against seven state-of-the-art algorithms. Statistical analysis, including the Wilcoxon signed-rank and Friedman tests, empirically validates HRRA's competitiveness and its unique ability to explore previously inaccessible regions of the solution space. In general, this research contributes to the theoretical understanding of multi-robot coordination by offering a novel problem formulation and an effective algorithm, thereby also providing practical insights for agricultural automation.
Abstract: 随着农业劳动力成本的增加,多机器人系统在果园采摘中的采用速度加快了。 然而,由于完成时间和能耗之间的复杂相互作用,尤其是在负载相关速度变化和电池限制等实际约束下,高效协调这些系统具有挑战性。 本文定义了多目标农业多电气机器人任务分配(AMERTA)问题,该问题系统地结合了这些常被忽视的实际约束。 为了解决这个问题,我们提出了一种混合分层路径重构算法(HRRA),该算法集成了几种创新机制,包括分层编码结构、双阶段初始化方法、任务序列优化器和专门的路径重构算子。 在45个测试实例上的大量实验表明,HRRA在七种最先进的算法中表现出色。 统计分析,包括Wilcoxon符号秩检验和Friedman检验,实证验证了HRRA的竞争性及其探索之前无法到达的解空间区域的独特能力。 总体而言,这项研究通过提供一种新的问题表述和一种有效的算法,促进了多机器人协调的理论理解,同时也为农业自动化提供了实用的见解。
Subjects: Robotics (cs.RO) ; Systems and Control (eess.SY)
Cite as: arXiv:2509.11025 [cs.RO]
  (or arXiv:2509.11025v2 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2509.11025
arXiv-issued DOI via DataCite

Submission history

From: Peng Chen [view email]
[v1] Sun, 14 Sep 2025 01:32:12 UTC (10,632 KB)
[v2] Tue, 16 Sep 2025 07:48:34 UTC (10,632 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
eess.SY
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.RO
cs.SY
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号