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

• 한국정보시스템학회지:정보시스템연구
• /
• 제12권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.

• 한국전자거래학회지
• /
• 제2권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.

• 전자공학회논문지SC
• /
• 제37권5호
• /
• pp.34-45
• /
• 2000

이 논문에서는 부분관측하에서 직렬생산시스템에 대한 멀티에이젼트 내고장성 관리제어기법을 제안한다. 이를 위해 기존의 이산사건시스템에 대한 내고장성 관리제어기법에 멀티에이젼트 제어기법의 개념을 도입한다. 특히, 직렬연결된 프로세서 사이의 상호 내고장성 개념을 정립하며 제어결과의 상이정보를 이용한 관측불능 고장 식별에 관해 다룬다. 그리고 정립된 개념을 바탕으로 에이젼트 관리제어기의 설계기법을 정형화한다. 또한 제안하는 제어기법의 효용성을 검증하기 위해 폴리프로필렌의 예비중합공정과 중합공정에 있어서의 고장파급제어에 대한 사례연구를 살펴본다.

• 한국지능시스템학회논문지
• /
• 제14권2호
• /
• pp.156-163
• /
• 2004

이 논문에서는 다수의 에이전트, 외부 자원, 처리 작업이 존재하는 멀티에이전트 시스템 환경에서의 작업 처리를 위한 조정 협동 기법에 대해 기술한다. 에이전트는 특정 작업들을 실행할 수 있고, 외부 자원은 하나의 에이전트에 의해 사용되거나 여러 에이전트에 의해 공유될 수 있다. 작업은 에이전트에 의해 실행될 수 있는 여러 개의 부작업들로 구성된다. 여러 에이전트가 동일한 부작업을 실행할 수 있지만, 어떤 에이전트가 수행하느냐에 따라 비용이 달라질 수 있다. 따라서, 효율적인 작업 처리를 위해서는, 부작업을 적절한 에이전트에 할당하는 것과 각 에이전트에 할당된 부작업들에 대한 실행 순서를 정하는 스케줄링과 같은 에이전트 조정 작업이 필요하다. 이 논문에서는 이러한 멀티에이전트 시스템 환경에서의 작업처리를 위한 유전알고리즘(genetic algorithm) 기반의 조정 협동 기법을 제안한다. 또한, 실험을 통해 제안한 기법이 유용한 멀티에이전트 시스템 조정 협동 방법임을 보인다.

• 산업경영시스템학회지
• /
• 제32권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.

• 조명전기설비학회논문지
• /
• 제23권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).

• 한국산업정보학회논문지
• /
• 제12권1호
• /
• pp.87-94
• /
• 2007

분산 인공지능 기법들은 기존의 처리되지 못했던 많은 복잡한 문제들을 모델링하여 해결할 수 있도록 하고 있다. 특히 지능형 에이전트 기법은 분산 처리 환경 하에서 프로세스들 간의 각기 다른 문제 해결 능력들을 공유하도록 하는 방법들을 제공함으로써 효율적인 방법론이 될 수 있음을 증명하고 있다. 본 논문에서는 분산 환경의 스케줄링 문제에 에이전트 기법을 적용하여 문제를 해결하는 멀티에이전트 기반의 스케줄링 시스템 모델을 제안하고자 한다. 특히 멀티에이전트 스케줄링 시스템에 CSP 기법을 응용하여 모델링함으로써 효율적인 스케줄링이 이루어지도록 한다. 제안하는 모델에서는 스케줄링 문제를 제약조건에 따라 부문제들로 분할하고 부문제들에 대해서 분산되어 있는 각각의 에이전트가 자체적인 CSP 해결 기에 의해 해를 구하도록 한다. 본 논문에서는 제안하는 모델의 사례 연구로써 회의일정 스케줄링 문제를 통해 CSP의 모델링과 멀티에이전트 시스템을 이용한 문제해결 기법을 제시한다.

• 한국정보처리학회논문지
• /
• 제6권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.

• 한국지능시스템학회논문지
• /
• 제14권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.