AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.9 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

An Online Optimization of Prediction-Enhanced Digital Twin Migration over Edge Computing with Adaptive Information Updating

Xinyu Yu1Lucheng Chen2,3Xingzhi Feng2,4Xiaoping Lu2,4( )Yuye Yang1You Shi5( )
School of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, 211106, China
State Key Laboratory of Massive Personalized Customization System and Technology, Qingdao, 266100, China
COSMOPlat Institute of Industrial Intelligence (Qingdao) Co., Ltd., Qingdao, 266100, China
COSMOPlat IoT Technology Co., Ltd., Qingdao, 266103, China
College of Electrical Engineering and Control Science, Nanjing Tech University, Nanjing, 211816, China
Show Author Information

Abstract

This paper investigates mobility-aware online optimization for digital twin (DT)-assisted task execution in edge computing environments. In such systems, DTs, hosted on edge servers (ESs), require proactive migration to maintain proximity to their mobile physical twin (PT) counterparts. To minimize task response latency under a stringent energy consumption constraint, we jointly optimize three key components: the status data uploading frequency from the PT, the DT migration decisions, and the allocation of computational and communication resources. To address the asynchronous nature of these decisions, we propose a novel two-timescale mobility-aware online optimization (TMO) framework. The TMO scheme leverages an extended two-timescale Lyapunov optimization framework to decompose the long-term problem into sequential subproblems. At the larger timescale, a multi-armed bandit (MAB) algorithm is employed to dynamically learn the optimal status data uploading frequency. Within each shorter timescale, we first employ a gated recurrent unit (GRU)-based predictor to forecast the PT’s trajectory. Based on this prediction, an alternate minimization (AM) algorithm is then utilized to solve for the DT migration and resource allocation variables. Theoretical analysis confirms that the proposed TMO scheme is asymptotically optimal. Furthermore, simulation results demonstrate its significant performance gains over existing benchmark methods.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 3231-3252

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Yu X, Chen L, Feng X, et al. An Online Optimization of Prediction-Enhanced Digital Twin Migration over Edge Computing with Adaptive Information Updating. Computers, Materials & Continua, 2025, 85(2): 3231-3252. https://doi.org/10.32604/cmc.2025.066975

288

Views

4

Downloads

3

Crossref

3

Web of Science

3

Scopus

Received: 22 April 2025
Accepted: 11 July 2025
Published: 23 September 2025
© The Author 2024.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.