The digital twin synchronization problem: Framework, formulations, and analysis
本文正式定义了数字孪生同步问题，针对不可靠生产系统，用随机模型求解了状态无关、状态依赖和全信息三种同步策略，发现状态依赖策略接近最优且优于状态无关策略。
As the adoption of digital twins increases steadily, it is necessary to determine how to operate them most effectively and efficiently. In this article, the digital twin synchronization problem is introduced and defined formally. Frequent synchronizations would increase cost and data traffic congestion, whereas infrequent synchronizations would increase the bias of the predictions and yield wrong decisions. This work defines the synchronization problem variants in different contexts. To discuss the problem and its solution, the problem of determining when to synchronize an unreliable production system with its digital twin to minimize the average synchronization and bias costs is formulated and analyzed analytically. The state-independent, state-dependent, and full-information solutions have been determined by using a stochastic model of the system. Solving the synchronization problem using simulation is discussed, and an approximate policy is proposed. Our results show that the performance of the state-dependent policy is close to the optimal solution that can be obtained with full information and significantly better than the performance of the state-independent policy. Furthermore, the approximate periodic state-dependent policy yields near-optimal results. To operate digital twins more effectively, the digital twin synchronization problem must be considered and solved to determine the optimal synchronization policy.