Subspace graph networks for real-time granular flow simulation with applications to machine-terrain interactions
Bibliographic record
Abstract
Granular flows interacting with rigid bodies are key to machine-terrain interactions in robotics and related fields, and still pose several open problems. Continuum methods and deep learning, separately and in combination, show promise. This research advances machine learning methods for modeling rigid body-driven granular flows, for terrestrial industrial machine and planetary rover (where gravity is an important factor) applications. The original contribution of this research is the application of a subspace machine learning simulation approach for these engineering problems. To generate training datasets, a high-fidelity continuum method, the material point method (MPM) is utilized. Principal component analysis (PCA) is used to reduce the dimensionality of data. It is shown that the first few (8 in our datasets) principal components of our high-dimensional data keep almost the entire variance in data. A graph network simulator (GNS) is trained to learn the underlying subspace dynamics. The learned GNS is then able to predict particle positions and interaction forces with good accuracy, averaging 6 × 1 0 − 5 and 3 × 1 0 − 6 mean squared position error and 7% and 17% mean percentage force error, for excavation and wheel data, respectively. More importantly, PCA significantly enhances the time and memory efficiency of GNS in both training and rollout. This enables GNS to be trained using a single desktop graphics processing unit (GPU) with moderate video random-access memory (VRAM). This also makes the GNS real-time on large-scale 3D physics configurations (700x faster than our continuum method), which is the first demonstration of such significantly accelerated high-fidelity granular flow engineering simulations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".