• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• 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.

• 제어로봇시스템학회논문지
• /
• 제14권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.

• 대한전기학회논문지
• /
• 제39권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.

• 건설관리
• /
• 제4권1호
• /
• 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.

• 한국건설관리학회논문집
• /
• 제5권5호
• /
• 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.

• 로봇학회논문지
• /
• 제2권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
• /
• 제2권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.

• 한국정보통신학회논문지
• /
• 제13권7호
• /
• pp.1437-1443
• /
• 2009

본 논문에서는 초음파와 전자나침반, 엔코더, 자이로센서를 복합적으로 구성하여 로봇의 SLAM 방법을 제시하였다. 일반적으로 전자 나침반과 엔코더, 자이로를 이용한 로봇의 위치측정은 작업공간에서의 상대위치만을 알 수 있다. 실제 로봇이 작업공간에서 작업을 하기 위해서는 로봇의 절대위치 정보를 알아야만 하며, 이는 SLAM으로 얻을 수 있다. 본 논문에서는SLAM 구현을 위하여 로봇의 작업공간을 초음파 센서를 이용하여 구조적 맵 생성 기법을 통해 맵을 생성한 후, 이를 특정 맵으로 변환하였다. 생성된 특정 맵과 맵 매핑을 활용하여 맵 상의 절대위치를 구한다. 실험은 직접 설계 및 제작한 로봇을 이용하였고, 실험 방법은 초기 좌표를 모르는 로봇을 임의의 장소에 위치 시키고 제안한 SLAM 알고리즘을 이용하여 로봇의 전역 좌표를 찾도록 하였다. 실험 결과, 제안한 SLAM 알고리즘을 이용하여 맵 상의 절대위치를 모두 찾음을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• 한국산학기술학회논문지
• /
• 제15권12호
• /
• pp.6986-6992
• /
• 2014

일반화된 보로노이 그래프(GVG)는 자율 주행 로봇을 위한 일종의 로드맵으로서. GVG는 선서에다 받은 정보만 사용하여 작업 공간거리의 계산에 따라 정의를 한다. 로봇은 장애물까지의 최대 거리를 검출할 수 있기 때문에 포인트 뷰에서 GVG의 최적은 정출 몇 장애물 회피이다. 로봇의 경우에는, GVG는 가장 안전적인 길이라고 할 수 있다. 따라서 높이 링크 로봇의 GVG가장거리에 대한 연구가 매우 필요하다. 기존 연구에서 점(point) 로봇을 위한 GVG(point-GVG)와 로드 로봇을 위한 GVG(rod-GVG)가 발표되었다. 이 논문은 더 고차원의 로봇인 두 개의 동일 링크가 관절로 연결된(tow-identical-link; L2) 로봇을 위한 GVG(L2-GVG)에 대한 연구이다. L2-GVG는 미지의 평면 작업공간에서 움직이는 L2 로봇의 짜임새 공간 $R^2{\times}T^2$상에서 로드맵을 생성하되, 이전 연구와 마찬가지로 지역적 센서 정보만을 이용해 로봇이 스스로 주행하면서 맵을 만들어 낸다. 이 논문에서는 이전 point-GVG와 rod-GVG에서는 나타나지 않는, 관절이 존재하여 생기는 복잡한 특성에 대해서 분석한다. 이는 다관절 로봇으로의 확장에 중요한 초석이 될 것이다.