MétaCan
Menu
Back to cohort
Record W2127224811 · doi:10.1109/ijcnn.1992.226895

A neural network solution for bipedal gait synthesis

2003· article· en· W2127224811 on OpenAlexaff
D.M.A. Lee, Waguih ElMaraghy

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsWestern University
Fundersnot available
KeywordsArtificial neural networkSagittal planeComputer scienceSet (abstract data type)Feedforward neural networkArtificial intelligenceRobotTorqueGaitControl theory (sociology)Control (management)Control engineeringEngineering

Abstract

fetched live from OpenAlex

An artificial neural network is used to calculate a set of control torques that are used to generate a locomotive gait for a bipedal robot. Several simplifications of the dynamic model are made. The biped is constrained to the sagittal plane, has no knees, and walking appears in the form of 'stilt'-like motion. A supervised learning method is used to train a set of two fully connected multilayer feedforward neural networks. Training data from several mathematically derived linear control laws are accumulated into a single training set. The neural network solution is to incorporate and combine information from the results of several linear control methods. The results of these simulations indicate that the neural network approach for generating controlling torques could far outperform teaching controllers.>

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0070.001

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.026
GPT teacher head0.249
Teacher spread0.223 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Quick stats

Citations6
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicNeural Networks and ApplicationsFrench-language works237,207