Robotics paper index

DAG-Based QoS-Aware Dynamic Task Placement for Networked Multi-Stage Control Pipelines

2026-05-19 · arXiv: 2605.19887

One-line summary

Proposes a DAG-based QoS-aware dynamic task placement framework for robotics.

Engineering notes

This framework could significantly enhance robotic task scheduling in real-time applications, improving performance in industrial automation scenarios with strict latency requirements.

Chinese explanation / 中文解读

本论文提出了一种基于有向无环图(DAG)的动态任务放置框架,旨在解决网络化多阶段控制管道中对感知、规划和控制任务的动态调度问题。通过分析计算成本、通信延迟等多种因素,提出了一种质量保障(QoS)导向的方法,以应对在工业环境中面临的时代敏感性挑战。

Original abstract

Current Physical AI (PAI) relies heavily on closed-loop visual-servoing pipelines, whose perception and planning stages may become computationally intensive onboard due to complex models embedded on robots. In practice, offloading the perception task to on-site edges statically is inappropriate for latency-sensitive, precise industrial settings over a standardized industrial network. This emphasizes the importance of Control-Communication-Computing (3C) co-design in industrial automation: monolithic local execution saturates AI-accelerated machine and robot hardware, while static edge offloading exposes the control loop to network jitter. Existing adaptive task placement (ATP) controllers can partially address the gap by relocating a single pipeline stage on binary threshold rules, without a multi-stage model and an explicit cost on placement switching. In this Work-in-Progress (WiP) paper, we propose a directed acyclic graph (DAG) based quality-of-service (QoS)-aware dynamic task placement (DTP) framework for sensing-perception-planning-control pipelines in networked robotics. This pipeline is formalized as a DAG with task-level and node-level attributes for compute cost, communication delay, and feasible placement sets; over a small interpretable candidate set (fully local, static offload, hybrid), a window-based cost function combines tail end-to-end latency, deadline violation rate, hardware utilization, and a Hamming-distance switching penalty, and a DTP algorithm with hysteresis and a minimum dwell-time bounds placement chatter. Our WiP paper presents the theoretical framework, a structured qualitative analysis, and a two-phase simulation plus hardware-in-the-loop validation roadmap.

5.0Engineering value
7.0Research novelty
4.0Business relevance

Links and sources

Need this topic turned into a technical roadmap?

Robot Papers can prepare a custom robotics literature review, code map, dataset map, and B2B technology assessment.

Request B2B research

Comments

No comments yet. Be the first to share your thoughts on this paper.
Login or register to leave a comment