• Title/Summary/Keyword: Multiple agent

Search Result 481, Processing Time 0.024 seconds

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Decentralized Control of Multiple Agents for Optimizing Target Tracking Performance and Collision Avoidance (표적 추적 성능 최적화 및 충돌 회피를 위한 다수 에이전트 분산 제어)

  • Kim, Youngjoo;Bang, Hyochoong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.9
    • /
    • pp.693-698
    • /
    • 2016
  • A decentralized control method is proposed to enable a group of robots to achieve maximum performance in multisensory target tracking while avoiding collision with the target. The decentralized control was designed based on navigation function formalism. The study showed that the multiple agent system converged to the positions providing the maximum performance by the decentralized controller, based on Lyapunov and Hessian theory. An exemplary simulation was given for a multiple agent system tracking a stationary target.

Mobile Robot Localization using Ubiquitous Vision System (시각기반 센서 네트워크를 이용한 이동로봇의 위치 추정)

  • Dao, Nguyen Xuan;Kim, Chi-Ho;You, Bum-Jae
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2780-2782
    • /
    • 2005
  • In this paper, we present a mobile robot localization solution by using a Ubiquitous Vision System (UVS). The collective information gathered by multiple cameras that are strategically placed has many advantages. For example, aggregation of information from multiple viewpoints reduces the uncertainty about the robots' positions. We construct UVS as a multi-agent system by regarding each vision sensor as one vision agent (VA). Each VA performs target segmentation by color and motion information as well as visual tracking for multiple objects. Our modified identified contractnet (ICN) protocol is used for communication between VAs to coordinate multitask. This protocol raises scalability and modularity of thesystem because of independent number of VAs and needless calibration. Furthermore, the handover between VAs by using ICN is seamless. Experimental results show the robustness of the solution with respect to a widespread area. The performance in indoor environments shows the feasibility of the proposed solution in real-time.

  • PDF

A Case Report of Partial Remission of Renal Cell Carcinoma with Multiple Liver Metastases Treated with Korean Herbal Medicine in Conjunction with Targeted Anticancer Therapy Afinitor (한약치료와 표적항암요법(아피니토)을 병행하여 부분 관해 된 신세포암 간전이 환자 1례)

  • Chang, Sung-Hwan;Park, Ji-Hye;Yoo, Hwa Seung
    • Journal of Korean Traditional Oncology
    • /
    • v.22 no.2
    • /
    • pp.13-24
    • /
    • 2017
  • Objectives: The purpose of this study is to report the effect of Korean Herbal Medicine (KHM) on a Renal Cell Carcinoma with multiple liver metastases patient. Methods: One renal cell carcinoma with multiple liver metastases patient was treated by KHM in conjunction with targeted anticancer agent (Afinitor). The effect of KHM was measured by scanning with Computed Tomography (CT), Blood Test, Visual Analogue Scale (VAS) and Eastern Cooperative Oncology Group scale. Results: Multiple hepatic tumors were reduced after the treatment during 5 months (Partial Remission, PR). As treatment was performed, complications induced by targeted anticancer agent (Afinitor) were alleviated. Conclusions: This case provides us a possibility that Korean Herbal Medicine offers potential benefits for renal cell carcinoma with multiple liver metastases patient.

A Fault-Tolerance Agent for Multimedia Collaboration Works running on Vehicle Environment (차량 환경 상에서 멀티미디어 공동 작업을 위한 결함 허용 에이전트)

  • Ko, Eung-Nam
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.1
    • /
    • pp.157-161
    • /
    • 2011
  • This paper explains an error process for multimedia collaboration works with session management running on vehicle network environment. This system consists of an FDA and FRA. FDA is an agent that detects an error by hooking techniques for multimedia system based on vehicle network environment with session management. FRA is a system that is suitable for recovering software error for multimedia system with session management based on vehicle network environment. This paper describes only FRA. When multiple local sessions is opened, each local session manager sends information of participant to global session manager and take current information about session of processing in network.

Opportunistic Spectrum Access with Discrete Feedback in Unknown and Dynamic Environment:A Multi-agent Learning Approach

  • Gao, Zhan;Chen, Junhong;Xu, Yuhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3867-3886
    • /
    • 2015
  • This article investigates the problem of opportunistic spectrum access in dynamic environment, in which the signal-to-noise ratio (SNR) is time-varying. Different from existing work on continuous feedback, we consider more practical scenarios in which the transmitter receives an Acknowledgment (ACK) if the received SNR is larger than the required threshold, and otherwise a Non-Acknowledgment (NACK). That is, the feedback is discrete. Several applications with different threshold values are also considered in this work. The channel selection problem is formulated as a non-cooperative game, and subsequently it is proved to be a potential game, which has at least one pure strategy Nash equilibrium. Following this, a multi-agent Q-learning algorithm is proposed to converge to Nash equilibria of the game. Furthermore, opportunistic spectrum access with multiple discrete feedbacks is also investigated. Finally, the simulation results verify that the proposed multi-agent Q-learning algorithm is applicable to both situations with binary feedback and multiple discrete feedbacks.

Explicit Dynamic Coordination Reinforcement Learning Based on Utility

  • Si, Huaiwei;Tan, Guozhen;Yuan, Yifu;peng, Yanfei;Li, Jianping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.3
    • /
    • pp.792-812
    • /
    • 2022
  • Multi-agent systems often need to achieve the goal of learning more effectively for a task through coordination. Although the introduction of deep learning has addressed the state space problems, multi-agent learning remains infeasible because of the joint action spaces. Large-scale joint action spaces can be sparse according to implicit or explicit coordination structure, which can ensure reasonable coordination action through the coordination structure. In general, the multi-agent system is dynamic, which makes the relations among agents and the coordination structure are dynamic. Therefore, the explicit coordination structure can better represent the coordinative relationship among agents and achieve better coordination between agents. Inspired by the maximization of social group utility, we dynamically construct a factor graph as an explicit coordination structure to express the coordinative relationship according to the utility among agents and estimate the joint action values based on the local utility transfer among factor graphs. We present the application of such techniques in the scenario of multiple intelligent vehicle systems, where state space and action space are a problem and have too many interactions among agents. The results on the multiple intelligent vehicle systems demonstrate the efficiency and effectiveness of our proposed methods.

FACILITATING NEGOTIATIONS IN AGENT MEDIATED ELECTRONIC COMMERCE

  • Miao, Chunyan;Goh, Agenla;Yang, Zhonghua
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.16-22
    • /
    • 2001
  • There is no doubt that agents play an increasingly predominant role in e-commerce, whether these are business-to-consumer or business-to-business applications. However most of the current e-commerce agents only support a single bid for a product at a fixed price. Although price is an important factor, it is not the only concern of both business and consumer. There is doubt as to whether such agents satisfv both parties. Negotiation on a variety of issues is needed in order to reach an agreement. In this paper, a computational agent negotiation(CAN) model is proposed to facilitate multiple-issue negotiation via an agent. The main contribution of the CAN model is it enables agent to participate actively in the negotiation with various feedback instead of simply an agreement or rejection.

  • PDF

Rate Adaptation with Q-Learning in CSMA/CA Wireless Networks

  • Cho, Soohyun
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1048-1063
    • /
    • 2020
  • In this study, we propose a reinforcement learning agent to control the data transmission rates of nodes in carrier sensing multiple access with collision avoidance (CSMA/CA)-based wireless networks. We design a reinforcement learning (RL) agent, based on Q-learning. The agent learns the environment using the timeout events of packets, which are locally available in data sending nodes. The agent selects actions to control the data transmission rates of nodes that adjust the modulation and coding scheme (MCS) levels of the data packets to utilize the available bandwidth in dynamically changing channel conditions effectively. We use the ns3-gym framework to simulate RL and investigate the effects of the parameters of Q-learning on the performance of the RL agent. The simulation results indicate that the proposed RL agent adequately adjusts the MCS levels according to the changes in the network, and achieves a high throughput comparable to those of the existing data transmission rate adaptation schemes such as Minstrel.