Papers for

digital twin developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Tucker-based model speeds up repeated simulations for design and analysis

A Product-Grassmann Tucker Surrogate for Parametric Field Prediction

Abstract: Many-query applications such as design optimization, uncertainty quantification and digital twins call for repeated full-field predictions from expensive partial differential equation (PDE) simulations. Grassmannian reduced-order models interpolate parameter-dependent subspaces but commonly vectorize the spatial field, and the ambient dimension then grows with the product of the grid sizes. Tensor-based models preserve the multiway structure but often use shared mode-wise bases or a fixed core across parameters. We propose a Tucker-based surrogate that keeps the spatial directions and time as separate modes. The factor subspaces are interpolated on a product Grassmann manifold, Procrustes alignment places the Tucker cores in one coordinate system, and a truncated singular value decomposition models their variation. Across five PDE benchmarks in two and three spatial dimensions, including public computational fluid dynamics data, the interpolation size is reduced by factors of 13 to 482 and the stored model by factors of 13 to 464 relative to a single-subspace Grassmannian surrogate with the same local interpolation. Cached queries run 3.3 to 8.5 times faster, the mean errors over ten resampled splits differ by at most 0.22 percentage points (0.36 when every model choice is re-selected inside each split), and the prediction-error terms of the two methods differ by less than 0.1 percentage points. The remaining accuracy differences are consistent with the larger representation error of the Tucker format. In a three-dimensional grid study the interpolation-size ratio rises to 2,260 and the query speedup to 11.9 at 64^3.

Sun 25 OctComputational Engineering, Finance, and Science
The gist
Simulating complex physical phenomena often requires time-consuming computer calculations repeated many times, such as for design or uncertainty testing. The authors developed a mathematical shortcut that breaks down these simulations into parts and smoothly combines them, preserving important structures in space and time. This approach reduces the amount of data to store and speeds up making predictions while keeping errors very low. It works well across various example problems including fluid flow, making repeated full predictions much faster and smaller in size.
Open → 2610.34559v1

Sparse topometric graph improves indoor navigation across sessions

A Sparse Topometric Graph for Scalable Cross-Session Indoor Navigation

Abstract: A conventional embodied agent in an indoor environment builds a map by accumulating noisy real-world measurements and results from heavy inference to guide navigation. While the detailed measurements may differ due to scene changes or sensor settings, the unique topological structure of navigable passages or the connectivity between rooms may provide training-free guidance that complements local observations. We propose a sparse topometric graph as an efficient structural representation for robust indoor navigation, alleviating the need for fine-grained matching, which is computationally expensive, memory-intensive, and prone to real-world variations. The map consists of nodes that encode local 3D geometry and distance-weighted edges that capture traversable connectivity. A learned graph-matching network finds consistent subgraph structures across sessions by considering both node-level geometric descriptors and neighborhood connectivity. The holistic contextual matching is robust to local ambiguities caused by weak distinctiveness or repetitive structure, and establishes stable correspondences despite local scene changes, different sensor modalities, or limited spatial overlap. We analyze the practicality of the graph through cross-session point-goal navigation, where a goal specified in a prior reference map must be reached from an unknown initial pose in a later session. Experiments show that our method achieves the highest success rates (77.1% on Gibson and 40.0% under 3D-FRONT scene changes), while reducing memory by more than two orders of magnitude compared to point-level representations. The proposed approach further supports cross-session alignment and goal-directed navigation with strong scalability and robust real-world transfer.

Thu 22 OctRoboticsComputer Vision and Pattern Recognition
The gist
Indoor navigation is hard because maps can get outdated or noisy from changing rooms or different sensors. The authors propose a compact map made of important spots connected like a graph, capturing how rooms connect rather than every tiny detail. They use a special network to match parts of these graphs even if the environment changes or sensors differ, which helps the robot know where to go using previous maps without retraining. Their method is more memory-efficient and works well in tests with changing environments.
Open → 2610.31432v1

Local large language models generate digital twin reports efficiently

DTScribe: Generating Models for Digital Twin Reporting using Local Large Language Models

Abstract: The development of a digital twin brings together many stakeholders and technical components. We have previously investigated the reporting of the conceptual architecture for these digital twins as an artifact for discussion. However, we find that the activity of modeling the digital twin for visualization and consensus-building can be quite tedious and time-consuming. In this article, we explore the automation of model generation using large language models, targeting the model required for digital twin reporting. Our approach is designed to ingest digital twin documents and output both the conceptual architecture visualization and a reporting page for that digital twin. We first extract from the input the key details aligning with our twenty-one-characteristic Digital Twin Description Framework described in previous work. Then, we generate a description model in the Ontological Modeling Language, representing the digital twin as a constellation of models, data, enablers, and services. We utilize refinement loops with large language models acting as judges and ontological reasoning to increase artifact quality as measured by our metrics. We investigate how architectural and parameter choices affect artifact quality, such as how refinement loops enable local large language models to produce sufficiently high-quality results comparable to larger models. We also detail insights and lessons learned useful for practitioners, such that they can integrate our techniques to accelerate their digital twin reporting or for other model generation tasks. These insights include the use of medium-sized local models (around 20 billion parameters), the avoidance of large language models as judges and clustering for characteristic extraction, and the recommendation of at least two reasoner loops for Ontological Modeling Language refinement.

Tue 13 OctSoftware EngineeringArtificial Intelligence
The gist
Creating digital twins—detailed computer models of real-world objects or systems—requires a lot of manual work to make visual models and reports. The authors found a way to use large language models running locally on computers to automate this process by reading documents and producing detailed models and reports. Their method improves the model quality through repeated checking and reasoning steps, which makes the automated reports almost as good as ones made with bigger, more expensive AI models. They also share practical advice on which models and techniques work best for this task, helping others save time when documenting digital twins.
Open → 2610.18635v1