MétaCan
Menu
Back to cohort

Human-Rover Interactions and Swarm Algorithms of Mobile Robots in an Open and Crowded Environment: A Survey

2020· preprint· en· W3083314235 on OpenAlexafffund
Maxime Vaidis, Martin J.-D. Otis

Bibliographic record

VenuePreprints.org · 2020
Typepreprint
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversité du Québec à Chicoutimi
FundersNatural Sciences and Engineering Research Council of CanadaFonds Québécois de la Recherche sur la Nature et les TechnologiesUniversité du Québec à Chicoutimi
KeywordsSwarm behaviourMobile robotRobotComputer scienceField (mathematics)Human–computer interactionOpen researchFocus (optics)Swarm roboticsArchitectureArtificial intelligenceSystems engineeringEngineeringGeographyWorld Wide Web

Abstract

fetched live from OpenAlex

As a result of extensive research in the field of mobile robots (rovers) and swarms, a number of algorithms exist to assist them for executing a mission in the three levels of software architecture: strategic (interaction loop level), tactic (planning) and operational (sensing, control and actuation). They allow them to achieve their goals while adapting to their environment through a multitude of methods designed for each situation. For this reason, a literature review of the latest research conducted in previous years is required to identify new research trends in human-swarm interaction applied to help humans in hazardous environment such as militarized zone. In this paper, we will present some interesting algorithms for interactive and autonomous mobile robots acting in swarms in an open and crowded environment. A discussion will focus on comparing different algorithms and their advantages and disadvantages.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.013
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.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.013
Research integrity0.0000.001
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.238
GPT teacher head0.401
Teacher spread0.163 · 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 teacher head, not a consensus.

Study designObservational
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

Citations1
Published2020
Admission routes2
Has abstractyes

Explore more

Same venuePreprints.orgSame topicRobotic Path Planning AlgorithmsFrench-language works237,207