MétaCan
Menu
Back to cohort
Record W2122151059 · doi:10.1109/isic.2002.1157742

Real-time torque control of nonholonomic mobile robots with obstacle avoidance

2003· article· en· W2122151059 on OpenAlex

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 institutionsUniversity of Guelph
Fundersnot available
KeywordsMobile robotControl theory (sociology)Nonholonomic systemController (irrigation)RobotComputer scienceObstacle avoidanceRobot controlLyapunov functionTorqueLyapunov stabilityControl engineeringNonlinear systemArtificial intelligenceEngineeringControl (management)

Abstract

fetched live from OpenAlex

In this paper, a novel torque controller is presented for nonholonomic mobile robots with obstacle avoidance. In the proposed controller, based on the artificial potential fields technique, an obstacle torque is introduced in the controller, which acts locally to push the robot away from the obstacles. The environment is initially assumed to be completely unknown, except the target location. Environment information is obtained from onboard robot sensors that have limited visibility range only. The neural network assumes a single layer structure, by taking advantage of the robot regressor dynamics that express the highly nonlinear robot dynamics in a linear form in terms of the known and unknown robot dynamic parameters. System stability and convergence are rigorously proved using a Lyapunov theory, subject to unmodeled disturbance and bounded unstructured dynamics. The real-time fine control of mobile robots is achieved through on-line learning of the neural network without any off-line learning procedures. A series of simulation results show that the proposed controller can be successfully applied to both static and dynamic environments, as well as a multi-robot system.

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: Methods
Teacher disagreement score0.454
Threshold uncertainty score0.510

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.0010.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.006
GPT teacher head0.212
Teacher spread0.205 · 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

Citations7
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207