MétaCan
Menu
Back to cohort
Record W7113906092 · doi:10.1145/3761668.3761692

Path Smoothing Optimization for Mobile Robots in Intelligent Chemistry Laboratory Based on Improved A* Algorithm

2025· article· W7113906092 on OpenAlexaff

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsOptech (Canada)
Fundersnot available
KeywordsPath (computing)Motion planningSmoothingAutomationMobile robotAny-angle path planningMATLAB

Abstract

fetched live from OpenAlex

To meet the high requirements for pipetting stability in smart chemical laboratory mobile robots, this paper proposes a path smoothing optimization method based on an improved A* algorithm. The method introduces bidirectional jump point search technology, which significantly reduces the search space by initiating simultaneous searches from both the start and end points. Additionally, to address issues of excessive path turns and redundancy, the Floyd algorithm is integrated to optimize the path, while an enhanced evaluation function further improves search accuracy and efficiency. Simulation results using MATLAB demonstrate that the improved A* algorithm achieves notable improvements in runtime, number of traversed nodes, path turning points, and path smoothness. Under the premise of ensuring path planning efficiency, the method satisfies the special smoothness requirements for mobile composite robot path planning in smart chemical laboratories. This study provides robust technical support for the automation development of smart chemical laboratories and advances overall operational efficiency to a higher level.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.134
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.001
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.009
GPT teacher head0.263
Teacher spread0.254 · 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.

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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207