• Journal of Electrical Engineering and Technology
• /
• v.6 no.1
• /
• pp.139-146
• /
• 2011

This paper presents a new modified Contract Net Protocol (CNP) for microgrid operation based on multiagent system. The CNP is a widely used protocol for interactions among distributed problem solving. The Contract Net Interaction Protocol of the Foundation for Intelligent Physical Agents (FIPA-CNIP) is a minor modification of the original CNP for multiagent system applications. In this paper, a modified CNP (MCNP) based on the FIPA-CNIP is proposed for more specialized interactions among agents for microgrid operation. A multiagent system is designed and constructed for microgrid operation. A microgrid operation based on the multiagent system is tested to check the functionality of the proposed MCNP.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.2
• /
• pp.246-254
• /
• 2010

This paper presents a multiagent system for microgrid operation in the grid-interconnected mode. An energy market environment with generation competition is adopted for microgrid operation in order to guarantee autonomous participation and meet the requirements of participants in the microgrid. The modified Contract Net Protocol (CNP) is used as a protocol for interactions among agents. The multiagent system for microgrid operation based on the modified CNP and the energy market environment is designed and implemented. To verify the feasibility of the suggested multiagent system, experiments on three operation conditions are carried out.

• The Journal of Information Systems
• /
• v.12 no.2
• /
• pp.57-72
• /
• 2003

The purpose of this paper is to propose the modeling of multiagent based SCM and implement the prototype in the Internet environment. SCM process follows the supply chain operations reference (SCOR) model which has been suggested by Supply Chain Counsil. SCOR model has been positioned to become the industry standard for describing and improving operational process in SCM. Five basic processes, plan, source, matte, deliver and return are defined in the SCOR model, through which a company establishes its supply chain competitive objectives. A supply chain is a world wide network of suppliers, factories, warehouses, distribution centers and retailers through which raw materials are acquired, transformed or manufactured and delivered to customers by autonomous or semiautonomous process. With the pressure from the higher standard of customer compliance, a frequent model change, product complexity and globalization, the combination of supply chain process with an advanced infrastructure in terms of multiagent systems have been highly required. Since SCM is fundamentally concerned with coherence among multiple decision makers, a multiagent framework based on explicit communication between constituent agents such as suppliers, manufacturers, and distributors is a natural choice. Multiagent framework is defined to perform different activities within a supply chain. Dynamic and changing functions of supply chain can be dealt with multi-agent by cooperating with other agents. In the areas of inventory management, remote diagnostics, communications with field workers, order fulfillment including tracking and monitoring, stock visibility, real-time shop floor data collection, asset tracking and warehousing, customer-centric supply chain can be applied and implemented utilizing multiagent. In this paper, for the order processing event between the buyer and seller relationship, multiagent were defined corresponding to the SCOR process. A prototype system was developed and implemented on the actual TCP/IP environment for the purchase order processing event. The implementation result assures that multiagent based SCM enhances the speed, visibility, proactiveness and responsiveness of activities in the supply chain.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.149.3-149
• /
• 2001

Task allocation is a key problem in multiagent systems. The importance of automated negotiation protocols for solving the task allocation problem is increasing as a consequence of increased multi-agent applications. In this paper, we introduce the multiagent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest Vickery auction as an inter-agent coordination mechanism for solving this problem. In order to apply this market-based coordination mechanism into multiagent TSPs, we define the profit of each agent, the ultimate goal of negotiation, cities to be traded out through auctions, the bidding strategy, and the order of auctions. The primary advantage of such approach is that it can find an optimal task allocation ...

• Journal of Electrical Engineering and Technology
• /
• v.6 no.2
• /
• pp.284-292
• /
• 2011

This paper presents a load-shedding scheme using the Talmud rule in islanded microgrid operation based on a multiagent system. Load shedding is an intentional load reduction to meet a power balance between supply and demand when supply shortages occur. The Talmud rule originating from the Talmud literature has been used in bankruptcy problems of finance, economics, and communications. This paper approaches the load-shedding problem as a bankruptcy problem. A load-shedding scheme is mathematically expressed based on the Talmud rule. For experiment of this approach, a multiagent system is constructed to operate test islanded microgrids autonomously. The suggested load-shedding scheme is tested on the test islanded microgrids based on the multiagent system. Results of the tests are discussed.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.165-177
• /
• 2008

An important issue in Multiagent reinforcement learning is how an agent should learn its optimal policy in a dynamic environment where there exist other agents able to influence its own performance. Most previous works for Multiagent reinforcement learning tend to apply single-agent reinforcement learning techniques without any extensions or require some unrealistic assumptions even though they use explicit models of other agents. In this paper, a Naive Bayesian based policy model of the opponent agent is introduced and then the Multiagent reinforcement learning method using this model is explained. Unlike previous works, the proposed Multiagent reinforcement learning method utilizes the Naive Bayesian based policy model, not the Q function model of the opponent agent. Moreover, this learning method can improve learning efficiency by using a simpler one than other richer but time-consuming policy models such as Finite State Machines(FSM) and Markov chains. In this paper, the Cat and Mouse game is introduced as an adversarial Multiagent environment. And then effectiveness of the proposed Naive Bayesian based policy model is analyzed through experiments using this game as test-bed.

• Journal of KIISE:Software and Applications
• /
• v.35 no.3
• /
• pp.179-188
• /
• 2008

An important issue in multiagent reinforcement learning is how an agent should team its optimal policy through trial-and-error interactions in a dynamic environment where there exist other agents able to influence its own performance. Most previous works for multiagent reinforcement teaming tend to apply single-agent reinforcement learning techniques without any extensions or are based upon some unrealistic assumptions even though they build and use explicit models of other agents. In this paper, basic concepts that constitute the common foundation of multiagent reinforcement learning techniques are first formulated, and then, based on these concepts, previous works are compared in terms of characteristics and limitations. After that, a policy model of the opponent agent and a new multiagent reinforcement learning method using this model are introduced. Unlike previous works, the proposed multiagent reinforcement learning method utilize a policy model instead of the Q function model of the opponent agent. Moreover, this learning method can improve learning efficiency by using a simpler one than other richer but time-consuming policy models such as Finite State Machines(FSM) and Markov chains. In this paper. the Cat and Mouse game is introduced as an adversarial multiagent environment. And effectiveness of the proposed multiagent reinforcement learning method is analyzed through experiments using this game as testbed.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1803-1811
• /
• 1996

In a distributed multiagent framework, the capabilities of each agent are known to other agents. Namely, each agent in a multiagent society is aware of what agents are available in the whole society, which is able to solve a query, and how to contact them. This characteristic leads to the simplicity in controling both local and remote interactions among agents by using a fixed form for communication packes. This paper presents methods for controlling interactions among agents in this distributed multiagent frame-work. Agent interactions are described within the platform of MASCOT that is a tightly coupled multiagent system developed for the role of a computer secretary. A frame-like form of a commumication packet is defined, and protocols for message exchanges are presented. Also, ascenarios given to demonstrate how the communication mechanism controls agent intercations in MASCOT.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.72-78
• /
• 2009

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.11
• /
• pp.34-43
• /
• 2009

SCADA (Supervisory Control and Data Acquisition) system has been used for remote measurement and control on the critical infrastructures as well as modem industrial facilities. As cyber attacks increase on communication networks, SCADA network has been also exposed to cyber security problems. Especially, SCADA systems of energy industry such as electric power, gas and oil are vulnerable to targeted cyber attack and terrorism Recently, many research efforts to solve the problems have made progress on SCADA network security. In this paper, flexible key distribution concept is proposed for improving the security of SCADA network using Multiagent System (MAS).