• 한국정밀공학회지
• /
• 제15권11호
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• 한국음향학회지
• /
• 제3권1호
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Journal of Advanced Marine Engineering and Technology
• /
• 제40권9호
• /
• pp.847-851
• /
• 2016

지구 온난화 현상으로 2030년 정도에는 북극해 항로 이용이 연중 가능할 것으로 예상되고 있어 향후에 교통량이 증가할 것으로 판단된다. 하지만 현재는 쇄빙선 선장의 지시에 따라 운항하고 있어 안전 호송 속력 및 간격은 정량화되지 못하고 있다. 본 연구에서는 기존 연구인 최소 안전이격거리 및 최단 정지거리에 대하여 선박조종시뮬레이션 수행을 통해 검증하고 다음과 같은 결과를 얻었다. 정지거리 감소에 있어서 lead 간격이 선폭의 2~4배인 경우에 선속이 7 [kts] 이하인 경우 crash astern과 crash astern & hard rudder인 경우에서 유의적인 차이는 없었으나 선속이 10 [kts]인 경우는 3.5L에서 2.5L로 정지거리가 감소함이 확인되었다. 총 10척의 대상선박에 대하여 crash astern을 사용하여 최단 정지거리를 구한 결과 5 [kts]일 경우는 0.98L~1.8L, 8 [kts]에서는 1.9L~4.0L로 나타났다. 좁은 수로에서의 최소 안전이격거리는 6L이지만 북극해 항로는 전방만 해당하므로 3L이 필요하다. 이 결과를 적용하면 북극해 안전호송 속력은 5 [kt]이하이며, 8 [kts]이상으로 호송 시에는 crash astern & hard rudder를 이용하여 호송거리를 약 3.4L 이상은 유지하여야 한다.

• 한국전자파학회논문지
• /
• 제22권2호
• /
• pp.208-213
• /
• 2011

본 논문은 안전 서비스를 제공하는 Global Positioning System(GPS) 보호 비(Ratio of Interference to Noise: I/N) 도출을 위해 Ultra Wide Band(UWB)로부터 GPS 간섭 영향을 분석하였다. GPS 측위 오차 2.5 m 이하를 만족하기 위한 UWB 송신기와 GPS 수신기 사이의 최소 보호 거리를 산출하였고, 최소 결합 손실 방법(Minimum Coupling Loss: MCL)을 이용하여 측위 오차를 만족하는 UWB 송신기와 GPS 수신기 사이의 보호 거리 값에 근거하여 GPS 시스템의 보호비(I/N)를 도출하였다. 그 결과, 측위 오차 2.5 m 이하를 만족하기 위한 GPS 보호 거리는 10 m 이상으로 계산되었고, 이를 만족하기 위한 GPS 보호비(I/N)는 -20 dB 이하로 도출되었다. 제안된 GPS 시스템 보호비는 국제전기통신연합(ITU-R)에서 제안한 GPS 시스템 중 안전 서비스에 해당하는 보호비(I/N)를 만족시킴을 확인하였다. 또한, 본 논문을 통해 얻어진 GPS 보호 비의 결과는 안정적인 국내 GPS 시스템 운용을 위한 기준으로 이용될 수 있다.

• Bulletin of the Korean Chemical Society
• /
• 제26권9호
• /
• pp.1421-1426
• /
• 2005

The stationary point structures and relative energies between them as well as binding energies of $(CO)_2$ have been investigated at the CCSD(T) level using the correlation-consistent basis sets aug-cc-pVXZ(X=T,Q,5). It is found that while the equilibrium structure corresponds to the C-bonded T-shaped configuration with intermolecular distance of 4.4 $\AA$, there exists another minimum, slightly higher in energy ($\sim$10 $cm^{-1}$) than the global minimum, corresponding to the O-bonded T-shaped configuration with the intermolecular distance of 3.9 $\AA$. The CCSD(T) basis set limit binding energy of $(CO)_2$ is estimated to be 132 $cm^{-1}$.

• Journal of the Optical Society of Korea
• /
• 제19권1호
• /
• pp.95-101
• /
• 2015

To accurately extract absolute distance information from a self-mixing interferometry (SMI) signal, in this paper we propose an approach based on a particle swarm optimization (PSO) algorithm instead of frequency estimation for absolute distance. The algorithm is utilized to search for the global minimum of the fitness function that is established from the self-mixing signal to find out the actual distance. A resolution superior to $25{\mu}m$ in the range from 3 to 20 cm is obtained by experimental measurement, and the results demonstrate the superiority of the proposed approach in comparison with interpolated FFT. The influence of different external feedback strength parameters and different inertia weights in the algorithm is discussed as well.

• 한국정보처리학회논문지
• /
• 제7권10호
• /
• pp.3280-3289
• /
• 2000

본 논문에서는 볼륨데이터와 전역적 형태정보를 이용하여 볼륨렌더링의 질적측면과 속도측면에서 개선할 수 있는 선택적 볼륨렌더링방법을 제안한다. 선택적 볼륨렌더링방법은 관심부위를 구성하는 외곽선으로부터 최소거리를 결정하는 거리변환을 통하여 거리변환볼륨을 생성하고 이를 렌더링하는 방법으로 형태정보를 이용함으로써 서로 다른 객체들간에 비슷한 명암도로 인해 동일 객체로 인식되는 것을 방지하고, 복잡한 형태를 효과적으로 나타낼 수 있다. 실험결과로는 EBCT 심장데이터에 선택적 볼륨렌더링방법을 적용하여 좌심실, 우심실 렌더링 결과영상과 함께 보간법에 따른 선택적 샘플링 방법 적용결과를 제시한다. 본 제안방법은 볼륨데이터로부터 얻은 형태정보로부터 관심객체 표면을 정확하고 빠르게 가시화할 수 있다.

• 한국정밀공학회지
• /
• 제16권12호
• /
• pp.204-213
• /
• 1999

This paper suggests a numerical method of finding optimal geometric path and minimum-time motion for a manipulator arm. To find the minimum-time motion, the optimal geometric path is searched first, and the minimum-time motion is searched on this optimal path. In the algorithm finding optimal geometric path, the objective function is minimizing the combination of joint velocities, joint-jerks, and actuator forces as well as avoiding several static obstacles, where global search is performed by adjusting the seed points of the obstacle models. In the minimum-time algorithm, the traveling time is expressed by the linear combinations of finite-term quintic B-splines and the coefficients of the splines are obtained by nonlinear programming to minimize the total traveling time subject to the constraints of the velocity-dependent actuator forces. These two search algorithms are basically similar and their convergences are quite stable.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1054-1059
• /
• 2005

The artificial potential method uses a potential field to guide a robot from a start to a goal configuration respectively. The potential field consists of attractive potential used to pull a robot toward a goal and repulsive potential to keep it away from obstacles. However, there are two problems concerning local minimum and computational cost to be resolved in conventional artificial potential methods. This study proposes a method utilizing a spline surface that interpolates arbitrary boundaries and a domain reduction method that reduces the unnecessary area. The proposed spline surface interpolates arbitrary shaped boundaries and is used as an artificial potential to guide a robot for global motion planning of a mobile robot. A reduced domain process reduces the unnecessary domain. We apply a distance-weighted function as such a function, which blends distances from each boundary with a reduction in computational time compared with other analytical methods. As a result, this paper shows that an arbitrary boundary spline surface provides global planning and a domain reduction method reduces local minimum with quick operation.