Time-Optimal Trajectory Planning of Cable-Driven Parallel Mechanisms for Fully Specified Paths With G1-Discontinuities
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
Time-optimal trajectory planning (TOTP) is a well-studied problem in robotics and manufacturing, which involves the minimization of the time required for the operation point of a mechanism to follow a path, subject to a set of constraints. A TOTP technique, designed for fully specified paths that include abrupt changes in direction, was previously introduced by the first author of this paper: an incremental approach called minimum-time trajectory shaping (MTTS) was used. In the current paper, MTTS is converted to a dynamic technique and adapted for use with cable-driven parallel robots, which exhibit cable tension and motor torque constraints. For many applications, cable tensions along a path are verified after trajectory generation, rather than imposed during trajectory generation. For the technique proposed in this paper, the cable-tension constraints are imposed directly and fully integrated with MTTS, during trajectory generation, thus maintaining a time-optimal solution. MTTS is applied to a test system and path, and compared to the bang–bang technique. With the same constraints, the results obtained with both techniques are found to be very close. However, MTTS can be applied to a wider variety of paths, and accepts constraints on jerk and total acceleration that would be difficult to apply using the bang–bang approach.
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.001 | 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