• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.125-132
• /
• 2001

An algorithm for generating all hexahedral meshes for three dimensional objects has been presented. This algorithm is based on the sweeping and the grafting method. In sweeping process internal nodes generating method has been modified by employing the distances between nodes on connecting surfaces and on source surfaces. In addition to the sweeping processes grafting algorithm is also modified to obtain more effective meshes by refining elements near grafting surfaces. With this method two and a half dimensional hexahedral meshes for three dimensional objects can be generated effectively. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• 국제학술발표논문집
• /
• The 6th International Conference on Construction Engineering and Project Management
• /
• pp.680-681
• /
• 2015

This study develops an algorithm that automatically performs reverse engineering on three-dimensional (3D) sweeping shapes using a user's pre-defined feature templates and 3D point cloud data (PCD) of sweeping shapes. Existing methods extract 3D sweeping shapes by extracting points on a PCD cross section together with the center point in order to perform curve fitting and connect the center points. However, a drawback of existing methods is the difficulty of creating a 3D sweeping shape in which the user's preferred feature center points and parameters are applied. This study extracts shape features from cross-sectional points extracted automatically from the PCD and compared with pre-defined feature templates for similarities, thereby acquiring the most similar template cross-section. Fitting the most similar template cross-section to sweeping shape modeling makes the reverse engineering process automatic.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 춘계학술발표대회
• /
• pp.896-897
• /
• 2015

본 연구는 3D 이미지 스캔 데이터 기반으로, SWEEPING 형상을 효과적으로 역설계하는 기술에 관한 것이다. 사용자가 미리 정의한 형상 단면 모델 데이터베이스를 이용해, 3차원 SWEEPING 형상을 자동으로 역설계하는 알고리즘을 제안한다. 이를 위해, 3D 이미지 스캔 데이터인 포인트 클라우드에서 자동으로 추출한 단면 포인트들을 처리해, 파라메터 정보를 추출하고, 미리 정의된 형상 단면들과 상호간 유사도를 비교한 후, 가장 유사한 형상 단면을 획득한다. 이러한 기술은 SWEEPING 형상 모델의 역설계 과정을 자동화하는 데 도움을 줄 것이다.

• 제어로봇시스템학회논문지
• /
• 제7권1호
• /
• pp.1187-1195
• /
• 2001

This paper presents a sweeping path planning algorithm for an autonomous smearing robot. An automatic planner generates a sweeping path pattern by proposed five basic procedures. This algorithm rocog-nizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the track-ing points in such a way that(1) the connected line segments should not be crossed, (2) the total tracking points should be as short as possible, and (3) the tracking line should not pass through the obstacle, Feasibility of the developed techniques has been demonstrated on a real architectural CAD draft.

• 전기학회논문지
• /
• 제59권9호
• /
• pp.1686-1691
• /
• 2010

In this paper, we aim at providing a novel sweeping method for multi-security mobile robots. The sweeping problem of the multi-robots can be modeled as the stick pulling problem in which the swarm robots should sweep unknown terrains in order to remove sticks collaboratively. For the purpose, we define a certain map, what is called stick map. And we suggest how to make swarm robots build up and utilize the map in order to improve the productivity of collaborative removing sticks. Finally, the efficiency of our algorithm is verified with simulation experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.173-176
• /
• 1996

The transient behavior of the complex-LMS adaptive filter is studied when the adaptive filter is operating on a fixed or sweeping complex frequency sine-wave signal. The first-order difference equation is derived for the mean weights and its closed form solution is obtained. The transient response is represented as a function of the eigenvectors and eigenvalues of input correlation matrix. The mean-square error of the algorithm is evaluated as well. An optimal convergence parameter and filter length can be determined for sweeping frequency sine-wave signals as a function of frequency change rate and signal and noise powers.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.672-674
• /
• 1998

Java virtual machine has the garbage collector that automate memory management. Mark-compact algorithm is one of the garbage collection algorithm that operating in 2 phases, marking and sweeping. One is Marking is marking live objects reachable from root object set. Sweeping is sweeping unmarked object from memory(return to free memory pool). This algorithm is easy to implement but cause a memory fragmentation. So compacting memory, before memory defragmentation become serious. When compacting memory, all other processes are suspended. It is critical for embedded system that must guarantee real-time processing. This paper introduce enhanced mark-compact garbage collection algorithm. Grouping the objects by their size that minimize memory fragmentation. Then apply smart algorithm to the grouped objects when allocating objects and compacting memory.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권1호
• /
• pp.61-67
• /
• 1999

There has been an ever increasing interest in mobile robot for home services. However, issues currently being investigated for path planning of the mobile robot is concentrated to solving the problem of finding the optimal path from the initial location to the final location under the given performance index. In this study, we newly present a sweeping algorithm for autonomous mobile robot to cover the whole closed area under the unknown environment. And we verify the validity the validity of the formalized algorithm by computer simulation with the changing environment conditions. In addition to this, we analyse the effect of real system implementation of the proposed algorithm to a experimental miniature mobile robit(Khepera).

• 대한산업공학회지
• /
• 제20권2호
• /
• pp.77-90
• /
• 1994

Curve-net interpolation surface is one of the most popular method in engineering design. Therefore it is supported with many commercial CAD/CAM system. However, construction algorithm of curve-net interpolation surfaces is rarely opened to the public because of its copy-right. In this paper we establish a construction algorithm of curve-net interpolation surface so called sweeping surface which especially concentrates on trajectory of cross-section curve. We also show the method which can construct sweeping surfaces as NURB or Bezier mathematical models. Surfaces having the form of standard mathematical models are very useful for the application of joining, trimming, blending etc. The proposed surface interpolation scheme consists of four steps; (1) preparation of guide curves and section curves, (2) remeshing guide curves and section curves, (3) blending section curves after deformation, and (4) determination of control points for sweeping surface using gordon method. The proposed method guarantee $G^1$-continuety, and construct the surface salifying given section curves and trajectory of section curves.

• 제어로봇시스템학회논문지
• /
• 제17권12호
• /
• pp.1210-1218
• /
• 2011

GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.