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

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

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.855-864
• /
• 2001

With the increasing importance and complexity of EC (Electronic Commerce) across the Internet, the need and expectation for intelligent software agents to support both consumers and suppliers through the whole process of EC are growing rapidly. To realize the intelligent EC. a multiagent based EC system. which includes foundational technologies such as the establishment of standard product ontology the definition of message and negotiation protocol and brockering, is required. In this paper we propose an intelligent EC System named ICOMA(Intelligent electronic CO mmerce system based on Multi-Agent) as an open infrastructure of multiagent-based EC. Concretely we have proposed. designed and implemented an architecture of multiagent-based EC system including 6-types of agents message protocol for inter-agent negotiation, personalized produst retrieval and filtering., We have confirmed the effectiveness of the system through experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.7
• /
• pp.35-48
• /
• 2022

In this study, it propose a proof theory method for expressing and reasoning knowledge in a multiagent environment. Since this method determines logical results in a mechanical way, it has developed as a core field from early AI research. However, since the proposition cannot always be proved in any set of closed sentences, in order for the logical result to be determinable, the range of expression is limited to the sentence in the form of a clause. In addition, the resolution principle, a simple and strong reasoning rule applicable only to clause-type sentences, is applied. Also, since the proof theory can be expressed as a meta predicate, it can be extended to the metalogic of the proof theory. Metalogic can be superior in terms of practicality and efficiency based on improved expressive power over epistemic logic of model theory. To prove this, the semantic method of epistemic logic and the metalogic method of proof theory are applied to the Muddy Children problem, respectively. As a result, it prove that the method of expressing and reasoning knowledge and common knowledge using metalogic in a cooperative multiagent environment is more efficient.

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

• Radiation Oncology Journal
• /
• v.2 no.1
• /
• pp.115-122
• /
• 1984

Total 125 patinets with primary and metastatic Ewing's sarcoma were treated in various ways between 1963 to 1977. Patients were divided into 3 groups according to the treatment methods. Group 1 was nonprotocol patients with or without chemotherapy. Total 58 patients were entered. Group 1 was divided into 2 subgroups. 33 patients were treated locally without chemotherapy and 25 Patients were treated with local therapy and nonprotocol chemotherapy. Group 2 was treated with local therapy and plus T-2 regimen multiagent chemotherapy. 29 patients were entered. Group 3 was treated with local therapy and T-6 regimen multiagent chemotherapy. 38 patients were entered. Local treatments for primary tumor were surgery and/or radiation therapy. Radiation dose ranged between 2,000 and 8,000 rad. Patients with pulmonary metastases received bilateral pulmonary RT. Local recurrence rate was analyzed according to treatment groups and was $16.8\%$. Local 15 yr survival was $33\%$ and 8 yr survival of T-6 group was $64.9\%$. An analysis of time were pattern of recurrence of each group, and the correlation of with radiation dose with local recurrence done. This study concluded that intensive multiagent chemotherapy RT and/or surgery (T-6 regimen) reduced distant metastases, and produced significant increase in local control and survival.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2280-2288
• /
• 1997

An agent is a software element that, by making use of knowledge and inference, performs tasks on behalf of the user. In general, an agent has the properties of autonomy, social ability, reactivity, and durability. Many researches on agents are more and more aiming at the multiagent systems since it is not sufficient to let a single agent do the whole things, especially in a real world where tasks require many diverse activities. However, the multiagent frameworks still have some limitations in the processing of user queries that are often ambiguous and goal-oriented. Also, a series of procedures or plans could not be generated from a single query directly. In order to give more intelligence to the multiagent framework, we propose a method of extending the framework with a plan generation module. The open agent architecture (OAA), which is a multiagent framework that we developed, is integrated with UCPOP, which is a AI planner. A travel schedule management agent (TSMA) system is implemented to explore the effects of the method. The extended system enables the user to only specify goal-oriented queries, and the plans and procedures to satisfy these goals are generated automatically. Also, this system provides a cooperative and knowledge-sharing environment that integrates several knowledge-based systems and planning systems that are distributed and used independently.

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