MétaCan
Menu
Back to cohort
Record W4315472103 · doi:10.1109/cdc51059.2022.9993279

Autonomous Navigation in Environments with Arbitrary Non-convex Obstacles

2022· article· en· W4315472103 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

Venue2022 IEEE 61st Conference on Decision and Control (CDC) · 2022
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsLakehead UniversityWestern University
Fundersnot available
KeywordsComputer scienceRegular polygonMathematicsGeometry

Abstract

fetched live from OpenAlex

We develop an autonomous navigation algorithm for a robot operating in two-dimensional environments cluttered with obstacles which can have arbitrary non-convex shapes and can be in close proximity with each other, under the assumption that there exists a safe path connecting the initial and the target locations. We propose a hybrid feedback controller, with Zeno-free switching between the move-to-target mode and the obstacle-avoidance mode, guaranteeing global asymptotic stability of the target equilibrium. To handle the obstacle non-convexity, we introduce a transformation that modifies (virtually) the obstacles’ shapes, in a non-conservative manner, to generate a modified free-space suitable for the design of a reliable obstacle avoidance strategy. Finally, we validate the efficacy of the proposed hybrid feedback controller through simulations.

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.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.891
Threshold uncertainty score0.984

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
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.014
GPT teacher head0.228
Teacher spread0.214 · 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