MétaCan
Menu
Back to cohort

Path Efficiency Enhanced Exploration Method for Mobile Robot in Unknown Unstructured Environments

2025· article· W7123352465 on OpenAlexaff
Yiming Hu, Shuting Wang, Yuanlong Xie, Youmin Zhang, Xiang Cheng

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsConcordia University
FundersResearch and DevelopmentNational Natural Science Foundation of China
KeywordsAdaptabilityMobile robotRobotPath (computing)Motion planning

Abstract

fetched live from OpenAlex

Autonomous exploration of unknown environments is one of the fundamental capabilities of intelligent mobile robots, which affects their adaptability in complex environment navigation tasks. Traditional frontier-based exploration methods prioritize exploration coverage while neglecting path cost, whereas some novel machine learning-based approaches often require substantial training and tuning to maintain effectiveness. To address this issue, this paper integrates the frontier-based method with artificial potential fields to develop a new local navigation approach, enabling the robot to explore a local area while avoiding obstacles. Subsequently, the newly proposed global exploration strategy can effectively guide the robot to explore different local areas in an orderly manner by selecting the nearest area with exploration value, which is calculated based on the principle of minimum potential energy. Simulations and experiments demonstrate that in unstructured scenarios with irregular layouts, the proposed method ensures good exploration coverage while significantly reducing path cost compared to existing methods, thereby improving the efficiency of the robot in the exploration task.

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.353
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.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.017
GPT teacher head0.307
Teacher spread0.290 · 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