• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.640-645
• /
• 2000

Mobility in the mobile agent language is an important issue. The scope range of the agent which can move is closely related with the work which the agent can do for users. The location concept proposed in this paper can make an activity scope of agent various by defining and classifying the destination of mobile agent as a logical and physical location. We designed and implemented a java class that describes creation, deletion, and execution of agent and a service system of agent that executes the described program on the computer which is linked to network to assist the location concept. The location concept will advance the mobility of agent and this agent is expected to provide much better service for users.

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.339-345
• /
• 2012

This research aims to formulate a mathematical model and develop an algorithm for solving a location problem in emergency medical service vehicle parking. To find an optimal parking location which has the least risk score or risk priority number calculated from severity, occurrence, detection, and distance from parking location for emergency patients, data were collected from Pratoom sub-district Disaster Prevention and Mitigation Center from October 2010 to April 2011. The criteria of risk evaluation were modified from Automotive Industry Action Group's criteria. An adaptive simulated annealing algorithm with multiple cooling schedules called multi-agent simulated quenching (MASQ) is proposed for solving the problem in two schemes of algorithms including dual agent and triple agent quenching. The result showed that the solution obtained from both scheme of MASQ was better than the traditional solution. The best locations obtained from MASQ-dual agent quenching scheme was nodes #5 and #133. The risk score was reduced 61% from 6,022 to 2,371 points.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.17-22
• /
• 2005

Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.455-464
• /
• 2006

In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker's failure.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.351-362
• /
• 2006

This paper proposes an adaptive inter-agent communication protocol to considerably reduce the amount of agent location information maintained by each service node and the message delivery time while avoiding the dependency of the home node of a mobile agent. To satisfy this goal, the protocol enables each mobile agent to autonomously leave its location information only on some few of its visiting nodes. Also, it may significantly reduce the agent cache updating frequency of each service node by keeping the identifier of the location manager of each agent in the smart agent location cache of the node. Simulation results show that the proposed protocol reduces about $76%{\sim}80%$ of message delivery overhead and about $76%{\sim}79%$ of the amount of agent location information each service node should maintain compared with the traditional one.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2169-2178
• /
• 2000

This paper proposes the structure of an agent and rules for fault detection and location on LAN. To find out a reason of critical fault incurred LAN, collision detection rule, error detection rule, broadcast detection rule, system location rule, and Internet application location rule ar shown. Also, the structure of multi-agent system and state transition diagram is portrayed to have connectivity with he set of rules. To verify availability of proposed rules, the process to find a faulty system is shown by monitoring and analyzing the LAN fault occurrences from the proposed set of rules. Such an rule based agent system is helpful to an Internet manager to solve a reason of fault and make ad decision from gathering management information.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.151-155
• /
• 2001

Mobile agent technology has been the subject of much attention in the last few years, mainly due to the proliferation of distributed software technologies combined with the distributed AI research field. In this paper, we present a design of communication networks of agents that cooperate with each other for forwarding messages to the specific mobile agent in order to make the overall system location transparent. In order to make the material accessible to general intelligent system researchers, we present the general ideas abstractly in terms of the graph theory. In particular, a proxy network is defined as a directed acyclic graph satisfying some structural conditions. In turns out that the definition ensures some kind of reliability of the network, in the sense that as long as at most one proxy agent is abnormal, there agent exists a communication path, from every proxy agent to the target agent, without passing through the abnormal proxy. As the basis for the implementation of this scheme, an appropriate initial proxy network is specified and the dynamic nature of the network is represented by a set of graph transformation rules. It is shown that those rules are sound, in the sense that all graphs created from the initial proxy network by zero or more applications of the rules are guaranteed to be proxy networks. Finally, we will discuss some implementation issues.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.35-42
• /
• 2003

In this paper, we analyzed the known agent tracking models and proposed a new agent tracking model based on the distributed event service that always assures reliable tracking. Also we experimented the Performance of the event servers on the agent monitoring system that implements the distributed event service and showed their performance to decrement gracefully. The proposed tracking model doesn't make only several clients trace a mobile agent which moves among agent servers autonomously, but also supports two types of agent tracking agent location tracking that notifies agent location to the clients and path establishment that maintains reliable connection between agent servers for message delivery.

• Industrial Engineering and Management Systems
• /
• v.8 no.4
• /
• pp.228-238
• /
• 2009

This paper first presents two supply chain design problems: 1) a factory location setting and factory selection problem, and 2) a factory location setting and factory/supplier selection problem. The first involves a number of location known retailers choosing one factory to supply their demands from a number of factories whose locations are to be determined. The goal is to minimize the transportation and manufacturing cost to satisfy the demands. The problem is then augmented into the second problem, where the procurement cost of the raw materials from a chosen material supplier (from a number of suppliers) is considered for each factory. Economic beneficial is taken into account in the cost evaluation. Therefore, the partner selections will influence the cost of the supply chain significantly. To solve these problems, an agent gaming and genetic algorithm hybrid method (AGGAHM) is proposed. The AGGAHM consecutively and alternatively enable and disable the advancement of agent gaming and the evolution of genetic computation. Computation results on solving a number of examples by the AGGAHM were compared with those from methods of a general genetic algorithm and a mutual frozen genetic algorithm. Results showed that the AGGAHM outperforms the methods solely using genetic algorithms. In addition, various parameter settings are tested and discussed to facilitate the supply chain designs.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.24-28
• /
• 2007

This paper embodies the agent based cinder monitoring system which supports PDA(Personal Digital Assistant). Monitoring system automatically manages data by using data managing agents such as a state managing agent, a location managing agent, a badness managing agent, a circumstances managing agent, etc, and uses a massive data processing agent to manage massive data. The development of agent based data monitoring system for the stable cinder reuse will be an epoch-making method to develop the process mechanized or manual-labored that widely spreads into the real-time automated process.