MétaCan
Menu
Back to cohort
Record W1878224881 · doi:10.1109/iecon.1993.339327

A symbolic approach to determining exciting trajectories for identification of manipulator dynamic models

2002· article· en· W1878224881 on OpenAlexafffund
R. Lucyshyn, Jorge Angeles

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsMcGill University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRendering (computer graphics)Computer scienceTrajectoryInertial frame of referenceComputationIdentification (biology)AlgorithmParameter spaceSet (abstract data type)Estimation theoryArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

In experiments aimed at the identification of parameters in the dynamic model of a robotic manipulator, the use of a trajectory that excites the parameters so that the numerical estimation procedure is well-conditioned is important for an accurate estimation. This paper presents a new approach, based upon symbolic computations, to determine such "exciting trajectories". Herein, the concept of mutually productwise odd (MPO) functions is introduced, and the problem of determining an exciting trajectory is reformulated as one of rendering time histories of the regressor functions of the associated dynamic equation MPO. Parametrized joint-angle time histories whose parameters take on a discrete set of values form the search space of an algorithm that renders the regressor time histories MPO. The overall approach exploits the use of test motions to reduce the complexity of the search procedure. The approach is successfully applied to a three-link spatial manipulator, thereby showing how all required inertial parameters can be identified using exciting trajectories.>

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.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.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.035
GPT teacher head0.222
Teacher spread0.186 · 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 designTheoretical or conceptual
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

Citations2
Published2002
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Mechanisms and DynamicsFrench-language works237,207