Multi-agent Coordination Mechanism in Distributed Environment

2002 ◽  
pp. 444-455
Author(s):  
Ming Xu ◽  
Yi Zhuang
Keyword(s):  
Coordination Mechanism ◽  
Distributed Environment ◽  
Multi Agent ◽  
Agent Coordination

scholarly journals Research on the coordination mechanism of major industrial project engineering and construction multi-agents based on structural holes theory

PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0255858
Author(s):  
Xiaokang Han ◽  
Wenzhou Yan ◽  
Mei Lu
Keyword(s):  
Complex Network ◽  
Coordination Mechanism ◽  
Coordination Problem ◽  
Structural Holes ◽  
Network Diagram ◽  
Pmc Model ◽  
3D Network ◽  
Industrial Projects ◽  
Multi Agent ◽  
Agent Coordination

Industry is an important pillar of the national economy. Industrial projects are the most complex and difficult projects to control in the construction industry, and major industrial projects are even more complex and difficult to control. Multi-agent coordination is one of the core issues of industrial projects. Based on an analysis of the engineering and construction chains and agent relationships and agent networks of industrial projects, a complex network of the engineering and construction agents of industrial projects is established, and the complex network structural holes theory is applied to study the nonrepeated relationships among agents in industrial projects. Assuming agents are linked through contract relations and the most critical contract index between the agents in the contract amount, through structural hole analysis considering the EPC and PMC model, the aggregate constraint list is obtained, 2D network diagram and 3D network diagram are shown. According to the aggregate constraint value, the EPC contractor with the minimum aggregate constraint value and the project management company with the minimum aggregate constraint value are the critical agent in EPC and PMC model. By analyzing the complex network comprising different models of industrial projects, it is concluded that the characteristics of the agent maintain an advantage in competition, the coordination mechanism of the integration of agent interests, and multi-agent relations are considered to solve the multi-agent coordination problem in major industrial projects.

Multi-Agent Applied Research in Agile Supply Chain

2013 ◽  
Vol 712-715 ◽  
pp. 3059-3062
Author(s):  
Jin Peng Tang ◽  
Ling Lin Li
Keyword(s):  
Supply Chain ◽  
System Reliability ◽  
Intelligent Agents ◽  
Applied Research ◽  
Coordination Mechanism ◽  
Supply Chain System ◽  
Agile Supply Chain ◽  
Multi Agent ◽  
Agent Coordination ◽  
The Competitiveness Of Enterprises

Introduced intelligent agents to agile supply chain, designed multi-agent coordination mechanism for agents, then proposed agile supply chain based on multi-agent system. This mechanism is applied to a specific enterprise. Multi-Agent strengthens the agile supply chain system reliability, flexibility and scalability, and improves the competitiveness of enterprises.

scholarly journals Improving Multi-agent Coordination by Learning to Estimate Contention

2021 ◽  
Author(s):  
Panayiotis Danassis ◽  
Florian Wiedemair ◽  
Boi Faltings
Keyword(s):  
Large Scale ◽  
Learning Algorithm ◽  
Coordination Mechanism ◽  
Large Scale Systems ◽  
Fast Learning ◽  
Agent Learning ◽  
Meeting Scheduling ◽  
Multi Agent ◽  
Device Deployment ◽  
Agent Coordination

We present a multi-agent learning algorithm, ALMA-Learning, for efficient and fair allocations in large-scale systems. We circumvent the traditional pitfalls of multi-agent learning (e.g., the moving target problem, the curse of dimensionality, or the need for mutually consistent actions) by relying on the ALMA heuristic as a coordination mechanism for each stage game. ALMA-Learning is decentralized, observes only own action/reward pairs, requires no inter-agent communication, and achieves near-optimal (<5% loss) and fair coordination in a variety of synthetic scenarios and a real-world meeting scheduling problem. The lightweight nature and fast learning constitute ALMA-Learning ideal for on-device deployment.

A Novel 3D Approach for Patient Schedule Using Multi-Agent Coordination

2012 ◽  
pp. 544-563
Author(s):  
E. Grace Mary Kanaga ◽  
M.L. Valarmathi ◽  
Preethi S.H. Darius
Keyword(s):  
Waiting Times ◽  
Coordination Mechanism ◽  
Total Weighted Tardiness ◽  
Communication Overhead ◽  
Patient Scheduling ◽  
Distributed Environment ◽  
Agent Based ◽  
Weighted Tardiness ◽  
Multi Agent ◽  
Automated Support

This chapter presents a novel 3D approach for patient scheduling (3D-PS) using multi-agents. Here the 3Ds refers to the Distributed, Dynamic and Decentralized nature of the patient scheduling. As in many other scheduling problems, in the hospital domain, a major problem is the efficient allocation of resources to the patients. The resources here mean the doctor, diagnosing equipments, lab tests, et cetera. Commonly, patient scheduling is performed manually by human schedulers with no automated support. Human scheduling is not efficient, because the nature of the problem is very complex; it is inherently distributed, dynamic, and decentralized. Since agents are known to represent distributed environment well and also being capable of handling dynamism, an agent based approach is chosen. The objectives are to reduce patient waiting times, minimize the patient stay in the hospital, and to improve resource utilization in hospitals. The comparison of several agent-based approaches is also reviewed, and the auction-based approach is chosen. The complete multi-agent framework given in literature is adapted to suit the patient scheduling scenario. The patient scheduling system is implemented in the JADE platform where patients and resources are represented as agents. The chief performance metric is the weighted tardiness which has to be minimized in order to obtain an effective schedule. The experiment is carried out using constant number of resources and varying number of patients. The simulation results are presented and analyzed. 3D-PS produces up to 30% reduction in total weighted tardiness in a distributed environment, as compared to other traditional algorithms. A further enhancement to this approach aims to reduce the communication overhead by reducing the number of messages passed and hence resulting in a better coordination mechanism. This auction based mechanism aims to provide the basic framework for future enhancements on patient scheduling.

A parametric family of Massey-type methods: inference, prediction, and sensitivity

2020 ◽  
Vol 16 (3) ◽  
pp. 255-269
Author(s):  
Enrico Bozzo ◽  
Paolo Vidoni ◽  
Massimo Franceschet
Keyword(s):  
Quantitative Analysis ◽  
Control Theory ◽  
Dynamic Systems ◽  
Parametric Family ◽  
Time Varying ◽  
Multi Agent ◽  
Key Features ◽  
The Stability ◽  
Agent Coordination ◽  
Time Aware

AbstractWe study the stability of a time-aware version of the popular Massey method, previously introduced by Franceschet, M., E. Bozzo, and P. Vidoni. 2017. “The Temporalized Massey’s Method.” Journal of Quantitative Analysis in Sports 13: 37–48, for rating teams in sport competitions. To this end, we embed the temporal Massey method in the theory of time-varying averaging algorithms, which are dynamic systems mainly used in control theory for multi-agent coordination. We also introduce a parametric family of Massey-type methods and show that the original and time-aware Massey versions are, in some sense, particular instances of it. Finally, we discuss the key features of this general family of rating procedures, focusing on inferential and predictive issues and on sensitivity to upsets and modifications of the schedule.

Sign in / Sign up

Export Citation Format

Share Document