MétaCan
Menu
Back to cohort

A Review: Robust Locomotion for Biped Humanoid Robots

2020· article· en· W3015880599 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Physics Conference Series · 2020
Typearticle
Languageen
FieldEngineering
TopicRobotic Locomotion and Control
Canadian institutionsYork University
Fundersnot available
KeywordsTraverseRobustness (evolution)Humanoid robotRobotComputer scienceRobot locomotionTerrainControl theory (sociology)SimulationBipedalismArtificial intelligenceRobot controlMobile robotControl (management)

Abstract

fetched live from OpenAlex

Abstract One of the most interesting and pressing challenges in the study on biped humanoid robots is to achieve high robustness in locomotion. This paper presents a brief overview of work and methods on robust walking and running for bipedal robots. So far, many robust walking methods have been proposed to reject terrain disturbances and impulsive force disturbances. The applications of the proposed methods to real robots improve the robustness and adaptivity of robots by large margin. Up to now, bipedal robots can traverse unknown terrains with ground variation exceeding 20% of leg length. The height of obstacles increases more than threefold compared to decades ago. With regards to unexpected external force, bipedal robots can recover the balance from sudden push not only at stationary state, but also during the walk. On the other hand, the biped running is underdeveloped compared to the robust walking. Still the highest running speed is less than 3.0 m/s, not to mention the poor robustness to large disturbances.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.983
Threshold uncertainty score0.474

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.048
GPT teacher head0.237
Teacher spread0.189 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it