Direct Switching Position Control Algorithms For Pneumatic Actuators Using On/Off Solenoid Valves
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
Pneumatic actuators are advantageous in terms of cost, power to weight ratio and inherent safety. However, their dynamics makes precise closed-loop position control very difficult in practice. Two sliding-mode control algorithms for controlling the position of a pneumatic cylinder by directly switching four on/off solenoid valves are proposed in this paper. The solenoid valves are much less expensive than the commonly used servo or proportional valves. The proposed algorithms are compared to two state of the art position control algorithms. Based on experiments on a high friction cylinder with various payloads, the proposed controllers provide superior performance in terms of valve switches per second, steady state error, settling time and overshoot. The achieved number of valve switches per second is also about one tenth of the number required by the pulse-width modulation method that is commonly used with on/off valves. This should result in prolonged valve lifetimes and reduced maintenance costs.
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.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 it