Edge-AI-Driven Learning-to-Rank for Decentralized Task Allocation in Circular Smart Manufacturing

• URL: http://arxiv.org/abs/2605.16433v1
• Date: Thu, 14 May 2026 20:38:25 GMT
• Title: Edge-AI-Driven Learning-to-Rank for Decentralized Task Allocation in Circular Smart Manufacturing
• Abstract summary: This work proposes an Edge-AI-driven decentralized task allocation framework based on ranking-aware negotiation.<n>A ranking-aware formulation finally reshapes the learning objective to align with the ordering-based nature of winner selection.<n>Results show improved delay and deadline adherence under high load, and enhanced energy efficiency under tighter constraints.
• Score: 54.4933359656657
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Task allocation in smart manufacturing systems needs to operate under decentralized decision-making, dynamic workloads, and shared resource constraints. In circular manufacturing settings, these challenges are further intensified by the need to balance operational efficiency with resource and energy sustainability. While learning-based approaches have been explored, many focus on predicting absolute performance metrics that do not necessarily translate into improved allocation outcomes, since decentralized assignment is governed by the relative ordering of candidate machines. This work proposes an Edge-AI-driven decentralized task allocation framework based on ranking-aware negotiation, where lightweight decision intelligence is embedded at the machine level to enable low-latency coordination without centralized control. The framework is developed progressively: a resource-aware heuristic first establishes the decentralized bidding structure, an Edge-AI-based regression model then provides learned local bid approximation, and a ranking-aware formulation finally reshapes the learning objective to align with the ordering-based nature of winner selection. Each machine evaluates incoming tasks using local information, including processing capability, queue state, and resource contention. The framework is evaluated via discrete-event simulation under high-load and tight-deadline scenarios using delay, deadline violations, throughput, and energy consumption. Results show improved delay and deadline adherence under high load, and enhanced energy efficiency under tighter constraints, leading to more resource-efficient operation aligned with circular manufacturing objectives. These findings demonstrate that aligning learning objectives with decentralized decision structures is critical for effective negotiation-driven task allocation.

Related papers

• EASy: Towards Efficient LLM-Based Agentic System [54.10819421625103]
  We propose EASy, a trainable agentic framework that jointly optimize task performance and computational efficiency through reinforcement learning.<n> EASy equips an LLM-based orchestrator with explicit knowledge of the capability and cost profiles of heterogeneous executors, enabling context-sensitive coordination beyond performance-only routing.<n>It further introduces a milestone-plan-act workflow that decomposes complex tasks into manageable milestones, constructs dependency-aware execution graphs, assigns suitable executors, and parallelizes independent steps while adapting subsequent decisions to intermediate outcomes.
  arXiv  Detail & Related papers  (2026-08-05T08:50:36Z)
• A Self-Calibrating Agentic AI Framework for Autonomous Edge Resource Allocation [2.131323683158522]
  Large Language Models (LLMs) are increasingly deployed as autonomous agents, transitioning from static conversational interfaces to dynamic systems capable of complex reasoning, tool execution, and decision-making.<n>We propose and experimentally evaluate an agentic AI framework, designed to enforce autonomous integrity within LLM-driven systems.<n>We design a self-calibration mechanism that mitigates drift and dynamically approximates ground truth by incorporating an ARIMA forecaster, without requiring continuous human oversight.
  arXiv  Detail & Related papers  (2026-07-24T15:21:54Z)
• Auction-Consensus Algorithm with Learned Bidding Scheme for Multi-Robot Systems [16.187002302872028]
  Auction-consensus algorithms provide scalable decentralized coordination with provable convergence.<n>This paper proposes a learning-enhanced auction-consensus framework in which CBBA's deterministic bidding mechanism is replaced by a neural bidding policy trained using reinforcement learning.<n> Experimental results across varying swarm sizes demonstrate that learned bidding policies can improve solution quality over classical CBBA.
  arXiv  Detail & Related papers  (2026-05-21T03:00:47Z)
• Decentralized Multi-Agent Goal Assignment for Path Planning using Large Language Models [7.94408712915778]
  This work addresses the problem of decentralized goal assignment for multi-agent path planning.<n>Agents independently generate ranked preferences over goals based on structured representations of the environment.<n>We compare greedys, optimal assignment, and large language model (LLM)-based agents in fully observable grid-world settings.
  arXiv  Detail & Related papers  (2025-10-27T20:05:56Z)
• Joint Optimization of Cooperation Efficiency and Communication Covertness for Target Detection with AUVs [105.81167650318054]
  This paper investigates underwater cooperative target detection using autonomous underwater vehicles (AUVs)<n>We first formulate a joint trajectory and power control optimization problem, and then present an innovative hierarchical action management framework to solve it.<n>Under the centralized training and decentralized execution paradigm, our target detection framework enables adaptive covert cooperation while satisfying both energy and mobility constraints.
  arXiv  Detail & Related papers  (2025-10-21T02:14:11Z)
• Benchmarking LLMs' Swarm intelligence [51.648605206159125]
  Large Language Models (LLMs) show potential for complex reasoning, yet their capacity for emergent coordination in Multi-Agent Systems (MAS) remains largely unexplored.<n>We introduce SwarmBench, a novel benchmark designed to systematically evaluate tasks of LLMs acting as decentralized agents.<n>We propose metrics for coordination effectiveness and analyze emergent group dynamics.
  arXiv  Detail & Related papers  (2025-05-07T12:32:01Z)
• A Local Information Aggregation based Multi-Agent Reinforcement Learning for Robot Swarm Dynamic Task Allocation [4.144893164317513]
  We introduce a novel framework using a decentralized partially observable Markov decision process (Dec_POMDP)<n>At the core of our methodology is the Local Information Aggregation Multi-Agent Deep Deterministic Policy Gradient (LIA_MADDPG) algorithm.<n>Our empirical evaluations show that the LIA module can be seamlessly integrated into various CTDE-based MARL methods.
  arXiv  Detail & Related papers  (2024-11-29T07:53:05Z)
• Merit-Based Sortition in Decentralized Systems [0.0]
  We introduce a simple algorithm for'merit-based sortition' We show that our algorithm boosts the quality metric describing the performance of the active set by $>2$ times the intrinsicity. This implies that merit-based sortition ensures a statistically significant performance boost to the drafted, 'active' set.
  arXiv  Detail & Related papers  (2024-11-11T19:00:31Z)
• Load Balancing in Federated Learning [3.2999744336237384]
  Federated Learning (FL) is a decentralized machine learning framework that enables learning from data distributed across multiple remote devices. This paper proposes a load metric for scheduling policies based on the Age of Information. We establish the optimal parameters of the Markov chain model and validate our approach through simulations.
  arXiv  Detail & Related papers  (2024-08-01T00:56:36Z)
• DRACO: Decentralized Asynchronous Federated Learning over Row-Stochastic Wireless Networks [7.389425875982468]
  We propose DRACO, a novel method for decentralized asynchronous Descent (SGD) over row-stochastic gossip wireless networks.<n>Our approach enables edge devices within decentralized networks to perform local training and model exchanging along a continuous timeline.<n>Our numerical experiments corroborate the efficacy of the proposed technique.
  arXiv  Detail & Related papers  (2024-06-19T13:17:28Z)
• Dif-MAML: Decentralized Multi-Agent Meta-Learning [54.39661018886268]
  We propose a cooperative multi-agent meta-learning algorithm, referred to as MAML or Dif-MAML. We show that the proposed strategy allows a collection of agents to attain agreement at a linear rate and to converge to a stationary point of the aggregate MAML. Simulation results illustrate the theoretical findings and the superior performance relative to the traditional non-cooperative setting.
  arXiv  Detail & Related papers  (2020-10-06T16:51:09Z)
• Decentralized Reinforcement Learning: Global Decision-Making via Local Economic Transactions [80.49176924360499]
  We establish a framework for directing a society of simple, specialized, self-interested agents to solve sequential decision problems. We derive a class of decentralized reinforcement learning algorithms. We demonstrate the potential advantages of a society's inherent modular structure for more efficient transfer learning.
  arXiv  Detail & Related papers  (2020-07-05T16:41:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.