MétaCan
Menu
Back to cohort
Record W4385733470 · doi:10.1504/ijbic.2023.132789

UAV path planning in presence of occlusions as noisy combinatorial multi-objective optimisation

2023· article· en· W4385733470 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 Bio-Inspired Computation · 2023
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsMcMaster University
Fundersnot available
KeywordsComputer scienceMotion planningPath (computing)Artificial intelligenceComputer visionMathematical optimizationMathematicsComputer network

Abstract

fetched live from OpenAlex

A realistic noisy combinatorial problem on surveillance by unmanned aerial vehicle (UAV) in presence of weather factors is defined. The presence of cloud coverage is considered as a posterior Gaussian noise in the visibility region of the UAV. Recent studies indicate that recombination-based search mechanisms are helpful in solving noisy combinatorial problems. The search strategy of univariate marginal distribution algorithm that includes only selection and recombination, which has a close association with genepool crossover, proves to be beneficial in solving constrained and multi-objective combinatorial problems in presence of noise. This paper proposes a solution methodology based on multi-objective UMDA (moUMDA) with diversification mechanisms for the multi-objective problem of UAV surveillance. To obtain a well-spread set of Pareto optimal solutions, relevant diversification mechanisms are important. Numerical simulations show that moUMDA with and without K-means clustering provides better quality solutions and a more diverse Pareto optimal set than NSGA-II in solving this noisy problem.

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.001
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: none
Teacher disagreement score0.530
Threshold uncertainty score0.620

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.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.030
GPT teacher head0.326
Teacher spread0.296 · 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