MétaCan
Menu
Back to cohort

Safe and Quasi-Optimal Autonomous Navigation in Sphere Worlds

2023· article· en· W4382936011 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 institutionsWestern UniversityUniversité du Québec en OutaouaisLakehead University
Fundersnot available
KeywordsObstacleComputer sciencePoint (geometry)Control theory (sociology)Exponential stabilityPath (computing)Euclidean spaceMotion planningObstacle avoidanceEuclidean shortest pathEquilibrium pointTrajectoryControl (management)Shortest path problemMathematicsMobile robotArtificial intelligenceMathematical analysisGeometryPhysicsGeographyRobot

Abstract

fetched live from OpenAlex

We propose a continuous feedback control strategy that steers a point-mass vehicle safely to a desired destination, in a quasi-optimal manner, from almost all initial conditions in an n-dimensional Euclidean space cluttered with spherical obstacles. The main idea consists in avoiding each obstacle via the shortest path within the cone enclosing the obstacle, and moving straight towards the target when the vehicle has a clear line of sight to the target location. The proposed control strategy ensures safe navigation with almost global asymptotic stability of the equilibrium point at the target location. Simulation results, illustrating the effectiveness of the proposed approach, are presented.

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.852
Threshold uncertainty score0.323

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.001
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.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.017
GPT teacher head0.262
Teacher spread0.245 · 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

Citations5
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207