Towards the Development of a Learning-Based Intention Classification Framework for Pushrim-Activated Power-Assisted Wheelchairs
Bibliographic record
Abstract
There has been a growth in the design and use of power assist devices for manual wheelchairs (MWCs) to alleviate the physical load of MWC use. A pushrim-activated power-assisted wheel (PAPAW) is an example of a power assist device that replaces the conventional wheel of a MWC. Although the use of PAPAWs provides some benefits to MWC users, it can also cause difficulties in maneuvering the wheelchair. In this research, we examined the characteristics of wheelchair propulsion when using manual and powered wheels. We used the left and right wheels' angular velocity to calculate the linear and angular velocity of the wheelchair. Results of this analysis revealed that the powered wheel's controller is not optimally designed to reflect the intentions of a wheelchair user. To address some of the challenges with coordinating the pushes on PAPAWs, we proposed the design of a user-intention detection framework. We used the kinematic data of MWC experiments and tested six supervised learning algorithms to classify one of four movements: "not moving", "moving straight forward", "turning left", and "turning right". We found that all the classification algorithms determined the type of movement with high accuracy and low computation time. The proposed intention detection framework can be used in the design of learning-based controllers for PAPAWs that take into account the individualized characteristics of wheelchair users. Such a system may improve the experience of PAPAW users.
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.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 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".