• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제3권3호
• /
• pp.125-134
• /
• 2014

본 논문은 에이전트들 간의 긴밀한 협력을 위해 신속한 메시지 통신을 필요로 하는 응용 분야들을 지원하기 위한 다중 에이전트 메시지 전송 구조를 제안한다. 제안하는 구조는 FIPA(Foundation of Intelligent Physical Agents) 표준 에이전트 플랫폼 규격에서 에이전트들에게 메시지 전송 서비스를 제공하는 요소인 ACC(Agent Communication Channel)를 MTSA(Message Transfer Service Agent)라는 에이전트들의 집합으로 표현한다. MTSA는 비동기 메시지 통신을 지원하며, 메시지 수신을 효율적으로 처리하기 위해 반응자 패턴(reactor pattern)을 사용하며, 메시지 송신 에이전트와 수신 에이전트의 상대적 위치 관계에 따라 에이전트들 간에 최적의 통신 수단을 선택하여 메시지를 전송하여 에이전트들 간의 긴밀한 협력이 가능하도록 한다. 제안된 메시지 전송 구조에 따라 구현된 다중 에이전트 프레임워크 SMAF(Small Multi-Agent Framework)는 잘 알려진 에이전트 프레임워크 JADE(Java Agent Development Environment)와 비교하였을 때 향상된 메시지 전송 능력을 보인다. 다중 에이전트 구조의 메시지 통신 속도가 고속화되면 될수록 그 다중 에이전트 구조는 더 다양한 응용 분야들에 적용될 수 있을 것이다.

• 한국IT서비스학회지
• /
• 제18권3호
• /
• pp.17-35
• /
• 2019

Call centers do not simply play a role of responding to customers' calls, but they have developed into a core unit for maintaining competitiveness through services, marketing, or sales. Since the service quality of call centers heavily affects customer satisfaction, organizations have focused on enhancing it by reducing waiting time and increasing service level. One of the techniques, which improve the service quality of call centers, is to employ multi-skilled agents that can handle more than one type of calls. This study deals with three issues relevant to multi-skilled agents. First, we analyze how the way of allocating a specific group of agents to a set of skills affects the performance of call centers. Secondly, we investigate the relationship between the number of multi-skilled agents and the performance of call centers. Finally, we examine the impact of agent selection rules on the performance of call centers. Two selection rules are compared : the first rule is to assign a call to any available agent at random while the other rule is to assign a call preferably to single-skilled agents over multi-skilled agents when applicable. Based on simulation experiments, we suggest three implications. First, as the length of cycles in the agent-skill configuration network becomes longer, call centers achieve higher service level and shorter waiting time. Secondly, simulation results show that as the portion of multi-skilled agents increases, the performance of call centers improves. However, most of the improvement is attained when the portion of multi-skilled agents is relatively low. Finally, the agent selection rules do not significantly affect the call centers' performance, but the rule of preferring single-skilled agents tends to distribute the workload among agents more equally.

• International Journal of Control, Automation, and Systems
• /
• 제5권3호
• /
• pp.295-306
• /
• 2007

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• 로봇학회논문지
• /
• 제1권1호
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• 지능정보연구
• /
• 제9권1호
• /
• pp.1-21
• /
• 2003

전자상거래가 급속히 성장함에 따라 인터넷 상에서 인간을 대신하여 작업을 수행하는 에이전트가 활발히 사용되고 있다. 그러나, 현존하는 대부분의 전자상거래 에이전트들은 몇 가지 문제점을 가지고 있다. 그들은 구매자의 의사결정 행위 및 판매자의 정보 제공 활동을 완전히 지원하지 못하고 있다. 또한 이동 컴퓨팅 (mobile computing) 환경에도 적합하지 않다. 본 논문에서는 앞서 언급한 문제점들을 시정한, 개념적 프레임워크에 의거하여 개발된 다중-이동 에이전트 시스템 (MMAS: Multi-Mobile Agents System)을 소개한다. Tokyo IBM외 ASDK(Aglets Software Development Kit)을 사용하여 호텔 예약 분야에 대해 개발된 본 시스템은 상호 작용을 하는 구매자 측 에이전트와 사용자 측 에이전트로 구성되어 있다; 구매자 측 에이전트는 정보를 수집하고 다기준 의사결정 방법을 활용하여 이를 분석함으로써 구매자의 구매 의사결정을 도와주며, 판매자 측 에이전트는 판매자를 대신하여 데이터베이스를 관리하고 실시간 정보를 구매자 측 에이전트에게 제공한다. 본 시스템에서는 다중의 에이전트들이 효율성을 증대시키기 위하여 동시에 분담된 업무를 수행한다. 본 시스템은 위탁받은 작업이 끝나면 사용자들에게 이를 통지를 해주기 때문에 사용자들은 시스템과의 연결을 지속하고 있을 필요가 없다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.73-77
• /
• 2001

In this paper, we propose a virtual action system based on information agents, We call the system the MultiHammer, MultiHammer can be used for studying and analyzing online actions. MuiltiHammer provides functions of implement-ing a meta online action site and an experiment environ-ment. We have been using MultiHammer as an experiment as an experiment environment for BiddinBot. BiddingBot aims at assisting users to bid simultaneously in multiple online auctions. In order to bid simultaneously in multiple online auctions. In order to analyze the behavior of BiddngBot, we need to pur-chase a lot of items. It is hard for us to prepare a lot of fund to show usability and advantage of BiddingBot. MultiHam-mer enables us to effectively analyze the behavior of BiddingBot. MultiHammer consists of three types of agents for information collecting data storing and auctioning. Agents for information wrappers. To make agent work as wrarp-pers, we heed to realize software modules for each online action site. Implementing these modules reguires a lot of time and patience. To address this problem, we designed a support mechanism for developing the modules. Agents for data storing record the data gathered by agents for informa-tion collecting. Agents for auctioning provide online services using data recorded by agents for data storing. By recording the activities in auction sites. MultiHammer can recreate any situation and trace auction for experimentation, Users can participate in virtual using the same information in real online auctions. Users also participate in real auc-tions via wrapper agents for information collecting

• 정보처리학회논문지B
• /
• 제8B권6호
• /
• pp.587-594
• /
• 2001

멀티 에이전트 시스템은 분산적이고 개방적인 인터넷 환경에 잘 부합된다. 멀티 에이전트 시스템에서는 각 에이전트들이 자신의 목적을 위해 행동하기 때문에 에이전트간 충돌이 발생하는 경우에 조정을 통해 협력할 수 있어야 한다. 그러나 기존의 멀티 에이전트 시스템에서의 에이전트 간 협력 방법에 관한 연구 방법들은 동적 환경에서 서로 다른 목적을 갖는 에이전트간의 협동 문제를 올바로 해결할 수 없다는 문제가 있었다. 본 논문에서는 신경망과 강화학습을 이용하여 목적 패턴을 정확히 결정할 수 없는 복잡하고 동적인 환경하에서 멀티 에이전트의 자동조정 모델을 제안한다. 이를 위해 복잡한 환경과 다양한 행동을 갖는 멀티 에이전트간의 경쟁 실험을 통해 멀티 에이전트들의 행동의 영향을 분석 평가하여 제안한 방법이 타당함을 보였다.

• 지능정보연구
• /
• 제9권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.

• 정보교육학회논문지
• /
• 제3권2호
• /
• pp.41-53
• /
• 2000

본 연구는 웹 기반 협력학습을 위한 시스템에서 학습자의 학습을 돕기 위한 멀티에이전트간의 통신에 관한 연구이다. 우선, 에이전트 시스템에 대한 전반적인 내용과 특정을 고찰하였고 에이전트 상호간의 통신인 KQML에 대하여 살펴보았다. 또한 협력학습을 위한 에이전트 기반의 시스템 구조와 에이전트간의 상호 통신 방법을 제시하였다. Java 언어를 이용하여 협력학습 시스템을 설계 구현하였으며 실험을 통하여 에이전트간의 통신에 의한 협력학습 시스템의 효율성을 고찰하였다.

• 정보처리학회논문지B
• /
• 제8B권6호
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.