MétaCan
Menu
Back to cohort
Record W2353342479

LP-based Path Planning Method in Acceleration Space for Mobile Robot

2007· article· en· W2353342479 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

VenueActa Automatica Sinica · 2007
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsDiscovery Air (Canada)
Fundersnot available
KeywordsMotion planningMobile robotAccelerationPath (computing)Mathematical optimizationComputer scienceLinear programmingPlannerSet (abstract data type)RobotControl theory (sociology)Real-time computingSimulationArtificial intelligenceMathematicsPhysics
DOInot available

Abstract

fetched live from OpenAlex

A linear programming(LP)based method in the acceleration space is proposed for the path planning of the mobile robot in the dynamic and uncertain environment.By using the relative information,the path planning of the mobile robot in the dynamic environment is described as minimizing an objective function subject to a set of linear inequalities that are easily embedded into the LP path planner.Simulations are carried out and the results show that the proposed method is more efficient and more convergent than the artificial potential guided evolution algorithm(APEA).

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.003
metaresearch head score (Gemma)0.001
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.416
Threshold uncertainty score0.950

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
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.036
GPT teacher head0.363
Teacher spread0.327 · 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