Control of the robotic arm system with an SSVEP-based BCI
Bibliographic record
Abstract
Abstract Recent studies on brain–computer interfaces (BCIs) implemented in robotic systems have shown that the system’s effectiveness in assisting individuals with movement disorders to enhance their human–computer interaction skills. However, achieving precise and rapid online completion of tasks remains a challenge for manipulators with multiple degrees of freedom (DOFs). In this paper, we explore a time-sharing control strategy for studying motion control of a robotic arm based on steady-state visual evoked potentials. The signals are generated by the joint frequency-phase modulation method, analyzed with the filter-bank canonical correlation analysis algorithm, and identified to control the six-DOF robotic arm for task execution. The shared control strategy not only reduces user’s cognitive fatigue but also enhances system in practical environments. The use of high-frequency stimuli significantly improves user comfort, and hybrid coding increases the universality of the BCI system. Additionally, by setting multiple locations and actions randomly, the robotic arm can adaptively program the optimal path. The online results showed that BCI instructions of the proposed system could be accurately chosen from six options within 6.45 s. Subjects used an average of 12 commands for the robotic arm to achieve the proposed task with an average accuracy of 98.21%. These findings validate the feasibility and effectiveness of applying the system to robotic control. The control strategy proposed in this study exhibits versatility in controlling robots to perform various complex tasks across different domains.
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.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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".