• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.11
• /
• pp.1036-1042
• /
• 2013

In this paper, an elderly assistance system is developed based on Xenomai, a real-time development framework cooperating with the Linux kernel. A Kinect sensor is used to recognize the behavior of the elderly and A-star search algorithm is implemented to find the shortest path to the person. The mobile robot also generates a trajectory using a digital convolution operator which is based on a Bezier curve for smooth driving. In order to follow the generated trajectory within the control period, we developed real-time tasks and compared the performance of the tracking trajectory with that of non real-time tasks. The real-time task has a better result on following the trajectory within the physical constraints which means that it is more appropriate to apply to an elderly assistant system.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.563-570
• /
• 2004

As the use of the Internet becomes more popular, a huge amount of information is published on the Web, and users can access the information effectively with Web search services. Since Web search services retrieve relevant documents from those collected by Web robots we need to improve the crawling quality of Web robots. In this paper, we suggest evaluation criteria for Web robots such as efficiency, continuity, freshness, coverage, silence, uniqueness and safety, and present various functions to improve the performance of Web robots. We also investigate the functions implemented in the conventional Web robots of NAVER, Google, AltaVista etc. It is expected that this study could contribute the development of more effective Web robots.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.890-903
• /
• 2017

The problem of determining a smooth and collision-free path with maximum possible speed for a Mobile Robot (MR) which is chasing a moving target in a dynamic environment is addressed in this paper. Genetic Network Programming with Reinforcement Learning (GNP-RL) has several important features over other evolutionary algorithms such as it combines offline and online learning on the one hand, and it combines diversified and intensified search on the other hand, but it was used in solving the problem of MR navigation in static environment only. This paper presents GNP-RL based on predicting collision positions as a first attempt to apply it for MR navigation in dynamic environment. The combination between features of the proposed collision prediction and that of GNP-RL provides safe navigation (effective obstacle avoidance) in dynamic environment, smooth movement, and reducing the obstacle avoidance latency time. Simulation in dynamic environment is used to evaluate the performance of collision prediction based GNP-RL compared with that of two state-of-the art navigation approaches, namely, Q-Learning (QL) and Artificial Potential Field (APF). The simulation results show that the proposed GNP-RL outperforms both QL and APF in terms of smooth movement and safer navigation. In addition, it outperforms APF in terms of preserving maximum possible speed during obstacle avoidance.

• Current Industrial and Technological Trends in Aerospace
• /
• v.6 no.1
• /
• pp.27-34
• /
• 2008

One of the purposes of space exploration is to be able to utilize the unlimited natural resources in the universe. For this purpose, plans for lunar and mars bases have been proposed by leading nations. In order to construct bases and search for resources, it is necessary to employ and develop rovers for surface navigation and exploration. With proper knowledge about Lunar surface, technology for lunar rover development can be established without serious obstacles, since robot technology for rover development has been well prepared in Korea. In this paper, lunar rovers and mars rovers developed and planned by other countries as well as the current status of robot technology in Korea have been analyzed.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.75-80
• /
• 2011

Recently, many cleaning robots have been made with various algorithms for efficient cleaning. One of them is a DmaxCoverage algorithm which efficiently clean for the situation when the robot has a time limit. This algorithm uses Rectangle Tiling method for finding the biggest rectangle that doesn't have any obstacle. When the robot uses grid map, Rectangle Tiling method can find the optimal value. Rectangle Tiling method is to find all of the rectangles in the grid map. But when the grid map is big, it has a problem that spends a lot of times because of the large numbers of rectangles. In this paper, we propose Four Direction Rectangle Scanning(FDRS) method that has similar accuracy but faster than Rectangle Tiling method. FDRS method is not to find all of the rectangle, but to search the obstacle's all directions. We will show the FDRS method's performance by comparing of FDRS and Rectangle Tiling methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.493-498
• /
• 2004

A novel approach for path planning of a polygonal robot is presented. Traditional path planners perform extensive geometric searching to find the optimal path or to prove that there is no solution. The computation required to prove that there is no solution is equivalent to exhaustive search of the motion space, which is typically very expensive. Humans seems to use a set of several different path planning strategies to analyse the situation of the obstacles in the environment, and quickly recognize whether the path-planning problem is easy to solve, hard to solve or has no solution. This human path-planning strategies have motivated the development of the presented algorithm that combines qualitative shape reasoning and exhaustive geometric searching to speed up the path planning process. It has three planning stages consisting of identification of no-solution cases based on an enclosure test, a qualitative reasoning stage, and finally a complete search algorithm in case the previous two stages cannot determine of the existence of a solution path.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.176-179
• /
• 2007

In this paper, we develop the path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1].

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1286-1290
• /
• 2004

This paper proposes a Distributed Autonomous Robotic System (DARS) based on an Artificial Immune Network (AIN) and a Classifier System (CS). The behaviors of robots in the system are divided into global behaviors and local behaviors. The global behaviors are actions to search tasks in environment. These actions are composed of two types: aggregation and dispersion. AIN decides one between these two actions, which robot should select and act on in the global. The local behaviors are actions to execute searched tasks. The robots learn the cooperative actions in these behaviors by the CS in the local. The relation between global and local increases the performance of system. Also, the proposed system is more adaptive than the existing system at the viewpoint that the robots learn and adapt the changing of tasks.

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

Motion estimation using Full-Search(FS) and Block-Matching Algorithm(BMA) is often used in the case of moving object tracking by vision sensors. However these methods often miss the real-time vision data because these schemes suffer the heavy computational load. When the image size of moving object is changed in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object may decline with these methods because of the shortage of active handling. In this paper, the variable-representative block that can reduce a lot of data computations, is defined and optimized by changing the size of representative block accor...

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.479-486
• /
• 2012

In this paper, a ranging system is proposed that is able to measure 360 degree omnidirectional distances to environment objects. The ranging system is based on the structured light imaging system with catadioptric omnidirectional mirror. In order to make the ranging system robust against environmental illumination, efficient structured light image processing algorithms are developed; sequential integration of difference images with modulated structured light and radial search based on Bresenham line drawing algorithm. A dedicated FPGA image processor is developed to speed up the overall image processing. Also the distance equation is derived in the omnidirectional imaging system with a hyperbolic mirror. It is expected that the omnidirectional ranging system is useful for mapping and localization of mobile robot. Experiments are carried out to verify the performance of the proposed ranging system.