MétaCan
Menu
Back to cohort
Record W2132369382 · doi:10.1109/csie.2009.855

Adaptive 2D-Path Optimization of Steerable Bevel-Tip Needles in Uncertain Model of Brain Tissue

2009· article· en· W2132369382 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 institutionsUniversity of British Columbia
Fundersnot available
KeywordsBevelMaxima and minimaMotion planningComputer sciencePath (computing)RobotArtificial intelligenceEngineeringMathematicsStructural engineering

Abstract

fetched live from OpenAlex

Although there are many works in which path planning of robots is studied, but path planning of the bevel-tip needles with highly flexible body is different and difficult due to unique properties of soft tissues. Real soft tissues are nonhomogeneously elastic and uncertainly deformable and hence, during needle motions the planned path changes unknowingly. In this paper, a novel adaptive path planning of bevel-tip needles inside the uncertain brain tissue is presented. The proposed approach is based on minimization of a Lyapanov energy function used as the cost function which consists of 6 partial costs: path length, number of changes in bevel direction, tissue deformation, horizontal and vertical distances of the needle from target and the inverse distance from obstacles. Uncertainty is also modeled using three techniques; random distribution of elasticity, contamination of the brain image with imaging noise and the fuzzfication of obstacles. Uncertainty modeling helps the optimizer generate more reliable paths. The proposed needle path planning is simulated on a 2D modeled tissue on the basis that the needle's tip does not leave the 2D plane, meaning that (although the needle is rotationally flexible), the angle of needle's base and of needle's tip are always equal. Manipulation of needle's base has three possible states: stop in 0 degree (bevel-right), stop in +180 degree (bevel-left) and always spinning the needle's base (bevel-off). The proposed algorithm is designed so that the needle path does not get trapped into local minima and attractors. The main contribution of this work is in defining a novel and effective cost, namely bevel-change cost, in addition to application of a Lyapanov energy function of Hopfield neural network in needle path optimization.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.298
Threshold uncertainty score0.485

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.0010.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.033
GPT teacher head0.276
Teacher spread0.243 · 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

Citations4
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207