OptiMA: A Transaction-Based Framework with Throughput Optimization for Very Complex Multi-Agent Systems
Preprint
Abstract
In recent years, the research of multi-agent systems has taken a direction to explore larger and more complex models to fulfill sophisticated tasks. We point out two possible pitfalls that might be caused by increasing complexity; susceptibilities to faults, and performance bottlenecks. To prevent the former threat, we propose a transaction-based framework to design very complex multi-agent systems (VCMAS). To address the second threat, we offer to integrate transaction scheduling into the proposed framework. We implemented both of these ideas to develop the OptiMA framework and show that it is able to facilitate the execution of VCMAS with more than a hundred agents. We also demonstrate the effect of transaction scheduling on such a system by showing improvements up to more than 16\%. Furthermore, we also performed a theoretical analysis on the transaction scheduling problem and provided practical tools that can be used for future research on it.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Transaction Scheduling: From Conflicts to Runtime ConflictsProceedings of the ACM on Management of Data, 2023
- Chameleon: Plug-and-Play Compositional Reasoning with Large Language Models2023
- Autonomous Agent Based Load Balancing Algorithm in Cloud ComputingProcedia Computer Science, 2015
- An appraisal and design of a multi-agent system based cooperative wireless intrusion detection computational intelligence techniqueEngineering Applications of Artificial Intelligence, 2013
- Robotics software frameworks for multi-agent robotic systems developmentRobotics and Autonomous Systems, 2012
- A Decentralized Approach for Anticipatory Vehicle Routing Using Delegate Multiagent SystemsIEEE Transactions on Intelligent Transportation Systems, 2011
- Constraint propagation techniques for the disjunctive scheduling problemArtificial Intelligence, 2000
- Multiagent Systems: A Survey from a Machine Learning PerspectiveAutonomous Robots, 2000
- Observations on optimistic concurrency control schemesInformation Systems, 1984
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962