MétaCan
Menu
Back to cohort
Record W2126700445 · doi:10.1109/robot.2004.1302471

Robotic navigation using harmonic function-based probabilistic roadmaps

2004· article· en· W2126700445 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 Regina
FundersNational Science Council
KeywordsProbabilistic roadmapMotion planningProbabilistic logicComputer sciencePath (computing)Laplace transformFunction (biology)HarmonicAlgorithmMathematical optimizationTopology (electrical circuits)A priori and a posterioriArtificial intelligenceMathematicsRobotPhysics

Abstract

fetched live from OpenAlex

This paper presents a new hybrid motion planning technique based on harmonic functions (HF) and probabilistic roadmaps (PRM). The proposed harmonic function based probabilistic roadmap (HFPRM) method comprises three phases: in phase one, the Laplace's equation, pertinent to potential flow, in an environment cluttered with obstacles is solved. In phase two, a probabilistic roadmap with a novel sampling scheme is constructed based on information obtained about the environment topology through the HF technique developed in phase one. The roadmap is then searched for the shortest path in phase three. Simulation results presented in this paper show that the combination of the HF and the PRM works better than each individual in terms of finding a collision free path in environments where narrow passages exist. The proposed HFPRM method can be extended to sensor-based motion planning problem in environments not known a priori.

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: none
Teacher disagreement score0.529
Threshold uncertainty score0.644

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.034
GPT teacher head0.260
Teacher spread0.226 · 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

Citations14
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207