MétaCan
Menu
Back to cohort
Record W2117853178 · doi:10.1109/ccece.1995.528177

Teleo-reactive autonomous mobile navigation

2002· article· en· W2117853178 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 institutionsMcGill University
Fundersnot available
KeywordsSituatedComputer scienceFormalism (music)Mobile robotArchitectureComputationRobotInterpreterHuman–computer interactionProgramming languageArtificial intelligence

Abstract

fetched live from OpenAlex

Biological creatures apparently execute many tasks in the world by using a combination of routine skills, without doing any extensive reasoning. In recent years researchers have used this as a guide to formulate behavioral architectures for robot control. The authors have adopted the teleo-reactive (TR) formalism introduced by Nils Nilsson (1994) for their behavioral architecture. The formalism is a programming methodology for situated agents. The authors have implemented and expanded the TR formalism so that the program interpreter executes the computations in parallel. This is necessary in order for a situated agent to interact with its environment in real-time. Further extensions to the TR formalism include condition and action expressions, the flexibility of controlling how and when conditions are evaluated and the ability to control the computation frequency rate of condition processes. The authors' formalism is called TR+. A TR+ program was used to navigate a robot in the authors' lab in real-time.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.967
Threshold uncertainty score1.000

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.001

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.019
GPT teacher head0.240
Teacher spread0.221 · 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

Citations8
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207