MétaCan
Menu
Back to cohort
Record W2099559152 · doi:10.1109/iros.2009.5354670

Mobile manipulation using tracks of a tracked mobile robot

2009· article· en· W2099559152 on OpenAlexaff
Yugang Liu, Guangjun Liu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsMobile robotComputer scienceRobotMobile manipulatorAccelerationPoint (geometry)Artificial intelligenceSimulationComputer vision

Abstract

fetched live from OpenAlex

This paper presents the investigation on mobile manipulation of a self-reconfigurable tracked mobile robot, using its tracks for both manipulation and locomotion. It is desirable for a mobile robot to possess manipulation capability in unstructured environments, especially in the scenario which is unsuitable for human beings. However, it is not convenient for such a mobile robot to carry an onboard manipulator and perform grasping and placing operations. An alternative is to realize the manipulation potential of the existing parts and perform manipulation without attaching additional hardware. Besides the enhanced locomotion ability, a self-reconfigurable tracked mobile robot has great potential in manipulation, which may take the forms of box-pushing, cylinder-moving or lateral hitting. However, the manipulation with tracks has to be controlled properly. One challenge is to optimize the tracks' configuration so as to get the optimal contact point. Furthermore, the speed and acceleration of the mobile robot have dramatic influence on mobile manipulation with tracks. To verify the effectiveness of the proposed algorithms, experiments are conducted using a tracked mobile robot in our laboratory.

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.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

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.001
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.027
GPT teacher head0.265
Teacher spread0.238 · 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 designBench or experimental
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

Citations13
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicModular Robots and Swarm IntelligenceFrench-language works237,207