Time Optimal Planning-Based High-Speed Running Motion Generation for Humanoid Robots with Safety Constraints
Bibliographic record
Abstract
Humanoid bipedal robot is a typical form of human-like robot with highly underactuated and nonlinear characteristics, which can bring many challenges to robot planning and control. How to demonstrate the strong locomotion ability through control strategies has always been an interesting issue that researchers have explored in depth. Under the limited actuator abilities, the realization of high-speed running for humanoid robots is also an important reflection of high locomotion ability, flexibility and strong stability. In this paper, a time optimal planning-based motion generation method is proposed to realize the high-speed running task of humanoid robots. First, since the humanoid robots usually have many degrees of freedom throughout the whole body, to reduce the computational complexity, a simplified 7-link dynamic model is established. Further, considering the time cost, running speed and security concerns, a multi-constraint time optimal problem within a single gait cycle is constructed, which can reduce the solution space dimension and be extended to generate trajectories of multiple cycles. Since the optimal control problem with constraints is difficult to solve, on the basis of the Legendre-Gauss-Radau (LGR) pseudospectral method, the states and the input trajectories of the system are discretized through a small number of collocation points, which can be transformed into a nonlinear programming problem to quickly find the optimal solution. By applying the proposed scheme, continuous states and input trajectories can be directly generated, and the target running speed is realized in the shortest time, which ensures that multiple constraints are limited within given ranges, simultaneously. Finally, numerical simulations are carried out to validate the effectiveness of the presented motion generation method.
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.000 | 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".