MétaCan
Menu
Back to cohort

Optimal UAV-Trajectory Design in a Dynamic Environment Using NOMA and Deep Reinforcement Learning

2024· article· en· W4402474866 on OpenAlexaff
Fatemeh Banaeizadeh, Michel Barbeau, Joaquín García-Alfaro, Evangelos Kranakis

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicUAV Applications and Optimization
Canadian institutionsCarleton University
FundersAgence Nationale de la Recherche
KeywordsReinforcement learningNomaTrajectoryComputer scienceArtificial intelligenceReinforcementEngineeringTelecommunicationsStructural engineering

Abstract

fetched live from OpenAlex

Effective deployment of cellular-connected UAV networks necessitates efficient techniques to minimize mutual interference between UAVs and ground users. Moreover, the existing sub-6 GHz band suffers from extreme congestion, making it challenging to allocate unused resource blocks (RBs) for UAVs. This paper presents a learning-based UAV-path planning approach at the Base Station (BS) side, leveraging Non-Orthogonal Multiple Access (NOMA) and Deep Q-Network (DQN) methodologies to address massive connectivity and air-to-ground interference. The proposed NOMA-DQN learning approach optimizes UAV-transmission power and RB allocation jointly, taking into account the UAV-location. Additionally, it devises an interference-aware path for the UAV, considering its limited battery capacity. Simulation results demonstrate the efficacy of our proposed approach in terms of maximizing the total sum rate of aerial and ground users in a shared RB, as well as enhancing UAV energy efficiency, as compared to shortest path, orthogonal multiple-access (OMA), and random selection schemes.

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.832
Threshold uncertainty score0.314

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.008
GPT teacher head0.201
Teacher spread0.193 · 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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicUAV Applications and OptimizationFrench-language works237,207