MétaCan
Menu
Back to cohort

Fitted Stratified Manipulation with Decomposed Path Planning on Submanifolds

2005· article· en· W1976486555 on OpenAlexvenueno aff
István Harmati, Béla Lantos, Shahram Payandeh

Bibliographic record

VenueInternational Journal of Robotics and Automation · 2005
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsnot available
Fundersnot available
KeywordsPath (computing)Computer scienceMotion planningMathematicsArtificial intelligenceProgramming languageRobot

Abstract

fetched live from OpenAlex

This paper reports a new manipulation planning method based on fitted stratified manipulation. In contrast to many other methods using searching techniques, it provides a formal framework. This framework analytically solves the trajectories of the agents in the configuration space. The key feature of the technique is that it allows desired trajectories on a special submanifold called bottom stratum while fixed contact points are being supposed. It makes possible arbitrary object and finger tip motions during the manipulation. As an important consequence, the obstacle avoidance problem becomes solvable within the frame of stratified approach. However, according to the philosophy of stratified motion planning (MP), the method is still based on the flow sequence approach, implicitly decomposing the dextrous manipulation into object manipulation and grasp adjustment. Another important feature of the algorithm is that it provides a unified method on how to find a general solution that decomposes the manipulation task into separate object manipulation and finger relocation.

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 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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.287
Threshold uncertainty score0.327

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.016
GPT teacher head0.253
Teacher spread0.236 · 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 teacher head, 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

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Robotics and AutomationSame topicRobot Manipulation and LearningFrench-language works237,207