MétaCan
Menu
Back to cohort
Record W7133116688

Least restrictive collision avoidance control

2004· dissertation· W7133116688 on OpenAlexfundno aff
Farid Fadaie

Bibliographic record

VenueTSpace · 2004
Typedissertation
Language
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsnot available
FundersUniversity of Toronto
KeywordsCollisionControl theory (sociology)Controller (irrigation)Collision avoidanceRobotSet (abstract data type)Task (project management)
DOInot available

Abstract

fetched live from OpenAlex

Working in crowded environments is a challenging task for mobile robotic systems as the robot may have a collision to other moving or stationary objects. One of the practical issues is that robots should not have any collision while they are performing their tasks. A general collision avoidance algorithm which can be used everywhere can be very useful. In this thesis a controller, which can avoid the collision between two vehicles modelled as unicycles, is presented and it is shown that if this controller cannot avoid collision, no other controller can do it. This controller is called a least restrictive controller. This controller is not unique and therefore we may find another controller which is least restrictive, however the set of the states, for which a collision is unavoidable, is the same for all least restrictive controllers.

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.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
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.785
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0020.000
Research integrity0.0010.002
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.323
Teacher spread0.304 · 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.

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

Citations0
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicRobotic Path Planning AlgorithmsFrench-language works237,207