MétaCan
Menu
Back to cohort
Record W2133342902 · doi:10.1109/ijcnn.2006.246687

Learning to Coordinate Behaviors in Soft Behavior-Based Systems Using Reinforcement Learning

2006· article· en· W2133342902 on OpenAlexaff
Mohammad Gheshlaghi Azar, Majid Nili Ahmadabadi, Amir massoud Farahmand, Babak Nadjar Araabi

Bibliographic record

VenueThe 2006 IEEE International Joint Conference on Neural Network Proceedings · 2006
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsReinforcement learningComputer scienceArtificial intelligenceArchitectureTask (project management)Mobile robotRobotBehavior-based roboticsRoboticsMechanism (biology)ReinforcementEngineering

Abstract

fetched live from OpenAlex

Behavior-based systems have been successfully used in control and robotics applications. In traditional behavior-based systems, only a single behavior controls the agent in any time step. However, this behavior arbitration is not appropriate for many complex tasks. In this paper, we propose Hierarchical Soft Behavior-based Architecture that uses the concept of soft suppression to coordinate flexibly between behaviors. In our method, we use reinforcement learning to find an appropriate amount of suppression for each behavior in the architecture, in addition to learn the internal mechanism of each behavior. Several experiments are provided to show the effectiveness of our method in the mobile robot navigation task.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.045
GPT teacher head0.280
Teacher spread0.235 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueThe 2006 IEEE International Joint Conference on Neural Network ProceedingsSame topicReinforcement Learning in RoboticsFrench-language works237,207