• 전기학회논문지
• /
• 제67권2호
• /
• pp.285-292
• /
• 2018

In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.123-130
• /
• 2018

Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

• 한국실내디자인학회논문집
• /
• 제17권3호
• /
• pp.156-164
• /
• 2008

Through staggering advancements of technology and network as we know them as digital revolution, we have established a foundation of space in which we can express reality by eliminating the boundaries between expression, space, and movement. There are many ongoing approaches that aim to overcome the physically-fixed property of space where the mathematical-geometric notion of Voronoi Diagram is one of them. Although the repetitive increment based on self-organization during the process in which space is generated by the Voronoi Diagram forms a pattern and focuses on the formation, its pattern is not restricted to a single method of expression but evolves over self-control. The result of having analyzed spaces generated by the Voronoi Diagram in this study can be summarized as follows. First, the Voronoi computation method with self-organization property creates multiple levels, increments, and evolves through feedbacks among changes with the slightest order and in the absence of control. Secondly, after forming a pattern through such feedbacks comes the differentiation phase due to the presence of different properties. Thirdly, a space that has gone through the generation process retransforms through active interaction between changes and it obtains ambiguous boundaries and a repetitive pattern. This leads to an evolution of space through repetitive increments based on self-organization. Such flexible space creation is supported by various digital technologies where we believe a converging application of these studies, sciences, engineering concepts, and space design is and effective and new method in terms of space creation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.866-870
• /
• 1995

To make a mobile robot to get to a goal point, path which connects the mobile robot and the goal point is needed and a path planning is necessary. There are various kinds of a path planning. Well known methods are skeleton method, cell decomposition method and potential field method. But each method has both fortes and defects. In this paper, we propose a new method of path planning to find a path for mobile robot. It is obtained by modifying a Voronoi diagram. An original Voronoi diagram can make a safe path but its result is not satisfied. First defect of path, finded by the original Voronoi diagram, is sulplus of safty which make a path longer. Second defect is that the original Voronoi diagram method has a problem of connecting the Voronoi daigram with start/goal point of mobile robot. These defects are removed in proposed algorithm in this paper. We define a function to show the quality of paths. And by computer simulation, paths are compared and its result are shown.

• 제어로봇시스템학회논문지
• /
• 제8권6호
• /
• pp.492-497
• /
• 2002

Map building is the process of modeling the robot's environment. The map is usually built based on a grid-based or topological approach, which has its own merits and demerits. These two methods, therefore, can be integrated to provide a better way of map building, which compensates for each other's drawbacks. In this paper, a method of building the topological map based on the occupancy grid map through a Voronoi diagram is presented and verified by various simulations. This Voronoi diagram is made by using a labeled Voronoi diagram scheme which is suitable for the occupancy grid maps. It is shown that the Proposed method is efficient and simple fur building a topological map. The simple path-planning problem is simulated and experimented verify validity of the proposed approach.

• 한국항공우주학회지
• /
• 제42권2호
• /
• pp.127-133
• /
• 2014

본 논문은 무인기의 생존성을 최대화하기 위한 경로점을 결정하는 기법을 제안한다. 본 논문에서 초기 경로점을 선정하기 위해 사용된 Voronoi diagram은 위협의 위치와 크기가 주어져 있을 때, 위협으로부터 최대한 멀리 피해서 가는 경로를 계획하는데 많이 이용되고 있는 기법이다. 하지만 위협의 크기가 서로 다르고, 비행경로가 직선경로로 계획되어야 한다면 실제 경로 계획 시 Voronoi diagram으로는 한계가 있다. 본 논문에서는 Voronoi diagram을 통해 선정한 초기 경로점을 위협의 형태에 맞춰 최적화를 수행하는 방식을 적용하였다. 각 경로점의 인접한 경로점들을 고정시킨 상태에서 경로점을 하나씩 최적화를 수행하는 방식으로 최적화를 수행하였다. 이 방식은 전체 경로점들이 수렴할 때 까지 국소최적화를 반복함으로써, 최적의 경로점을 찾기 위해 소요되는 연산시간을 크게 감소시켰다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 춘계학술대회
• /
• pp.822-827
• /
• 2003

Topological maps have drawn more attention recently because they are compact, provide natural interfaces, and are applicable to path planning easily. To build a topological map incrementally, Voronoi diagram was used by many researchers. The Voronoi diagram, however, has difficulty in applying to arbitrarily shaped objects and needs long computation time. In this paper, we present a new method for global topological map from the local topological maps incrementally. The local topological maps are created through a thinning algorithm from a local grid map, which is built based on the sensor information at the current robot position. A thinning method requires simpler computation than the Voronoi diagram. Localization based on the topological map is usually difficult, but additional nodes created by the thinning method can improve localization performance. A series of experiments have been conducted using a two-wheeled mobile robot equipped with a laser scanner. It is shown that the proposed scheme can create satisfactory topological maps.

• 한국실내디자인학회논문집
• /
• 제20권1호
• /
• pp.89-97
• /
• 2011

Furniture design is no exception to human desire for pursuit of the nature. In various design fields, it has turned out nature-decorative method in the past, and also recently it has turned out bio-adaptive method which is more root design process using principal of generation in nature world. The purpose of this study is to analyze application methods and characteristics of fractal geometry and voronoi diagram which are most representative principals of generative design in nature by research on the example of furniture design using these principals. The results of having analyzed fumitures by generative design can be summarized as follows; design principals of fractal; superposition, scaling, repetition & gradation, deformation, distortion and voronoi diagram; individual speciation, variational patten, repetition gradation, ambiguous boundary create new design concept and emergent form in furniture design. Application methods are 'form emergence by algorithm', 'conventional process based on principals of generative design', and 'reproduction of pattern from generative design'. Biological reinterpretations and new explorations of principals of nature generation offer unbounded possibilities for furniture design.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1601-1606
• /
• 1991

We present an algorithm to approximate the Voronoi diagrams of 2D objects bounded by algebraic curves. Since the bisector curve for two algebraic curves of degree d can have a very high algebraic degree of 2 * d$^{4}$, it is very difficult to compute the exact algebraic curve equation of Voronoi edge. Thus, we suggest a simple polygonal approximation method. We first approximate each object by a simple polygon and compute a simplified polygonal Voronoi diagram for the approximating polygons. Finally, we approximate each monotone polygonal chain of Voronoi edges with Bezier cubic curve segments using least-square curve fitting.

• 대한전자공학회논문지TC
• /
• 제41권9호
• /
• pp.39-45
• /
• 2004

순차적인 관찰값을 바탕으로 하고 신호검출에 소요되는 시간이 고정된 신호검출기의 제작에 관한 방법을 제안하며 이는 하드웨어의 복잡도를 감소시키는 장점이 있다. 제안된 방법은 Voronoi 다이어그램과 Delaunay 분할을 사용한다. 제안된 신호검출기 제작은 또한 고정 지연 트리 검색 검출 (FDTS) 방법에 기반을 둔다. FDTS 는 효율적인 순차적 신호검출 알고리즘이며 심볼간 간섭이 존재하는 채널에서 결정 궤환 등화기법 (DFE)과 결합하여 최적화에 근접한 성능을 보인다. 이러한 접근방법에서는 Voronoi 다이어그램 혹은 등가적으로 Delaunay 분할에 포함된 정보를 활용하여 다차원 유클리드 공간에서의 상대적인 관찰값의 위치를 계산하며 이러한 방법이 효율적인 계산을 유도하는 신호검출기의 제작에 이용된다.