Physics-Informed Graph Learning for Shape Prediction in Robot Manipulate of Deformable Linear Objects
Bibliographic record
Abstract
Abstract Shape prediction of deformable linear objects (DLO) plays critical roles in robotics, medical devices, aerospace, and manufacturing, especially in manipulating objects such as cables, wires, and fibers. Due to the inherent flexibility of DLO and their complex deformation behaviors, such as bending and torsion, it is challenging to predict their dynamic characteristics accurately. Although the traditional physical modeling method can simulate the complex deformation behavior of DLO, the calculation cost is high and it is difficult to meet the demand of real-time prediction. In addition, the scarcity of data resources also limits the prediction accuracy of existing models. To solve these problems, a method of fiber shape prediction based on a physical information graph neural network (PIGNN) is proposed in this paper. This method cleverly combines the powerful expressive power of graph neural networks with the strict constraints of physical laws. Specifically, we learn the initial deformation model of the fiber through graph neural networks (GNN) to provide a good initial estimate for the model, which helps alleviate the problem of data resource scarcity. During the training process, we incorporate the physical prior knowledge of the dynamic deformation of the fiber optics into the loss function as a constraint, which is then fed back to the network model. This ensures that the shape of the fiber optics gradually approaches the true target shape, effectively solving the complex nonlinear behavior prediction problem of deformable linear objects. Experimental results demonstrate that, compared to traditional methods, the proposed method significantly reduces execution time and prediction error when handling the complex deformations of deformable fibers. This showcases its potential application value and superiority in fiber manipulation.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".