Evaluation of Objective Functions for the Optimal Design of an Assistive Robot
Bibliographic record
Abstract
The number of individuals with upper or lower extremities dysfunction (ULED) has considerably increased in the past few decades, resulting in a high economic burden for their families and society. Individuals with ULEDs require assistive robots to fulfill all their activities of daily living (ADLs). However, a theory for the optimal design of assistive robots that reduces energy consumption while increasing the workspace is unavailable. Thus, this research presents an algorithm for the optimal link length selection of an assistive robot mounted on a wheelchair to minimize the torque demands of each joint while increasing the workspace coverage. For this purpose, this research developed a workspace to satisfy a list of 18 ADLs. Then, three torque indices from the literature were considered as performance measures to minimize; the three torque measures are the quadratic average torque (QAT), the weighted root square mean (WRMS), and the absolute sum of torques (AST). The proposed algorithm evaluates any of the three torque measures within the workspace, given the robot dimensions. This proposed algorithm acts as an objective function, which is optimized using a genetic algorithm for each torque measure. The results show that all tree torque measures are suitable criteria for assistance robot optimization. However, each torque measures yield different optimal results; in the case of the QAT optimization, it produces the least workspace with the minimum overall torques of all the joints. Contrarily, the WRMS and AST optimization yield similar results generating the maximum workspace coverage but with a greater overall torque of all joints. Thus, the selection between the three methods depends on the designer's criteria. Based on the results, the presented methodology is a reliable tool for the optimal dimensioning of assistive robots.
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.001 | 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 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".