• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2318-2320
• /
• 1998

A genetic algorithm for global and local path planning and collision avoidance of mobil robot in unstructured workspace is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.5
• /
• pp.483-488
• /
• 2008

An active omni-directional raging system using an omni-directional vision with structured light has many advantages compared to the conventional ranging systems: robustness against external illumination noise because of the laser structured light and computational efficiency because of one shot image containing $360^{\circ}$ environment information from the omni-directional vision. The omni-directional range data represents a local distance map at a certain position in the workspace. In this paper, we propose a matching algorithm for the local distance map with the given global map database, thereby to localize a mobile robot in the global workspace. Since the global map database consists of line segments representing edges of environment object in general, the matching algorithm is based on relative position and orientation of line segments in the local map and the global map. The effectiveness of the proposed omni-directional ranging system and the matching are verified through experiments.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.403-413
• /
• 1990

A collision free trajectory control for multiple mobile robots in obstacle-resident workspace is proposed. The proposed method is based on the concept of neural optimization network which has been applied to such problems which are too complex to be handled by traditional analytical methods, and gives good adaptibility for unpredictable environment. In this paper, the positions of the mobile robot are taken as the variables of the neural circuit and the differential equations are derived based on the performance index which is the weighted summation of the functions of the distances between the goal and current position of each robot, between each pair of robots and between the goal and current position of each robot, between each pair of robots and between obstacles and robots. Also is studied the problem of local minimum and of detour in large radius around obstacles, which is caused by inertia of mobile robots. To show the validity of the proposed method an example is illustrated by computer simulation, in which 6 mobile robots with mass and friction traverse in a workspace with 6 obstacles.

• Construction Engineering and Management
• /
• v.4 no.1 s.13
• /
• pp.55-60
• /
• 2003

Unstructured workspaces which are typical in construction contain unpredicable activities as well as changing environments. Most automated and semi-automated construction tasks require real-time information about the local workspace in the form of 3D geometric models. This paper describes and demonstrates a new rapid, local area geometric data extraction and 3D visualization method for unstructured construction workspaces that combines human perception, simple sensors, and descriptive CAD models. The rapid approach will be useful in construction in construction in order to optimize automated equipment tasks and to significantly improve safety and a remote operator's spatial perception of the workspace.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.5 s.21
• /
• pp.151-162
• /
• 2004

Current methods for construction site modeling employ large, expensive laser range scanners that produce dense range point clouds of a scene from different perspectives. Days of skilled interpretation and of automatic segmentation may be required to convert the clouds to a finished CAD model. The dynamic nature of the construction environment requires that a real-time local area modeling system be capable of handling a rapidly changing and uncertain work environment. However, in practice, large, simple, and reasonably accurate embodying volumes are adequate feedback to an operator who, for instance, is attempting to place materials in the midst of obstacles with an occluded view. For real-time obstacle avoidance and automated equipment control functions, such volumes also facilitate computational tractability. In this research, a human operator's ability to quickly evaluate and associate objects in a scene is exploited. The operator directs a laser range finder mounted on a pan and tilt unit to collect range points on objects throughout the workspace. These groups of points form sparse range point clouds. These sparse clouds are then used to create geometric primitives for visualization and modeling purposes. Experimental results indicate that these models can be created rapidly and with sufficient accuracy for automated obstacle avoidance and equipment control functions.

• The Journal of Korea Robotics Society
• /
• v.2 no.3
• /
• pp.275-281
• /
• 2007

This paper presents a motion planning strategy for legged robots using locomotion primitives in the complex 3D environments. First, we define configuration, motion primitives and locomotion primitives for legged robots. A hierarchical motion planning method based on a combination of 2.5 dimensional maps of the 3D workspace is proposed. A global navigation map is obtained using 2.5 dimensional maps such as an obstacle height map, a passage map, and a gradient map of obstacles to distinguish obstacles. A high-level path planner finds a global path from a 2D navigation map. A mid-level planner creates sub-goals that help the legged robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. A local obstacle map that describes the edge or border of the obstacles is used to find the sub-goals along the global path. A low-level planner searches for a feasible sequence of locomotion primitives between sub-goals. We use heuristic algorithm in local motion planner. The proposed planning method is verified by both locomotion and soccer experiments on a small biped robot in a cluttered environment. Experiment results show an improvement in motion stability.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.107-117
• /
• 2004

A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1437-1443
• /
• 2009

This paper is presented an simultaneous localization and mapping (SLAM) algorithm using ultrasonic for robot and electric compass, encoder, and gyro. Generally, localization based upon electric compass, encoder, and gyro can be measured just local position in workspace. However, actual robot must need an information of the absolute position in workspace to perform its mission, Absolute position in workspace could be calculated using SLAM algorithm. To implement SLAM in this paper, a map is built using ultrasonic sensor and hierarchical map building method. And then, we the map will be transformed into a feature map. The absolute position could be calculated using the feature map and map mapping method. As a test bed, we designed and construct an autonomous robot and showed the experimental performance of the proposed SLAM algorithm based on feature map. Experimental result, we verified that robot can found all absolute position on experiments using proposed SLAM algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.6034-6056
• /
• 2018

This paper describes two user studies in remote collaboration between two users with a video conferencing system where a remote user can draw annotations on the live video of the local user's workspace. In these two studies, the local user had the control of the view when sharing the first-person view, but our interfaces provided instant control of the shared view to the remote users. The first study investigates methods for assisting drawing annotations. The auto-freeze method, a novel solution for drawing annotations, is compared to a prior solution (manual freeze method) and a baseline (non-freeze) condition. Results show that both local and remote users preferred the auto-freeze method, which is easy to use and allows users to quickly draw annotations. The manual-freeze method supported precise drawing, but was less preferred because of the need for manual input. The second study explores visual notification for better local user awareness. We propose two designs: the red-box and both-freeze notifications, and compare these to the baseline, no notification condition. Users preferred the less obtrusive red-box notification that improved awareness of when annotations were made by remote users, and had a significantly lower level of interruption compared to the both-freeze condition.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.12
• /
• pp.6986-6992
• /
• 2014

The generalized Voronoi graph (GVG) is a topological map of a constrained environment. This is defined in terms of workspace distance measurements using only sensor-provided information, with a robot having a maximum distance from obstacles, and is the optimum for exploration and obstacle avoidance. This is the safest path for the robot, and is very significant when studying the GVG edges of highly articulated robots. In previous work, the point-GVG edge and Rod-GVG were built with point robot and rod robot using sensor-based control. An attempt was made to use a higher degree of freedom robot to build GVG edges. This paper presents GVG-based a new local roadmap for the two-link robot in the constrained two-dimensional environment. This new local roadmap is called the two-identical-link generalized Voronoi graph (L2-GVG). This is used to explore an unknown planar workspace and build a local roadmap in an unknown configuration space $R^2{\times}T^2$ for a planar two-identical-link robot. The two-identical-link GVG also can be constructed using only sensor-provided information. These results show the more complex properties of two-link-GVG, which are very different from point-GVG and rod-GVG. Furthermore, this approach draws on the experience of other highly articulated robots.