A Genetic Algorithm for calculating minimum distance between convex and concave bodies
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Distance determination, i.e. obtaining the distance between a pair of objects, is used in di¤erent applications such as the simulation of physical systems and robot path planning. Most of the existing algorithms focus on obtaining the separation distance and are limited to deal only with convex objects. In this work, a novel method for solving the minimum separation distance between convex and/or concave objects is presented. The method is based on the global optimization technique known as Genetic Algorithms (GA). Unlike previously developed works based on the use of optimization techniques to obtain the minimum distance amongst objects, the one presented here is not limited to convex objects, i.e. it does not require the concave objects to be partitioned into convex pieces. A simple local optimization method is also presented. It is shown that this method accelerates the convergence of the global stochastic search algorithm. A few examples with simple and complex objects are presented. The results obtained using di¤erent variations of the minimum distance method are compared. Particular attention is focused on the computational expense to obtain the solution as well as the precision of the solution.
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.
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.000 |
| 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 it