MétaCan
Menu
Back to cohort
Record W4391302817 · doi:10.2514/6.2024-0432

Spacecraft Rendezvous and Docking with Obstacle Avoidance Using Bounded Buffered Voronoi Cells

2024· article· en· W4391302817 on OpenAlexaff
Nolan Chafe, Steve Ulrich

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsCarleton University
Fundersnot available
KeywordsRendezvousVoronoi diagramSpacecraftDocking (animal)Obstacle avoidanceBounded functionComputer scienceObstacleVehicle dynamicsAerospace engineeringCollision avoidanceEngineeringMathematicsArtificial intelligenceMobile robotRobotGeographyCollisionComputer security

Abstract

fetched live from OpenAlex

— This work proposes an online autonomous guidance algorithm for rendezvous and docking involving a controlled chaser spacecraft and uncooperative target in the presence of a dynamic obstacle. We propose the Bounded Buffered Voronoi Cell (BBVC), a modified Voronoi Cell bound to a finite region which dynamically adjusts its boundaries between other agents to introduce keep-out-zones around obstacles and targets. The chaser navigates to local targets within its BBVC, thereby avoiding collisions, as it navigates to and eventually docks with its target. This guidance algorithm is simulated to demonstrate its ability to generate collision-free paths.

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.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.769
Threshold uncertainty score0.832

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.0010.001
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.015
GPT teacher head0.235
Teacher spread0.220 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207