MétaCan
Menu
Back to cohort
Record W3047624789 · doi:10.1109/aim43001.2020.9158960

A Reinforcement Learning Based Multiple Strategy Framework for Tracking a Moving Target

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicGuidance and Control Systems
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsReinforcement learningPursuerComputer scienceArtificial intelligenceMotion planningComplementarity (molecular biology)Mobile robotRoboticsMotion (physics)Machine learningRobotMathematical optimizationMathematics

Abstract

fetched live from OpenAlex

The pursuit-evasion game has been a classic research topic in the field of mobile robotics. Reinforcement learning (RL), which shows outstanding advantages in the decision-making area, is a widely used method in pursuitevasion game. This paper proposes a hierarchical framework in which RL allows the pursuer to select an appropriate strategy for the current condition in the upper level from multiple underlying strategies in the lower level. Through the analysis of existing motion planning algorithms, the dynamic window approach (DWA) and the proportional guidance method (PG) are used as the lower level strategies of the framework. Individual discussions on the merits and limitations of the two motion planning algorithms indicate a possible complementarity between them. Simulations are carried out and the corresponding results validate the excellent performance of the proposed approach.

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: Methods · Consensus signal: none
Teacher disagreement score0.980
Threshold uncertainty score0.531

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.025
GPT teacher head0.230
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

Quick stats

Citations6
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicGuidance and Control SystemsFrench-language works237,207