• 제어로봇시스템학회:학술대회논문집
• /
• 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 ...

• 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.

• The Journal of Society for e-Business Studies
• /
• v.2 no.2
• /
• pp.55-74
• /
• 1997

In this paper, the concept of coordination under the setting of cooperative multiagent systems is examined. Based on the concept, a computational model in which the key constructs of coordination can be precisely defined is developed. This model can serve as a basis for developing software systems designed to support coordination in Eletronic Commerce. Coordination is viewed as management of conflicting demands on finite resources by actors or acitivities. The model views coordination as a cycle of four phases: the definition phase, the conflict resolution phase, the action phase, and the adaptation phase. Then, a formal model of coordination, both as a phenomenon and as a process is devloped. Within the context of this model, important concepts such as decomposability, informational privacy, informational decentralization, and informational efficiency are examined.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.5
• /
• pp.34-45
• /
• 2000

In this paper, a multiagent fault-tolerant supervisory control methodology is proposed for serial production systems under partial observation. To this end, the idea of multiagent control is incorporated with the fault-tolerant supervisory control of discrete event systems. Especially, the concept of mutual fault-tolerance between cascaded processes is established and the unobservable fault identification utilizing the difference information of the controlled results is investigated. Then the synthesis of agent supervisors is formulated based on the proposed concept. A case study of the fault-propagation control of polypropylene prepolymerization and polymerization processes is provided to illustrate the proposed control policy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.156-163
• /
• 2004

This paper is concerned with coordinated collaboration of multiagent system in which there exist multiple agents which have their own set of skills to perform some tasks, multiple external resources which can be either used exclusively by an agent or shared by the specified number of agents at a time, and a set of tasks which consists of a collection of subtasks each of which can be carried out by an agent. Even though a subtask can be carried out by several agents, its processing cost may be different depending on which agent performs it. To process tasks, some coordination work is required such as allocating their constituent subtasks among competent agents and scheduling the allocated subtasks to determine their processing order at each agent. This paper proposes a genetic algorithm-based method to coordinate the agents to process tasks in the considered multiagent environments. It also presents some experiment results for the proposed method and shows that the proposed method is a useful coordination collaboration method of multiagent system.

• 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).

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.1
• /
• pp.87-94
• /
• 2007

Many researchers have modeled complicated problems with distributed AI technologies in distributed environment. Especially, intelligent agent technology we often proposed among researchers as efficient method to solve the complicated problems because agent technology makes possibile to share different problem solving abilities among processors in distributed processing environment. In this paper, we propose multiagent system model to solve distributed scheduling problem. At this point we apple CSP techniques to the multiagent model as individual problem solving ability of member agents. Scheduling problem is divided into subproblems according to constraints by distributed resources, then each agent solves its subproblem using CSP solver in the proposed model. This method improves scheduling efficiency. For meeting scheduling problem of case study, we show CSP modeling process and suggest problem solving procedure by multiagent system model.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2989-3000
• /
• 1999

Until now, most Intelligent Tutoring Systems are lacking in the modularity, the extensibility of the system, and the flexibility in the dynamic environment due to the static exchanges of knowledge among modules. To overcome these flexibility in the dynamic due to the static exchanges of knowledge among modules. To overcome these problems, we will suggest, in this paper, a Distance Intelligent Tutoring Framework, called DELFOM, based on the multiagent to cope with the various and complicated learner's requests. We could make different types of learning systems by simply changing the contents of DELFOM External that is variant part of DELFOM. This framework, therefore, provides software reuse and the extensibility based on object-oriented paradigm. And we will propose two different distance learning systems using DELFOM. Therefore this framework gives the developer/the learner the effective and easy development/learning environment. DELFOM is implemented using CORBA and Java for the network transparency and platform independence.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.678-686
• /
• 2004

This paper presents a new method to securely conduct online sealed-bid auctions with a single auctioneer server The sealed-bid auctions have several vulnerable security problems when they are performed on the Internet. One of such problems is the trust establishment between an auctioneer and bidders who participate in an auction. Several online sealed-bid auction methods have been developed to address this trust problem. The proposed method solves the security problems that would happen in the sealed-bid auction using a blind signature scheme and a contract signature protocol. It prevents the auctioneer from illegally manipulating the bidders' bidding information, repudiating the reception of some bid, manipulating the auction period, and illegally adding or deleting bids. In addition, it keeps the bidders from modifying the bidding information after issuing their bid and doing intentional mistake to invalidate their own bid. The method can be easily implemented using the multiagent architecture.