• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.105-114
• /
• 2004

In this paper, we propose a collaboration method of diverse agents each others in multi-agent model and describe a node migration algorithm of Mobile-Agent (MA) using by the metadata of Naming-Agent (NA). Collaboration work of multi-agent assures stability of agent system and provides reliability of information retrieval on the distributed environment. NA, an important part of multi-agent, identifies each agents and series the unique name of each agents, and each agent references the specified object using by its name. Also, NA integrates and manages naming service by agents classification such as Client-Push-Agent (CPA), Server-Push-Agent (SPA), and System-Monitoring-Agent (SMA) based on its characteristic. And, NA provides the location list of mobile nodes to specified MA. Therefore, when MA does move through the nodes, it is needed to improve the efficiency of node migration by specified priority according to hit_count, hit_ratio, node processing and network traffic time. Therefore, in this paper, for the integrated naming service, we design Naming Agent and show the structure of metadata which constructed with fields such as hit_count, hit_ratio, total_count of documents, and so on. And, this paper presents the flow of creation and updating of metadata and the method of node migration with hit_count through the collaboration of multi-agent.

• The KIPS Transactions:PartB
• /
• v.8B no.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.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.51-58
• /
• 2009

Reinforcement learning is a sub area of machine learning concerned with how an agent ought to take actions in an environment so as to maximize some notion of long-term reward. In the case of multi-agent, especially, which state space and action space gets very enormous in compared to single agent, so it needs to take most effective measure available select the action strategy for effective reinforcement learning. This paper proposes a multi-agent reinforcement learning model based on fuzzy inference system in order to improve learning collect speed and select an effective action in multi-agent. This paper verifies an effective action select strategy through evaluation tests based on Robocup Keepaway which is one of useful test-beds for multi-agent. Our proposed model can apply to evaluate efficiency of the various intelligent multi-agents and also can apply to strategy and tactics of robot soccer system.

• Journal of Intelligence and Information Systems
• /
• v.10 no.3
• /
• pp.91-103
• /
• 2004

Multi-agent systems for semantic web applications require efficient implementation of agent architectures without sacrificing the flexibility and the level of abstraction that agent architectures provide. In this paper, we present an agent system, called VivAce, which is implemented in Java to achieve both high efficiency and the level of abstraction provided by the BDI agent architecture. VivAce (Vivid Agent Computing Environment) has the characteristics of a vivid agent through the BDI agent model. A vivid agent is a software-controlled system whose state comprises the mental components of knowledge, perceptions, tasks, and intentions, and whose behavior is represented by means of action and reaction rules. We first identify the requirements for multi-agent systems and then present the relevant features of VivAce and experimental results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.80-85
• /
• 2007

As home network system begins serving in earnest, the recent fruits of research in home service robot show that the new epoch that human and intelligent robots are living, communicating and interacting together at home, may come true in the near future. In the other hand, it is generally known that the multiagent system, performing distributed process together with other different devices in a home network system, is better than single robot or single home server for adapting themselves to home environment and completing their mission because the characteristic of home environment is 'open'. Therefore, in this paper we suggest the framework model to define agents, which is needed lot the home with a home network system, and the communication protocol architecture between agents. For this, we focus our attention on an agent comprising the set of many agent instances rather than the single intelligent or ability of a robot or home server, and also suggest the way of adaptation for agent systems to their environments and interaction with human in the manner of cooperation and negotiation among agents or agent instances in each agent.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.268-271
• /
• 2003

In this paper, we propose a new framework based on negotiatory mobile multi agent system, and implement a mobile multi agent environment based on DECAF(Distributed Environment-Centered Agent Framework) which is one of the distributed agent development toolkit so as to implement a new PDS(Personal Digital Library System). The new framework has some optimality and higher performance in distributed environments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.39-45
• /
• 2007

In this paper, we developed an intelligent web based e-learning system based on multi agents. To do development of the system, we applied an inclination test that is based on the education theory to do grouping the desirable e-learning community. The proposed system, Intelligent Web based e-learning Multi Agent System (IMAS), is used the multi agents paradigm including learning manner by neural network for grouping of e-learning community and a new distributed multi agent framework proposed here.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.280-283
• /
• 2003

A purpose of our research is an acquisition of cooperative behaviors in inhomogeneous multi-agent system. In this research, we used the fire panic problem as an experiment environment. In Fire panic problem a fire exists in the environment, and follows in each steps of agent's behavior, and this fire spreads within the constant law. The purpose of the agent is to reach the goal established without touching the fire, which exists in the environment. The fire heat up by a few steps, which exists in the environment. The fire has unsureness to the agent. The agent has to avoid a fire, which is spreading in environment. The acquisition of the behavior to reach it to the goal is required. In this paper, we observe how agents escape from the fire cooperating with other agents. For this problem, we propose a unique CMAC based Q-learning system for inhomogeneous multi-agent system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.49-57
• /
• 2008

In this paper, we suggested a methodology that can be used by an agent to learn models of other agents in a multi-agent system. To construct these model, we used influence diagram as a modeling tool. We present a method for learning models of the other agents at the decision nodes, value nodes, and chance nodes in influence diagram. We concentrated on learning of the other agents at the value node by using neural network learning technique. Furthermore, we treated anti-air units in anti-air defense domain as agents in multi. agent system.