MétaCan
Menu
Back to cohort
Record W2143492328

A New Approach to Manipulate Objects with a Team of Distributed Robots Based on Constrain-and-Move Strategy

2006· article· en· W2143492328 on OpenAlexaff
M. Barouni‐Ebrahimi, Nasser Ghariban

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsRobotTask (project management)Object (grammar)Computer scienceMobile robotPath (computing)Measure (data warehouse)Artificial intelligenceGroup (periodic table)Series (stratigraphy)Distributed computingComputer visionEngineeringData mining
DOInot available

Abstract

fetched live from OpenAlex

Based on constrain and move concept, a new algorithm CCM (complex Constrain and Move) is proposed to reorient objects with a distributed object handling mobile robots. In traditional constrain and move strategy, a group of robots constrain the object in undesirable directions and another group push the object to move it in desired path. In proposed CCM method, each robot does both constrain task and move task and the algorithm of robots are the same. A series of dynamic computer simulations are conducted to measure the efficiency of the new proposed algorithm for different experiments. The results of the simulations indicate that the system is stable in all experiments and it is more faults tolerant. Simulations also revealed that the minimum necessary numbers of robots in this method to handle the object is less than traditional constrain and move strategy. Introduction. A strong, complicated and expensive robot is needed to manipulate a heavy, big object. Such a robot usually depends on the shape of the object. The cooperation of some simple and cheap robots is a suitable way to manipulate objects with various shapes. Different

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: Methods · Consensus signal: Methods
Teacher disagreement score0.446
Threshold uncertainty score0.645

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.001
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.017
GPT teacher head0.229
Teacher spread0.212 · 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
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

Citations1
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207