MétaCan
Menu
Back to cohort
Record W1998474857 · doi:10.1109/iecon.2013.6699821

Teleoperation of a mobile robot with model-predictive obstacle avoidance control

2013· article· en· W1998474857 on OpenAlex
Sajad Salmanipour, Shahin Sirouspour

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsMcMaster University
Fundersnot available
KeywordsTeleoperationObstacle avoidanceMobile robotModel predictive controlObstacleSonarRobotRobot controlComputer scienceCollision avoidanceAutonomous robotControl engineeringControl (management)EngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

This paper presents a mixed teleoperation/autonomous control approach for navigation and obstacle avoidance in mobile robots. The proposed method builds on an earlier general control framework that systematically combines teleoperation and autonomous control subtasks. This paper considers a scenario in which the user teleoperates a mobile robot while being assisted by an autonomous subtask designed to help avoid collisions with obstacles in the robot task environment. The autonomous subtask control commands are generated by formulating and solving a constrained optimization problem over a rolling horizon window of time into the future. The effectiveness of the proposed model-predictive control obstacle avoidance scheme is demonstrated in teleoperation experiments with a mobile robot using sonar measurements for obstacle localization.

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.

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: none
Teacher disagreement score0.620
Threshold uncertainty score0.353

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.001
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.007
GPT teacher head0.205
Teacher spread0.198 · 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

Quick stats

Citations3
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207