MétaCan
Menu
Back to cohort
Record W3083242470 · doi:10.1504/ijris.2020.10031841

Design and optimisation of bio-inspired robotic stochastic search strategy

2020· article· en· W3083242470 on OpenAlex
Farhad Maroofkhani, Kazuo Ishii, Amir Ali Forough Nassiraei

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 Reasoning-based Intelligent Systems · 2020
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicDiffusion and Search Dynamics
Canadian institutionsConcordia University
Fundersnot available
KeywordsRobotSet (abstract data type)Computer scienceResource (disambiguation)ForagingMathematical optimizationSpace (punctuation)Random searchArtificial intelligenceMachine learningMathematicsAlgorithmEcologyBiology

Abstract

fetched live from OpenAlex

An autonomous robot's search strategy is the set of rules that it employs while looking for targets in its environment. Biological systems (e.g., foraging animals) provide useful inspirations for designing optimal stochastic search algorithms for autonomous robots. Due to the complexity of interaction between the robot and its environment, optimisation must be performed in high-dimensional parameter space. We analyse the dependence of search efficiency on environmental parameters and robot characteristics using response surface methodology (RSM), a technique originally developed for experimental design. In this study, the efficiency of a strategy focuses on Lévy walk search strategies on two-dimensional landscapes with clumped resource distributions. We show how RSM techniques can be used to identify optimal parameter values and to describe how sensitive is the efficiency to the changes in these values.

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.749
Threshold uncertainty score0.441

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.036
GPT teacher head0.294
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