MétaCan
Menu
Back to cohort
Record W4309574091 · doi:10.5802/roia.45

Approche locale pour l’exploration autonome d’environnements inconnus par une flottille de robots

2022· article· fr· W4309574091 on OpenAlexaff
Nicolas Gauville, François Charpillet

Bibliographic record

VenueRevue Ouverte d Intelligence Artificielle · 2022
Typearticle
Languagefr
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsSafran Electronics (Canada)
Fundersnot available
KeywordsHumanitiesLocale (computer software)Computer sciencePhilosophyProgramming language

Abstract

fetched live from OpenAlex

L’exploration autonome d’un environnement inconnu peut être envisagée de différentes manières. On peut notamment citer les approches par frontières, où des robots sont affectés à des zones inexplorées de la carte. Ces dernières sont efficaces, mais nécessitent de partager une carte et globaliser les décisions d’affectation. Les approches Brick and Mortar , quant à elles, utilisent un marquage au sol avec une prise de décision locale, mais donnent des performances beaucoup moins intéressantes. L’algorithme présenté ici est un compromis entre ces deux approches, permettant une prise de décision locale et, de façon surprenante, des performances proches des approches par frontières globales. Nous proposons également une étude comparative de la performance des trois différentes approches : Brick & Mortar , frontières globales et frontières locales . Notre algorithme local est également complet pour le problème d’exploration et peut être facilement distribué sur des robots avec une perte de performance mineure.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
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.702
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0020.000
Scholarly communication0.0000.001
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.003

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.062
GPT teacher head0.266
Teacher spread0.205 · 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; both teacher heads agree on what is shown here.

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

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueRevue Ouverte d Intelligence ArtificielleSame topicRobotic Path Planning AlgorithmsFrench-language works237,207