Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index; 8 of the 33 sources its claims cite were checked for support.

Orchestrating Joint Offloading and Scheduling for Low-Latency Edge SLAM

Open access
Zhang, Yao, Mao, Yuyi, Wang, Hui, Yu, Zhiwen, Guo, Song, Zhang, Jun, Wang, Liang, Guo, Bin · 2025 · IEEE Transactions on Mobile Computing

Abstract

Visual Simultaneous Localization and Mapping (vSLAM) is a prevailing technology for many emerging robotic applications. Achieving real-time SLAM on mobile robotic systems with limited computational resources is challenging because the complexity of SLAM algorithms increases over time. This restriction can be lifted by offloading computations to edge servers, forming the emerging paradigm ofedge-assisted SLAM. Nevertheless, the exogenous and stochastic input processes affect the dynamics of the edge-assisted SLAM system. Moreover, the requirements of clients on SLAM metrics change over time, exerting implicit and time-varying effects on the system. In this paper, we aim to push the limit beyond existing edge-assist SLAM by proposing a new architecture that can handle the input-driven processes and also satisfy clients’ implicit and time-varying requirements. The key innovations of our work involve a regional feature prediction method for importance-aware local data processing, a configuration adaptation policy that integrates data compression/decompression and task offloading, and an input-dependent learning framework for task scheduling with constraint satisfaction. Extensive experiments prove that our architecture improves pose estimation accuracy and saves up to 47% of communication costs compared with a popular edge-assisted SLAM system, as well as effectively satisfies the clients’ requirements.

Overview

CoChat Summary

TL;DR

The paper proposes a new edge-assisted vSLAM architecture that jointly orchestrates tile-level compression adaptation and multi-server task scheduling using DRL and an input-dependent Gaussian process. It reports improved localization stability, lower end-to-end latency, and better satisfaction of implicit, time-varying user requirements than a popular edge-SLAM baseline.

Key findings

The abstract claims the architecture improves pose estimation accuracy and saves up to 47% of communication costs compared with a popular edge-assisted SLAM system. In experiments, it reduces E2E latency by about 47% on real-measured network traces and by 24.5% on simulated network traces. Localization results show more concentrated absolute pose error (APE) than edge-SLAM, indicating more stable and accurate localization. The constrained-RL scheduler with input-dependent GP satisfies user requirements in most episodes and outperforms Input-Dependent RL and Decima; Input-Dependent RL performs worst, with results near 17.5 under fixed links and about 28 under random links.

Methods

The architecture uses ORB-SLAM2 as the underlying pipeline and comprises regional feature prediction, encoder/decoder, SLAM processing pipeline, configuration adaptation, and scheduler. Regional feature prediction partitions frames into 9×15 tiles with sample interval k=4, uses LeNet with two importance levels, SGD at learning rate 0.001, and cross entropy; encoder/decoder uses H.264 with resolution options {1, 0.9, 0.8, 0.7, 0.6} and QP options {20, 24, 28, 32, 36}. Configuration adaptation uses A3C with 16 parallel agents; scheduling uses constrained RL with an input-dependent GP and A3C with two hidden layers of 200 and 128 neurons, also with 16 parallel agents. Data include KITTI visual odometry sequences, 9000 samples from 3G/HSDPA traces split into 16 traces (10 train, 6 test), and 3000 simulated 4G/5G samples split into 12 traces (10 train, 2 test); multi-server scheduling is evaluated in a simulator extended from a Spark job simulator with 10 edge servers.

Limitations

The paper states that the multi-server simulator is developed for offline scheduler training, uses synthetic trajectories while assuming optimality of other components to isolate scheduling performance, and involves only a single user requesting edge services. It also states that feedback latency is omitted, that results differ from converged training because different random seeds are used, and that optimal scheduling depends on the fitting performance of the input-dependent GP. Evident from the text: there is no real-world multi-server deployment, and the evaluation relies on KITTI frames plus real-measured or simulated network traces rather than a broader field trial.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1109/tmc.2025.3547256

Cites

60 of 60 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

4 Valid · 13 Not valid · 11 Not checked · 82 Own results and interpretations

40 more claims

Create a free account to see all 110 claims and to verify the 1 reference still open.

See all claims — free account
  • It may state two separate claims as one. 32
  • Probably not a substantial claim. 42

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Show all 55 references

Research works printed but not linked: 5

  1. Ahmad, CarMap: Fast 3D feature map updates for automobiles, 1063
  2. Xu, Swarmmap: Scaling up real-time collaborative visual SLAM at the edge, 977
  3. Can, Joint configuration adaptation and bandwidth allocation for edge-assisted real-time video analytics, 257
  4. Sutton, 2018, Reinforcement Learning: An Introduction
  5. Williams, 2006, Gaussian Processes for Machine Learning, 2

Cited by

See all 1

Metadata

Authors
Zhang, Y., Mao, Y., Wang, H., Yu, Z., Guo, S., Zhang, J., Wang, L., & Guo, B.
Affiliations
  • Northwestern Polytechnical University (CN)
  • Macau University of Science and Technology (MO)
  • Harbin Engineering University (CN)
  • Hong Kong University of Science and Technology (HK)
Venue
IEEE Transactions on Mobile Computing
Published
2025-08
Volume
24
Issue
8
Pages
6901-6917
ISSN
  • 1536-1233 (ISSN-L)
  • 1558-0660
  • 2161-9875
OpenAlex
W4408124973
Cited by
1
References
55
Citations by year
2025: 1
FWCI
0.38
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Mobile Computing (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotics and Automated Systems
Keywords
visual SLAM, task offloading, task scheduling, mobile robots, data compression, constraint satisfaction, communication cost reduction, pose estimation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Orchestrating Joint Offloading and Scheduling for Low-Latency Edge SLAM. https://app.cochat.ai/papers/10.1109/tmc.2025.3547256
The paper
Zhang, Y., Mao, Y., Wang, H., Yu, Z., Guo, S., Zhang, J., Wang, L., & Guo, B. (2025). Orchestrating Joint Offloading and Scheduling for Low-Latency Edge SLAM. IEEE Transactions on Mobile Computing. https://doi.org/10.1109/tmc.2025.3547256

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.