MétaCan
Menu
Back to cohort

Reinforcement Learning for Path Planning in Communication-Limited Environments

2024· article· en· W4401163911 on OpenAlexaff
Tianchen Zhao, Michel Kadoch, Rongqun Peng

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsReinforcement learningComputer scienceMotion planningPath (computing)Artificial intelligenceHuman–computer interactionRobotComputer network

Abstract

fetched live from OpenAlex

This study presents a groundbreaking exploration of using reinforcement learning (RL) to enhance path planning in scenarios with limited communication, a significant challenge in critical fields such as underwater exploration and disaster response. It begins by highlighting the importance of efficient path planning in situations characterized by intermittent connectivity and restricted bandwidth. Traditional path planning methods are assessed for their effectiveness in achieving optimal paths while minimizing time and energy consumption. The research’s focal point is the application of RL techniques, including Q-learning, Deep Q-Networks (DQN), and Policy Gradient methods, to empower autonomous agents to learn and refine their pathfinding through trial and error. Special emphasis is placed on ensuring learning stability and convergence of these RL models despite communication challenges. The study concludes by showcasing how RL not only improves path planning in these difficult environments but also paves the way for more robust and adaptive planning approaches in operations where communication is critical.

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.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.673
Threshold uncertainty score0.380

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.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.032
GPT teacher head0.285
Teacher spread0.253 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207