MétaCan
Menu
Back to cohort
Record W4405574717 · doi:10.3390/s24248089

A Comprehensive Study of Recent Path-Planning Techniques in Dynamic Environments for Autonomous Robots

2024· article· en· W4405574717 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

VenueSensors · 2024
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsCollege Ahuntsic
Fundersnot available
KeywordsMotion planningObstacleKey (lock)Computer scienceObstacle avoidancePath (computing)Process (computing)RobotResource (disambiguation)Distributed computingSystems engineeringDynamic decision-makingRisk analysis (engineering)Human–computer interactionMobile robotEngineeringArtificial intelligenceComputer securityComputer network

Abstract

fetched live from OpenAlex

This paper presents a comprehensive review of path planning in dynamic environments. This review covers the entire process, starting from obstacle detection techniques, through path-planning strategies, and also extending to formation control and communication styles. The review discusses the key trends, challenges, and gaps in current methods to emphasize the need for more efficient and robust algorithms that can handle complex and unpredictable dynamic environments. Moreover, it discusses the importance of collaborative decision making and communication between robots to optimize path planning in dynamic scenarios. This work serves as a valuable resource for advancing research and practical applications in dynamic obstacle navigation.

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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.364
Threshold uncertainty score0.668

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.000
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.035
GPT teacher head0.314
Teacher spread0.279 · 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