NEW APPROACH FOR ROBOTIC GRASPING OF UNKNOWN THREE DIMENSIONAL OBJECTS
Bibliographic record
Abstract
Automated grasping of objects of unknown geometry a priori has applications in many industries such as clearing a mine shaft after blasting, agricultural applications such as fruit and vegetable handling, and many roles in the service industry such as fetching items for a handicapped individual. In these roles the system environment is highly unstructured, and the robot must be able to react to different types of objects needing to be grasped. In this thesis a vision guided robotic grasp planner for unstructured environments is presented. An evaluation method for robotic grasping involving two distinct sets of objects is also presented. Both the grasp planner and evaluation metric are evaluated by experimentation using an articulated robotic arm with an eye-in-hand video camera, line laser, and pneumatic gripper. Multiple grasping experiments were performed with the objects in random poses on a modified tabletop deemed the playfield that did not allow objects to rest flat. The grasp planner focused on using a created model of the object from camera observations using silhouetting and line laser data. The object model and its computed convex hull were used to evaluate and select a single facet and point creating a grasping pair for the pneumatic gripper jaws. The grasp was attempted and then evaluated using a secondary camera and the developed evaluation method. iv Grasp success rates ranged from 80.30% (Rectangular Block on playfield 137 attempts) to 97.69% (Hexagonal Nut 173 attempts), with a mean grasp computation time for the hexagonal nut of 0.57s.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".