• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.660-668
• /
• 2007

In order to improve the efficiency of service restoration function in the current Distribution Automation System (DAS), in this paper it is proposed a more advanced and efficient service restoration approach using Multi-Agent technique based on distributed networks. In the current DAS, communication networks or protocol structures are centralized with communications between the central station and FRTU through 1:1 connection. In order to maintain the current systems and enhance the proposed Multi-Agent based service restoration scheme, a device of communication and intelligence, named MASX, is newly developed to make a FRTU as an agent to cooperate each others. the proposed system applied in a demo system for an distribution automation system and shows 8 times reduction of restoration time in restoration of blackouts.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.401-412
• /
• 2008

This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differential flatness approach. Three scenarios of multi-agent tasking are proposed at the cooperative task planning framework. Given agent dynamics, both spatial and temporal constraints are considered in the path planning. The path planning algorithm first finds trajectory curves in a lower-dimensional space and then parameterizes the curves by a set of B-spline representations. The coefficients of the B-spline curves are further solved by a sequential quadratic programming solver to achieve the optimization objective and satisfy these constraints. Finally, several illustrative examples of cooperative path/task planning are presented.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.4_5
• /
• 2009

A new protection coordination algorithm in Multi-Agent based distribution automation system is proposed in this paper. Distribution network protection coordination is acted by normal state distribution operation. But, in more and more complex distribution network structure, it has a big problem that central server processed all measurement data, coordination setting and controls for operation. So, a algorithm to change coordination setting is proposed automatically in terminal devices which Recloser and OCR to include Multi-Agent concepts in distribution network.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.154-154
• /
• 2000

The cooperative strategy for the teleoperated multi-agent system is presented. And this scheme has been applied to the teleoperated robot soccer system that is newly proposed. For the teleoperated robot soccer system, we made mapping functions to control a 2-wheeled mobile robot using a 2 DoF stickcontroller. The simulation with a real stickcontroller has been evaluated the performance of the proposed mapping function. Then, the basic cooperation strategy has been tested between teleoperated robot and autonomous robot It is shown that the multi-agent system for teleoperation can have a good performance for a job Like a scoring a goal

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.521-522
• /
• 2007

본 논문은 Multi-agent 이론을 적용하여 저주파수 계전 알고리즘을 설계하는 방법을 제안하였다. 먼저 저주파수 계전에 필요한 사항을 알아보았다. 그 다음으로 현재 계통에 적용된 부하차단을 알아보고 이를 개선할 수 있는 Multi-agent 이론을 적용한 저주파수 계전 방법을 선택하여 그 방법의 적용 가능성을 제시하였다.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.8
• /
• pp.365-372
• /
• 2001

This paper presents a new protection concept to achieve the adaptive optimal function by introducing the multi-agent system technology. Making each relay an agent which consists of relay agent module and coordinator module, each agent works autonomously to improve protection capability by cooperating with other agents. It is applied to the overcurrent protection system of the industrial power system in order to show the feasibility of the proposed methodology.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.123-133
• /
• 2001

Medical domain is very applicable for multi-agent system because medical information systems need much knowledge and close relationship with medical staff, In this paper, we describe design and implementation of an intelligent medical multi-agent platform that provides medical images'information services. This platform supports a physical environment that medical agents can be deployed following FIPA(Foundation for Intelligent Physical Agent)\`s agent management reference model. To use a variety of components on Windows, COM(Common Object Model) interfaces and XML(extensible Markup Language) for encoding ACL(Agent Communication Language) are used for multi-agent communications. Since many kinds of diverse and close relationships with medical staff) are essential, a medical staff is conceptualized as an agent and integrated with multi-agent systems. Also it provides an infrastructure applicable to share necessary knowledge between human agents and software agents in order to make intelligent medical information services easier.

• Journal of Intelligence and Information Systems
• /
• v.9 no.3
• /
• pp.1-21
• /
• 2003

In this research, we developed a Multi-Agent based Negotiation Support System to be able to increase the competitive power of a company in dynamic environment and correspond to various orders of customers by diffusion of electronic commerce. The system uses the agent technology that is being embossed as new paradigm in dynamic environment and flexible system framework. The multi-agent technology is used to solve these problems through cooperation of agent. The system consists of six sub agents: Mediator, manufacturability Analysis Agent, Process Planning Agent, Scheduling Agent, Selection Agent, Negotiation-strategy Building Agent. In this paper, the proposed Multi-Agent based Negotiation Support System takes aim at the automation of transaction process from ordering to manufacturing plan through the automation of negotiation that is the most important in order-taking transaction.

• Journal of Intelligence and Information Systems
• /
• v.9 no.2
• /
• pp.155-169
• /
• 2003

A multi-agent technology has emerged as new paradigms that can flexibly and promptly cope with various environmental changes and complex problems. Accordingly, many studies have been carried out to establish multi-agent systems in an effort to solve dynamic problems in many fields. However, most previous research on the multi-agent frameworks aimed at, on the behalf of a user, exchanging and sharing information among agents, reusing agents, and suggesting job cooperation in order to integrate and assimilate heterogeneous agents. That is, their frameworks mainly focused on the basic functions of general multi-agents. Therefore, they are not suitable to the development of the proper system for a specific field such as a negotiation. The goal of this research is to design a multi-agent framework for the negotiation system that supports the evaluation of the negotiation messages, management of the negotiation messages, and message exchanges among the negotiation agents.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.61-69
• /
• 2022

A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.