An adaptive niching genetic algorithm approach for generating multiple solutions of serial manipulator inverse kinematics with applications to modular robots
Bibliographic record
Abstract
SUMMARY Inverse kinematics (IK) is a nonlinear problem that may have multiple solutions. A modified genetic algorithm (GA) for solving the IK of a serial robotic manipulator is presented. The algorithm is capable of finding multiple solutions of the IK through niching methods. Despite the fact that the number and position of solutions in the search space depends on the position and orientation of the end-effector as well as the kinematic configuration (KC) of the robot, the number of GA parameters that must be set by a user are limited to a minimum through the use of an adaptive niching method. The only requirement of the algorithm is the forward kinematics (FK) equations which can be easily obtained from the Denavit–Hartenberg link parameters and joint variables of the robot. For identifying and processing the outputs of the proposed GA, a modified filtering and clustering phase is also added to the algorithm. For the postprocessing stage, a numerical IK solver is used to achieve convergence to the desired accuracy. The algorithm is validated on three KCs of a modular and reconfigurable robot (MRR).
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".