• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.9-17
• /
• 2021

In this paper, an autonomous multi-agent path planning using reinforcement learning for monitoring of infrastructures and resources in a computationally distributed system was proposed. Reinforcement-learning-based multi-agent exploratory system in a distributed node enable to evaluate a cumulative reward every action and to provide the optimized knowledge for next available action repeatedly by learning process according to a learning policy. Here, the proposed methods were presented by (a) approach of dynamics-based motion constraints multi-agent path-planning to reduce smaller agent steps toward the given destination(goal), where these agents are able to geographically explore on the environment with initial random-trials versus optimal-trials, (b) approach using agent sub-goal selection to provide more efficient agent exploration(path-planning) to reach the final destination(goal), and (c) approach of reinforcement learning schemes by using the proposed autonomous and asynchronous triggering of agent exploratory phases.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.631-636
• /
• 2001

The technologies relevant to e-business have rapidly developed during very short period of time and recently it is expanding to the area of B2B. Keeping pace with this development in e-business, the information of comparison or analysis on commodities of a lot of sites is also required. Though the information on price comparison among internal shopping malls are now being offered, its not efficient for its renewing intervals are long and, due to some indiscreet collection of information for the purpose of fast renewal, much loads are being generated on the pertinent shopping malls. In this article, the retrieval engine on demand is designed and realized using a dynamci robot agent changing kinetically on the status of the pertinent shopping malls that can offer the customized service and presents the shopping malls with the lowest price for each commodity under e-business after the shortest time of collection and analysis while not giving loads to the pertinent shopping malls.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.51-58
• /
• 2009

Reinforcement learning is a sub area of machine learning concerned with how an agent ought to take actions in an environment so as to maximize some notion of long-term reward. In the case of multi-agent, especially, which state space and action space gets very enormous in compared to single agent, so it needs to take most effective measure available select the action strategy for effective reinforcement learning. This paper proposes a multi-agent reinforcement learning model based on fuzzy inference system in order to improve learning collect speed and select an effective action in multi-agent. This paper verifies an effective action select strategy through evaluation tests based on Robocup Keepaway which is one of useful test-beds for multi-agent. Our proposed model can apply to evaluate efficiency of the various intelligent multi-agents and also can apply to strategy and tactics of robot soccer system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.626-631
• /
• 2005

This paper presents the target object search algorithm under dynamic programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved if the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using a real robot.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.111-117
• /
• 2021

The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with m vertices using n various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of O(㎥n) and O(㎥). After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our O(㎥) algorithm actually has a time complexity of O(㎡n) as only one preprocessing is required for the various deployment of n robot agents.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2933-2935
• /
• 2005

The IRPO(Intensive Randomized Policy Optimizer) algorithm is a recently developed tool in the area of reinforcement leaming. And it has been shown to be very successful in several application problems. To compare with a general RL method, IRPO has some difference in that policy utilizes the entire history of agent -environment interaction. The policy is derived from the history directly, not through any kind of a model of the environment. In this paper, we consider a robot-control problem utilizing a IRPO algorithm. We also developed a MATLAH-based animation program, by which the effectiveness of the training algorithms were observed.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.2
• /
• pp.229-235
• /
• 2003

We designed a family of completely autonomous mobile robots with local intelligence. Each robot has a number of on-board sensors, including vision, and does not rely on global positioning systems The on-board embedded controller is sufficient to analyze several low-resolution color images per second. This enables our robots to perform several complex tasks such as navigation, map generation, or providing intelligent group behavior. Not being limited to playing the game of soccer and being completely autonomous, we are also looking at a number of other interesting scenarios. The robots can communicate with each other, e.g. for exchanging positions, information about objects or just the local states they are currently in (e.g. sharing their current objectives with other robots in the group). We are particularly interested in the differences between a behavior-based approach versus a traditional control algorithm at this still very low level of action.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.333-338
• /
• 2005

This paper presents the target object search algorithm under Dynamic Programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation of Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved whether the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using our real robot.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.30.5-30
• /
• 2001

This paper describes a new design of blimp having wheeled vehicle part. This system can work both on the ground using wheeled vehicle and in the air using the floating capability of the blimp part. The passive wheeled mechanism in the vehicle part enables the stable taking off, landing on as well as it is greatly helpful to keep a stationary position on the floor. On the other hand, the floating capability enables the wheeled blimp to fly freely regardless of the ground condition or obstacles. The wheeled blimp can be used as an agent robot for the tole-presence application. Using multimedia devices such as camera, speaker, LCD and microphone mounted on the blimp surface, this system can get necessary information at the local site and communicate with person from a distance. As a typical tele-presence application, the wheeled blimp is currently being developed to a tole-guidance robot working in public indoor areas such 35 exhibition halls, departments, hospitals, etc ...

• Advances in robotics research
• /
• v.2 no.3
• /
• pp.201-217
• /
• 2018

Agriculture production is a critical human intensive task, which takes place in all regions of the world. The process to grow and harvest crops is labor intensive in many countries due to the lack of automation and advanced technology. Much of the difficult, dangerous and dirty labor of crop production can be automated with intelligent and robotic platforms. We propose an intelligent, agent-oriented robotic team, which can enable the process of harvesting, gathering and collecting crops and fruits, of many types, from agricultural fields. This paper describes a novel robotic organization enabling humans, robots and agents to work together for automation of gathering and collection functions. The focus of the research is a model, called HARMS, which can enable Humans, software Agents, Robots, Machines and Sensors to work together indistinguishably. With this model, any capability-based human-like organization can be conceived and modeled, such as in manufacturing or agriculture. In this research, we model, design and implement a technology application of knowledge-based robot-to-robot and human-to-robot collaboration for an agricultural gathering and collection function. The gathering and collection functions were chosen as they are some of the most labor intensive and least automated processes in the process acquisition of agricultural products. The use of robotic organizations can reduce human labor and increase efficiency allowing people to focus on higher level tasks and minimizing the backbreaking tasks of agricultural production in the future. In this work, the HARMS model was applied to three different robotic instances and an integrated test was completed with satisfactory results that show the basic promise of this research.