MétaCan
Menu
Back to cohort
Record W4249127954 · doi:10.1504/ijdsss.2018.090875

Massively parallel hybrid algorithm on embedded graphics processing unit for unmanned aerial vehicle path planning

2018· article· en· W4249127954 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

VenueInternational Journal of Digital Signals and Smart Systems · 2018
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsRoyal Military College of Canada
Fundersnot available
KeywordsGraphics processing unitComputer scienceMassively parallelMotion planningPath (computing)Particle swarm optimizationGenetic algorithmTerrainParallel computingReal-time computingAlgorithmArtificial intelligenceRobotOperating system

Abstract

fetched live from OpenAlex

To operate autonomously, military unmanned aerial vehicles (UAVs) must be equipped with a path planning module capable of calculating feasible trajectories. This is a highly complex and nonlinear optimisation problem that challenges state of the art methods. In this paper, we present a massively parallel hybrid algorithm to solve the path planning problem for fixed-wing military UAVs. The proposed solution combines the strengths of the genetic algorithm (GA) and the particle swarm optimisation and allows for the calculation of quasi-optimal paths in realistic 3D environments. To reduce the execution time, the proposed algorithm is parallelised on the NVIDIA Jetson TX1 embedded graphics processing unit (GPU). By exploiting the parallel architecture of the GPU, the runtime is reduced by a factor of 23.6× to just 4.3 seconds while requiring only 10 watts, making it an excellent solution for on-board path planning. The proposed system is tested in a simulation using 18 scenarios on six different terrains.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.914
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.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.037
GPT teacher head0.295
Teacher spread0.258 · 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