MétaCan
Menu
Back to cohort
Record W2161966861 · doi:10.1109/icsmc.1995.537890

A generic mediator for multi-agent coordination in a distributed manufacturing system

2002· article· en· W2161966861 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
TopicScheduling and Optimization Algorithms
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceDistributed computingScheduling (production processes)Distributed manufacturingTask (project management)Intelligent agentMulti-agent systemConcurrent engineeringSystems engineeringEngineeringArtificial intelligenceManufacturing engineering

Abstract

fetched live from OpenAlex

A generic agent mediator has been developed to coordinate heterogeneous intelligent agents in a distributed manufacturing system. Coordination takes place both between dynamically created virtual clusters of agents and within these so-called coordination clusters. Task plans are decomposed successively into subtasks which are allocated down through the agent clusters and coordinated through these. The mediator's structure and activities are illustrated through application to an intelligent manufacturing scheduling problem. The system components, including all machines and parts, are implemented as intelligent agents. This approach is being further developed to manage a concurrent engineering environment in an intelligent manufacturing system.

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.821
Threshold uncertainty score0.336

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.029
GPT teacher head0.223
Teacher spread0.195 · 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

Citations19
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Optimization AlgorithmsFrench-language works237,207