MétaCan
Menu
Back to cohort
Record W3093935464 · doi:10.1109/tiv.2020.3029369

A Novel Algorithm of Multi-AUVs Task Assignment and Path Planning Based on Biologically Inspired Neural Network Map

2020· article· en· W3093935464 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

VenueIEEE Transactions on Intelligent Vehicles · 2020
Typearticle
Languageen
FieldEngineering
TopicUnderwater Vehicles and Communication Systems
Canadian institutionsUniversity of Guelph
FundersScience and Technology Commission of Shanghai MunicipalityNational Natural Science Foundation of China
KeywordsMotion planningUnderwaterGrid referenceGridComputer scienceArtificial neural networkTask (project management)Path (computing)AlgorithmDiscretizationArtificial intelligenceReal-time computingEngineeringGeographyMathematicsMobile robot

Abstract

fetched live from OpenAlex

The task assignment and path planning of a multi-AUVs system has now attracted considerable attention and become a hotspot in the research. In this paper, a novel algorithm of multi-AUVs task assignment and path planning based on Biologically Inspired Neural Network Map (BINN) is proposed. Firstly, the grid map is built by discretizing the three-dimensional underwater environment into many equal grids. Secondly, the activity values of all AUVs in the BINN maps of each target are calculated. Then, the AUV with the highest activity value in the BINN map of the target is selected as the winning AUV for the target. Finally, the winning AUV performs path planning according to the BINN strategy. Through the simulation experiment, it is proved that the novel BINN algorithm proposed in this paper can effectively and reasonably distribute multi-AUVs and reduce the overall sailing distance.

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.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: Empirical · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score0.787

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.053
GPT teacher head0.246
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