MétaCan
Menu
Back to cohort
Record W4408016884 · doi:10.1109/iotm.001.2400149

Quantum Machine Learning for Multi-Robot-Assisted Tactical Augmented Reality

2025· article· en· W4408016884 on OpenAlexaff
Andrews A. Okine, Silvirianti Silvirianti, Georges Kaddoum

Bibliographic record

VenueIEEE Internet of Things Magazine · 2025
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversité du Québec
Fundersnot available
KeywordsAugmented realityComputer scienceRobotHuman–computer interactionQuantum machine learningQuantumArtificial intelligencePhysicsQuantum computerQuantum mechanics

Abstract

fetched live from OpenAlex

Dismounted situational awareness (DSA) is a critical component of military operations. It is enhanced by tactical augmented reality (TAR) systems that overlay digital information onto soldiers' physical environments. Traditional TAR systems rely predominantly on data from soldier-mounted cameras, which can limit their effectiveness and increase the risk of soldiers being exposed to unseen threats. To address these challenges, we propose a new TAR framework called Tactical Augmented Reality on the Move (TAROTM). TAROTM utilizes advanced military robots, such as quadruped unmanned ground vehicles (QUGVs), that are organized into specialized collaborative teams to support sensing, data processing, storage, and analytics. Given the significant volume of data, amount of traffic, and delay constraints associated with TAROTM, we explore quantum machine learning (QML)'s potential to enable real-time data processing, analytics, and distribution. As a case study, we employ QML to optimize sensor-to-shooter data routing in TAROTM. Additionally, we discuss the challenges and opportunities associated with integrating QML in the TAROTM system.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.001

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.305
Teacher spread0.274 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations4
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Internet of Things MagazineSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207