• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.181-193
• /
• 2009

This paper presents a framework for controlling mobile multiple robots connected by communication networks. This framework provides novel methods to control coordinated systems using mobile agents. The combination of the mobile agent and mobile multiple robots opens a new horizon of efficient use of mobile robot resources. Instead of physical movement of multiple robots, mobile software agents can migrate from one robot to another so that they can minimize energy consumption in aggregation. The imaginary application is making "carts," such as found in large airports, intelligent. Travelers pick up carts at designated points but leave them arbitrary places. It is a considerable task to re-collect them. It is, therefore, desirable that intelligent carts (intelligent robots) draw themselves together automatically. Simple implementation may be making each cart has a designated assembly point, and when they are free, automatically return to those points. It is easy to implement, but some carts have to travel very long way back to their own assembly point, even though it is located close to some other assembly points. It consumes too much unnecessary energy so that the carts have to have expensive batteries. In order to ameliorate the situation, we employ mobile software agents to locate robots scattered in a field, e.g. an airport, and make them autonomously determine their moving behaviors by using a clustering algorithm based on the Ant Colony Optimization (ACO). ACO is the swarm intelligence-based methods, and a multi-agent system that exploit artificial stigmergy for the solution of combinatorial optimization problems. Preliminary experiments have provided a favorable result. In this paper, we focus on the implementation of the controlling mechanism of the multi-robots using the mobile agents.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.109-119
• /
• 2004

The home network environment can be defined as a network environment, connecting digital home devices such as computer systems, digital appliances, and mobile devices. In this kind of home network environments, there will be numerous local/remote interactions to monitor and control the home network devices and the home gateway. Such an environment may result in communication bottleneck. By applying the mobile agents that can migrate among the computing devices autonomously and work on behalf of the user, remote interactions and network traffics can be reduced enormously. The mobile agent authentication is necessary to apply mobile agent concept to the home network environments, as a prerequisite technology for authorization or access control to the home network devices and resources. The existing mobile agent systems have mainly used the public key based authentication scheme, which is not suitable to the home network environments, composed of digital devices of limited computation capability. In this paper, we propose a shared key based mobile agent authentication scheme for single home domain and expand the scheme to multiple domain environments with the public key based authentication scheme. Application of the shared key encryption scheme to the single domain mobile agent authentication enables to authenticate the mobile agent with less overhead than the public key based authentication scheme.

• Journal of Information Technology Applications and Management
• /
• v.19 no.1
• /
• pp.37-46
• /
• 2012

The scheduling problem of large products like ships, airplanes, space shuttles, assembled constructions, and automobiles is very complex in nature. To reduce inherent computational complexity, we often design scheduling systems that the original problem is decomposed into small sub-problems, which are scheduled independently and integrated into the original one. Moreover, the steep growth of communication technology and logistics makes it possible to produce a lot of multi-nation corporation by which products are produced across more than one plant. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. In this research, we suggest an agent-based coordinating mechanism for multi-level scheduling systems in supply chain. For design of a general coordination mechanism, at first, we propose a grammar to define individual scheduling agents which are responsible to their own plants, and a meta-level coordination agent which is engaged to supervise individual scheduling agents. Second, we suggest scheduling agent communication protocols for each scheduling agent topology which is classified according to the system architecture, existence of coordinator, and direction of coordination. We also suggest a scheduling agent communication language which consists of three layers : Agent Communication Layer, Scheduling Coordination Layer, Industry-specific Layer. Finally, in order to improve the efficiency of communication among scheduling agents we suggest a rough capacity coordination model which supports to monitor participating agents and analyze the status of them. With this coordination mechanism, we can easily model coordination processes of multiple scheduling systems. In the future, we will 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 experiment using the real-world data will be performed to examine this mechanism.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.42-47
• /
• 2015

This paper presents a rank-based formation for multiple agents based on potential functions, where the proposed method uses the relative position of two neighboring agents. The conventional formation scheme of multiple systems requires communication between agents and a central computer to get the positions of all multiple agents. In the study, differently from previous studies, the formation scheme uses the relative position of two neighboring agents in a local coordinate system. In addition, it introduces a singular agent association that considers only the relative position between an agent and its neighboring agents, instead of multiple associations among all information about all agents. Furthermore, the proposed framework explores the benefits of different formation types. Extensive simulation results show that the proposed approach verifies the viability and effectiveness of the proposed formation.

• Journal of the Korean Solar Energy Society
• /
• v.34 no.4
• /
• pp.23-29
• /
• 2014

Recently, in power system studies, Multiple Energy Carriers (MECs) such as Energy Hub has been broadly utilized in power system planners and operators. Particularly, Energy Hub performs one of the most important role as the intermediate in implementing the MECs. However, it still needs to be put under examination in both modeling and operating concerns. For instance, a probabilistic optimization model is treated by a robust global optimization technique such as multi-agent genetic algorithm (MAGA) which can support the online economic dispatch of MECs. MAGA also reduces the inevitable uncertainty caused by the integration of selected input energy carriers. However, MAGA only considers current state of the integration of selected input energy carriers in conjunctive with the condition of smart grid environments for decision making in Energy Hub. Thus, in this paper, we propose an immune algorithm based Multiple Energy Carriers System which can adopt the learning process in order to make a self decision making in Energy Hub. In particular, the proposed immune algorithm considers the previous state, the current state, and the future state of the selected input energy carriers in order to predict the next decision making of Energy Hub based on the probabilistic optimization model. The below figure shows the proposed immune algorithm based Multiple Energy Carriers System. Finally, we will compare the online economic dispatch of MECs of two algorithms such as MAGA and immune algorithm based MECs by using Real Time Digital Simulator (RTDS).

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.30 no.3
• /
• pp.106-113
• /
• 1988

This study was performed to obtain the basic data which can be applied to use of foamihg mortars. 1. At the mixing ratio 1:1, the highest strengths were showed by foaming mortam, respec - tively. But, it. gradually was decreased in poorer mixing ratio and more addition of foam- ing agent. The decreasing rates of strengths were incresed in poorer mixing ratio and more addition of foaming agent. 2. The strengths were decreased up to 77.0-92.8% by mix-foaming type and 36.7-74.4% by pre-foamed type than cement mortar. 3. At the mixing ratio of 1:1, the lowest air contents were showed by foaming mortars, respectively. But, it gradually was increased in poorer mixing ratio and more addition of foaming agent. The increasing rates of air contents were increased in richer mixing ratio and more addition of foaming agent. 4. Air contents were showed up to 26.0-63.8 times by mix-foaming type and 5.8-17.7 times by pre-foamed type than cement mortar, respectively. 5. The correlations between compressive strength and air content were highly significant, respectively. The multiple regression equations of strengths and air content were computed depending on a fuction of mixing ratio and addition of foarning agent. It was highly significant, respectively.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.30 no.1
• /
• pp.73-80
• /
• 1988

This study was performed to obtain the basic data which can be applied to use of foaming mortars. The results obtained were Summarized as follows; 1.At the mixing ratio of 1:1, the highest bulk densities were showed by foaming mortars, respectively. But, it gradually was decreased in poorer mixing ratio and more addition of foaming agent. The decreasing rates of bulk densities were increased in richer mixing ratio and more addition of foaming agent. 2.The bulk densities were decreased up to 38.8-55.9% by mix-foaming type and 9.7-23.6% by pre-foamed type than cement mortar. 3.At the mixing ratio of 1:1, the lowest absorption rates were showed by foaming mortars, respectively. But, it gradually was increased in poorer mixing ratio and more addition of foaming agent. The increasing rates of absorption rates were increased in richer mixing ratio and more addition of foaming agent. 4.Absorption rates when immersed in 72hours were showed up tp 3.41-5.85 times by mix-foaming type and 1.05- 1.S5times by pre -foamed type than cement mortar, it was significantly higher at the early stage of immersed time than cement mortar. 5.The correlations between bulk density and absorption rate were highly singnificant, respectively. The multiple regression equations of bulk density and absorption rate were computed depending on a fuction of mixing ratio and addition of foaming agent. it was highly significant respectively.

• Journal of the Korean Society of Safety
• /
• v.19 no.1
• /
• pp.23-30
• /
• 2004

Modern production systems are very complex by request of automation, and failure modes that occur in thisautomatic system are very various and complex. The efficient fault diagnosis for these complex systems is essential for productivity loss prevention and cost saving. Traditional fault diagnostic system which perforns sequential fault diagnosis can cause catastrophic failure during diagnosis when fault propagation is very fast. This paper describes the Real-time Intelligent Multiple Fault Diagnosis System (RIMFDS). RIMFDS assesses current machine condition by using sensor signals. This system deals with multiple fault diagnosis, comprising of two main parts. One is a personal computer for remote signal generation and transmission and the other is a host system for multiple fault diagnosis. The signal generator generates various faulty signals and image information and sends them to the host. The host has various modules and agents for efficient multiple fault diagnosis. A SUN workstation is used as a host for multiple fault modules and agents for efficient multiple fault diagnosis. A SUN workstation is used as a host for multiple fault diagnosis and graphic representation of the results. RIMFDS diagnoses multiple faults with fast fault propagation and complex physical phenomenon. The new system based on multiprocessing diagnoses by using Hierarchical Artificial Neural Network (HANN).

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

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1134-1139
• /
• 2003

Tracking is a fundamental technique which is able to be applied to gesture recognition, visual surveillance, tangible agent and so forth. Especially, multiple object tracking has been extensively studied in recent years in order to perform many and more complicated tasks. In this paper, we propose a new approach of multiple object tracking which is based on discrete event. We call this system the DEMOT (Discrete Event based Multiple Object Tracking). This approach is based on the fact that a multiple object tracking can have just four situations - initiation, continuation, termination, and overlapping. Here, initiation, continuation, termination, and overlapping constitute a primary event set and this is based on the change of the number of extracted objects between a previous frame and a current frame. This system reduces computational costs and holds down the identity of all targets. We make experiments for this system with respect to the number of targets, each event, and processing period. We describe experimental results that show the successful multiple object tracking by using our approach.