Multi Agent System Based Approach for Industrial Process Simulation
Bibliographic record
Abstract
Industrial systems become more and more complex. This complexity is due to the great number of elements that compose them and their interactions. This paper describes a multi-agent approach for modeling such systems. All of their parts are considered and are modeled by using adequate agents. The set of preoccupations were identified to find convenient multi agent models for their resolutions. Then, we implemented our application by using a MADKIT multi-agent platform. The main goal of this work is to build a simulator based on reactive agents able to translate this complex industrial system into a data processing programs that can represent its structure, its behavior, its interaction, its control loops and verify the integrity and its proper functioning. A concrete application of this approach was materialized by building an industrial gas process simulator.Industrial systems become more and more complex. This complexity is due to the great number of elements that compose them and their interactions. This paper describes a multi-agent approach for modeling such systems. All of their parts are considered and are modeled by using adequate agents. The set of preoccupations were identified to find convenient multi agent models for their resolutions. Then, we implemented our application by using a MADKIT multi-agent platform. The main goal of this work is to build a simulator based on reactive agents able to translate this complex industrial system into a data processing programs that can represent its structure, its behavior, its interaction, its control loops and verify the integrity and its proper functioning. A concrete application of this approach was materialized by building an industrial gas process simulator.Industrial systems become more and more complex. This complexity is due to the great number of elements that compose them and their interactions. This paper describes a multi-agent approach for modeling such systems. All of their parts are considered and are modeled by using adequate agents. The set of preoccupations were identified to find convenient multi agent models for their resolutions. Then, we implemented our application by using a MADKIT multi-agent platform. The main goal of this work is to build a simulator based on reactive agents able to translate this complex industrial system into a data processing programs that can represent its structure, its behavior, its interaction, its control loops and verify the integrity and its proper functioning. A concrete application of this approach was materialized by building an industrial gas process simulator.Industrial systems become more and more complex. This complexity is due to the great number of elements that compose them and their interactions. This paper describes a multi-agent approach for modeling such systems. All of their parts are considered and are modeled by using adequate agents. The set of preoccupations were identified to find convenient multi agent models for their resolutions. Then, we implemented our application by using a MADKIT multi-agent platform. The main goal of this work is to build a simulator based on reactive agents able to translate this complex industrial system into a data processing programs that can represent its structure, its behavior, its interaction, its control loops and verify the integrity and its proper functioning. A concrete application of this approach was materialized by building an industrial gas process simulator.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".