MétaCan
Menu
Back to cohort
Record W2013014441 · doi:10.1017/s0263574711001019

Recursive field estimation and tracking for autonomous manipulation

2011· article· en· W2013014441 on OpenAlexaff
Soo Jeon

Bibliographic record

VenueRobotica · 2011
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsControl theory (sociology)Computer scienceField (mathematics)Revolute jointSingularityControl engineeringScalar (mathematics)Radial basis functionScalar fieldRobotArtificial intelligenceEngineeringMathematicsControl (management)Artificial neural network

Abstract

fetched live from OpenAlex

SUMMARY Autonomous operation of mechanical systems often requires the ability to detect and locate a particular phenomenon occurring in the surrounding environment. Being implemented to articulated manipulation, such a capability may realize a wide range of applications in autonomous maintenance and repair. This paper presents the sensor-driven task space control of an end-effector that combines the field estimation and the target tracking in an unknown spatial field of interest. The radial basis function network is adopted to model spatial distribution of an environmental phenomenon as a scalar field. Their weight parameters are estimated by a recursive least square method using collective measurements from the on-board sensors mounted to the manipulator. Then the asymptotic source tracking has been achieved by the control law based on the gradient of the estimated field. A new singularity tolerant scheme has been suggested to command the task space control law despite singular configurations. Simulation results using the three-link planar robot and the 6-revolute elbow manipulator are presented to validate the main ideas.

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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
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.0010.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.050
GPT teacher head0.246
Teacher spread0.196 · 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
GenreEmpirical

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

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueRoboticaSame topicRobot Manipulation and LearningFrench-language works237,207