• The Journal of Korea Robotics Society
• /
• v.1 no.1
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3548-3558
• /
• 1999

There are many kinds of multi-agent frameworks which support the high-level knowledge representation languages for providing intelligence to their agents. But, the agent programming interfaces of the frameworks require to use some general-purpose programming languages as well as tile knowledge representation languages. In general, knowledge representation languages and general-purpose programming languages are different in their levels and data representation models. The differences can make the problems about tile coupling of the elements which are necessary for developing intelligent agents. This paper describes a new type of intelligent agent shell INAS(INtelligent Agent Shell) version 2 which has developed to cope with the problems. Unlike the previous agent frameworks, INAS supports a high-level integrated agent building language for building intelligent agents by itself. Therefore, the development of intelligent agents by using INAS version 2 does not suffer from the problems of the previous agent frameworks. Through the development of several intelligent agents, we experienced that the agent building language of INAS version 2 could reduce the difficulties of developing intelligent agents.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.295-306
• /
• 2007

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1421-1435
• /
• 2004

When various work was given from user, the existing mobile agent model migrated from node to node and process the work at the point that much traffics according to passive routing schedule are happened, until it makes service the work result, time cost of round work process for the distributed nodes are increased. Therefore, the existing agent systems need migration method to solve the problems of agent size increment or a lack of interoperability among agent systems. To solve these problems in this thesis, we design and implement an CORBA-based Mobile Agent Model(CMAM) for the efficient work process into the distributed nodes, when the mobile agents are migrated among the nodes, using an optimal path search by sensing of network traffic.

• Journal of Navigation and Port Research
• /
• v.33 no.10
• /
• pp.743-756
• /
• 2009

This paper tries to analyze how the governance institutions of the Port Authority of New York and New Jersey overcome agent problems in public agencies based on the Principal-Agent Theory, and find the implications that will be helpful to the governance of port authorities in Korea. The Port Authority's governance is characterized by decentralization of personnel rights, open meetings policy, freedom of information policy, public hearings, and fiscally self-supporting system. Those characteristics are helpful in overcoming the agent problems of public agency, such as adverse selection, moral hazard, and complicated external structure, through reinforcing of monitoring agent by principal, easing of information asymmetry between principal and agent, and clarification of organizational ownership structure. Those characteristics may give many implications for the design of governance structures of port authorities in Korea.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.35.3-35
• /
• 2002

Reinforcement Learning (RL) is one of machine learning methods and an RL agent autonomously learns the action selection policy by interactions with its environment. At the beginning of RL research, it was limited to problems in environments assumed to be Markovian Decision Process (MDP). However in practical problems, the agent suffers from the incomplete perception, i.e., the agent observes the state of the environments, but these observations include incomplete information of the state. This problem is formally modeled by Partially Observable MDP (POMDP). One of the possible approaches to POMDPS is to use historical nformation to estimate states. The problem of these approaches is how t..

• Proceedings of the Korea Concrete Institute Conference
• /
• 1996.04a
• /
• pp.48-51
• /
• 1996

Recently, frost damage of storage tank for admixture agent caused by low temperature in winter and quality deterioration of admixture agent ofen happened. But, many problems are caused because of no applicable regulations of admixture agent facility and so on. Therefore, this study presents the reference data about using and quality control of admixture agent in practice and the judgement data about working out a counter plan of suitable heat insulation of injecion equipment of admixture agent exposed at outside in winter by measuring the freezing point of admixture agent for concrete.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.351-360
• /
• 2004

Most mobile agents are migrated to many mobile agent systems by the sequential node migration method. However. in this case, if some problems such as host's fault or obstacle etc. happened, mobile agent falls infinity walt or orphan states. Therefore, it is difficult to get an expectation effect as use of other distribution technologies because the required time for networking between nodes increases. And so, many researches have been performed to solve this problems. However, most of methods decide node migration based on passive routing table or detour hosts which have some problems. Actually, the researches for reducing the total required time for networking are insufficient yet. In this paper, to reduce the required time for networking of mobile agent we design an active routing table based on the information of implemented objects which are registered in the meta-table of naming agent. And also, for user's keyword, we propose an replication model that replicates many agent object according to the information and number of object references corresponding to meta-table. Replicated objects are migrated to mobile agent systems in parallel and it provides minimized required time for networking.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1573-1581
• /
• 2006

To utilize actively the agent which is one of the elements of revitalization of Agro-Foods Mobile I-commerce, an essential prerequisite is agent security. IF using partial PKI(Public Key Infrastructure)-based confirmation mechanism providing security for the agent, the size of agent is becoming larger, the result of the transmission speed is slow, and the confirmation speed is tardy as well because of performing calculation of public keys such as RSA and needing linkage with the CA for the valid examination of certificates. This paper suggests a mechanism that can cross certification and data encryption of each host in the side of improving the problems of key distribution on agent by shaping key chain relationship. This mechanism can guarantee the problem of ky distribution by using agent cipher key(ACK) module and generating random number to fit mobile surroundings and to keep the secret of the agent. Suggested mechanism is a thing that takes into consideration security and efficiency to secure agent for the revitalization of M-Commerce, and is a code skill to make the agent solid and is a safe mechanism minimizing the problems of memory overflow.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.123-131
• /
• 2006

Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when MAs itineraries span multiple subnets. The work presented herein aspires to address these issues. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings.