Skip to content

Human-factor-state-aware Lightweight and Energy-efficient Real-time Task Scheduling Strategy for MEC-Empowered AI Quality Inspection Systems

Unknown authors
Sep 2026 · International journal of pattern recognition and artificial intelligence · 0 citations

TL;DR

Simulation results show that the proposed strategy converges rapidly and consistently outperforms benchmark schemes in latency and energy efficiency, while providing stronger adaptability to human-machine collaborative quality inspection scenarios.

Abstract

AI quality inspection is a key enabler of intelligent manufacturing, generating computation-intensive and latency-sensitive tasks that may overload resource-constrained inspection devices and affect production efficiency. Although Multi-Access Edge Computing (MEC) can reduce task execution delay by offloading workloads to nearby servers, dynamic wireless conditions, stochastic task arrivals, and human-in-the-loop intervention requirements make real-time scheduling highly challenging. To address this issue, this paper investigates a human-factor-state-aware MEC-enabled AI quality inspection system, where task offloading and computing resource allocation are jointly optimized with consideration of both system states and operator-related collaboration states. Specifically, the task scheduling problem is formulated as a Markov Decision Process (MDP), in which queue states, channel conditions, computing resource states, and human-factor indicators such as manual re-inspection pressure and collaboration urgency are jointly incorporated into the state space. To solve the resulting mixed discrete-continuous optimization problem, a tailored Deep Deterministic Policy Gradient (DDPG) algorithm is developed to generate real-time scheduling decisions for lightweight AI inspection tasks. In addition to minimizing long-term task latency and system energy consumption, the proposed method further suppresses collaboration delay and high-risk task backlog under dynamic industrial environments. Simulation results show that the proposed strategy converges rapidly and consistently outperforms benchmark schemes in latency and energy efficiency, while providing stronger adaptability to human-machine collaborative quality inspection scenarios.

View source

Similar papers

Aug 2026

Deep Reinforcement Learning-Based Age Aware Task Scheduling Algorithm for Computing Power Network

Computing power networks (CPNs) have emerged as a promising paradigm for supporting delay-sensitive and freshness-critical IoT services in the 6G era by jointly orchestrating heterogeneous networking and computing resources. However, existing scheduling schemes mainly focus on offloading decisions and computation-node...

Wen-Tao Liu, Si-Qi Chen, Yun-Cai Cheng · 0 citations
Open access Aug 2026

MPTS: A Multi-Queue Priority-Based Task Scheduling Algorithm to Reduce Delay in Fog Computing for Lightweight IoT Devices

Simulation results demonstrate that MPTS significantly enhances Quality of Service (QoS) by jointly optimizing delay, network utilization, and energy consumption, making it well suited for delay-sensitive and resource-constrained fog-enabled IoT applications.

Annu Malik, Rashmi Kushwah · 0 citations
Oct 2026

Latency-Aware Optimal Scheduling Scheme for Computational Offloading

Proactive safety and vehicle automation typically requires high energy use from sensors and energy-intensive computing from sensor data processing. For high-quality, reliable perception and localization within a driving environment at the vehicle level, incoming data from multiple sensors need to be fused using adv...

Sachin Sharma, Richard T. Meyer, Ben Feinberg et al. · 0 citations
Sep 2026

Mobility and Reliability-Aware Task Offloading in Dynamic MEC-IoT Networks using Primal-Dual RL

Dynamic task offloading in Multi-access Edge Computing (MEC)-enabled IoT networks is challenging due to timevarying wireless channels, mobility, limited device energy, and unreliable MEC service conditions. Existing works mainly optimize delay and energy, but many of them do not jointly consider mobility-driven connect...

Rajasekhar Dasari, S. Nayak · 0 citations
Open access Oct 2026

Workload- and Event-Adaptive Dual-Mode Scheduling with Recovery-Aware Service Control for Smart Home Controllers

Smart home gateways execute routine automation and emergency workloads on centralized, resource-constrained controllers. Under overload or dynamic workloads, conventional static scheduling policies may allow routine jobs to delay high-criticality tasks. This article presents RT-DASH, a dual-mode scheduling framework fo...

Mysha Nishat Bidhu, Jalil Boudjadar · 0 citations
Open access 2026

LEAOT: Load-, Deadline-, Latency-, and Energy-Aware Task Offloading for Scalable IoT Edge–Cloud Systems

LEAOT is proposed, a lightweight load- and deadline-aware task offloading method for IoT edge–cloud systems that reduces deadline violation to 0.69% and maintains low energy under the reference setting, while remaining competitive with delay-resource and drift-plus-penalty baselines.

Ayman Noor · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.