MétaCan
Menu
Back to cohort
Record W2165274745 · doi:10.1109/aamas.2004.188

Multiagent Planning as Control Synthesis

2004· article· en· W2165274745 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

VenueAdaptive Agents and Multi-Agents Systems · 2004
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceDistributed computingMulti-agent systemEvent (particle physics)Control (management)Relation (database)Constraint (computer-aided design)Simple (philosophy)SoftwareSupervisory controlArtificial intelligenceEngineeringData miningProgramming language

Abstract

fetched live from OpenAlex

This paper proposes a new multiagent planning approach to coordination synthesis that views distributed agents as discrete-event processes. The connection between discrete-event control synthesis and coordination planning is first established, thereby enabling the exploitation of the vast body of knowledge and associated software synthesis tools from ýThe Supervisory Control of Discrete-Event Systemsý for automatic coordination synthesis of distributed agents. Importantly, these coordinating agents designed collectively generate a behaviour guaranteed not to contradict any specified inter-agent constraint, is nonblocking and optimal. A simple planning methodology is proposed in terms of procedures supported by CTCT, an existing, freely available design tool developed based on the control synthesis framework.Asimple example illustrates the use of the CTCT-based methodology to synthesize coordination modules for distributed agents. Discussions in relation to previous work examine the relative significance of the new multiagent planning framework.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.869
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.071
GPT teacher head0.299
Teacher spread0.228 · 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