• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 추계학술대회 논문집
• /
• pp.430-433
• /
• 1996

In This paper, we design the developed path generation method which is named that CBPM(Continuous path generation method Based artificial Potential field) that is able to be used in the obstacles environment. This CBPM is designed so that it puts together two obstacle avoidance algorithm-the continuous path generation method and the artificial potential field method. Here, the continuous path generation method generate the safety path using continuous path curvature. But, this method has demerits when used in obstacles environment in which are closely located. Another method which is named the artificial potential field method generates the path with the artificial potential field in the obstacles environment. But, APFM has local minima in certain places and unnecessarily calculates the path in which obstacles are not located. So, the developed path generation method, CBPM, is suggested and performances in many different obstacles environments are shown by using computer simulation.

• 한국군사과학기술학회지
• /
• 제4권2호
• /
• pp.17-29
• /
• 2001

In this paper, we designed the hybrid path generation method which is named CAPM(Continuous path generation method based on artificial Potential field) that is able to be used in the obstacles environment. This CAPM was designed so that it puts together two obstacle avoidance algorithm-the continuous path generation method(CPGM) and the artificial potential field method(APFM). Here, the CAPM generate the safety path using continuous path curvature. But, this method has demerits when used in obstacles environment in which are closely located. Another method which is named the APFM generates the path with the artificial potential field in the obstacles environment. But, It has local minima in certain places and unnecessarily calculates the path in which obstacles are not located. So, the CAPM was designed for autonomous underwater vehicle(AUV) obstacle avoidance. As the result of simulation, it was confirmed that the CAPM can be applied to a safe path generation for AUV.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 추계학술대회
• /
• pp.264-266
• /
• 2022

전파 지문 기반의 실내 경로 생성 기술에 RNN 모델을 적용하기 위해서는 데이터 세트가 연속적이고 순차적이어야 한다. 그러나 Wi-Fi 전파 지문 데이터는 수집 시점의 특정 위치에 대한 특징 정보로서 연속성이 보장되지 않기 때문에 RNN 데이터로는 부적합하다. 따라서 순차적 위치의 연속성 정보를 부여해야한다. 이를 위해서는 신호 데이터를 기반으로 각 지역의 구분을 통해 클러스터링이 가능하다. 이때 클러스터 간의 연속성 정보에는 전파 신호의 한계로 이해 실제 이동이 가능한지의 정보를 담지 못한다. 따라서 인접 클러스터간의 이동이 가능한지에 대한 연관성 정보가 필요하다. 본 논문에서는 딥러닝 네트워크인 순환신경망(RNN) 모델을 사용해 이동 중인 객체의 경로 예측을 위한 기술로서 실내 환경에서 경로 생성을 위해 연속적인 위치 정보를 생성하여 객체의 경로 예측 시 발생할 수 있는 오류를 낮추고 예측 경로상의 이동이 불가능한 잘못된 경로 예측을 회피할 수 있는 향상된 이동 경로 생성을 위한 클러스터링 상호간의 연관성을 부여하는 기법을 제안한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.458-459
• /
• 2021

최근, 실내 위치 기반 서비스에서 정확한 서비스를 위해 Wi-Fi 핑거프린트 기반의 딥러닝 기술을 이용한 연구가 이루어지고 있다. 딥러닝 모델 중에서 과거의 정보를 기억할 수 있는 RNN 모델은 실내측위에서 연속된 움직임을 기억할 수 있어 측위 오차를 줄일 수 있다. 이때 학습 데이터로서 연속적인 순차 데이터를 필요로 한다. 그러나 일반적으로 Wi-Fi 핑거프린트 데이터의 경우 특정 위치에 대한 신호들만으로 관리되기 때문에 RNN 모델의 학습데이터로 사용이 부적절하다. 본 논문은 RNN 모델의 순차적인 입력 데이터의 생성을 위해 클러스터링을 통한 영역 데이터로 확장된 Wi-Fi 핑거프린트 데이터 기반 이동 경로의 예측을 통한 경로 생성 방법에 대해 제안한다.

• 제어로봇시스템학회논문지
• /
• 제20권2호
• /
• pp.138-142
• /
• 2014

This research presents an A* based algorithm which can be applied to Unmanned Ground Vehicle self-navigation in order to make the driving path smoother. Based on the grid map, A* algorithm generated the path by using straight lines. However, in this situation, the knee points, which are the connection points when vehicle changed orientation, are created. These points make Unmanned Ground Vehicle continuous navigation unsuitable. Therefore, in this paper, B-spline curve function is applied to transform the path transfer into curve type. And because the location of the control point has influenced the B-spline curve, the optimal control selection algorithm is proposed. Also, the optimal path tracking speed can be calculated through the curvature radius of the B-spline curve. Finally, based on this algorithm, a path created program is applied to the path results of the A* algorithm and this B-spline curve algorithm. After that, the final path results are compared through the simulation.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 추계학술대회 논문집
• /
• pp.106-110
• /
• 2001

The ball-end milling process is widely used in the die/mold industries, and it is very suitable for the machining of free-form surfaces. However, this process is inherently inefficient process to compared with the end-milling or face milling process, since it relays upon the machining at the cutter/surface contact point. The machined part is the result of continuous point-to-point machining on the free-form surface. And cusps (or scallops) remain at the machined part along the cutter paths and they give the geometrical roughness of the workpiece. Thus, for the good geometrical roughness of the workpiece, it is required very tightly spaced cutter paths in this ball-endmilling process. However, with the tight cutter paths, the geometrical roughness of the workpiece is not regular on the workpiece since the cusp height is variable in the previously developed ISO-parametric or Cartesian machining methods. This paper suggests a method of tool path generation which makes the geometrical roughness of workpiece be constant through the machined surface. In this method, Ferguson Surface design Model is used and cusp height is derived from the instantaneous curvatures. And, to have constant cusp height, an increment of parameter u or v is estimated along the reference cutter path. In ball-end milling experiments, the cusp pattern was examined, and it was proved that the geometrical roughness could be regular by suggested tool path generation method.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• 한국공작기계학회논문집
• /
• 제10권2호
• /
• pp.95-102
• /
• 2001

In general there are many degrees of freedom(DOFs) in industrial robots. So they have many poses of several special end-effectors positions and orientations. For that reason, industrial robots are used in a wide scope of industrial applica-tions such as welding, spray painting, deburring, and so on. In this research, an off-line continuous path planning method based on linear interpolation with parabolic blend is developed. The method safely maintains the constant orientation for base frame and end-effectors path within allowable error and minimizes the number of segments in path. This algorithm may apply to welding and painting in which the orientation is particularly significant. The simulation study of cartesian curve is carried out to show the performance of this algorithm.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권3호
• /
• pp.112-121
• /
• 2002

This paper describes a new bike system for the postural balance rehabilitation training. Virtual environment and three dimensional graphic model is designed with CAD tools such as 3D Studio Max and World Up. For the real time bike simulation, the optimized WorldToolKit graphic library is embedded with the dynamic geometry generation method, multi-thread method, and portal generation method. In this experiment, 20 normal adults were tested to investigate the influencing factors of balancing posture. We evaluated the system by measuring the parameters such as path deviation, driving velocity, COP(center for pressure), and average weight shift. Also, we investigated the usefulness of visual feedback information by weight shift. The results showed that continuous visual feedback by weight shift was more effective than no visual feedback in the postural balance control It is concluded this system might be applied to clinical use as a new postural balance training system.

• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.205-210
• /
• 2006

Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.