MétaCan
Menu
Back to cohort
Record W2171948807 · doi:10.1109/ccece.2005.1557143

Building collaborative intelligent agents: revealing main pillars

2006· article· en· W2171948807 on OpenAlexaff
N. Houari, Behrouz H. Far

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceAdaptation (eye)Intelligent agentSoftware agentComponent (thermodynamics)Human–computer interactionKey (lock)Autonomous agentMulti-agent systemFeature (linguistics)Artificial intelligenceKnowledge managementComputer securityPsychology

Abstract

fetched live from OpenAlex

Software agents are persistent, knowledgeable, autonomous, collaborative, and learnable entities. One important feature of software agents is the ability to interact and communicate as a team to achieve more than they could individually. Although the belief-desire-intention (BDI) agent model is possibly the best known and used model of practical reasoning agent; nevertheless, this model does not address the key concept of how individual agent learn from the environment and manipulate itself to collaborate with others. In this paper we present a novel approach that customize the BDI model to define a so-called "RBDIA: Rapport-belief-desire-intention-adaptation" as a generic method to support progress from individual autonomous agent concept towards a collaborative multiple agents. Rapport here refers to the component that connects an agent to its environment, whereas adaptation module incorporates mechanisms of learning. We believe that the five proposed tiers for multiagent systems modeling serves for mastering the complexity and the difficulty of setting up effective autonomous collaborative MAS

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.006
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.031

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0020.010
Scholarly communication0.0130.022
Open science0.0030.008
Research integrity0.0040.004
Insufficient payload (model declined to judge)0.0040.002

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.018
GPT teacher head0.272
Teacher spread0.254 · 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 designTheoretical or conceptual
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

Citations3
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicMulti-Agent Systems and NegotiationFrench-language works237,207