• 제목/요약/키워드: closest distance

검색결과 187건 처리시간 0.026초

3차원 일대일 충돌 감지 및 회피 알리고리듬 (Algorithm for Pairwise Collision Detection and Avoidace in 3-D)

  • 김광연;박정우;탁민제
    • 한국항공우주학회지
    • /
    • 제36권10호
    • /
    • pp.996-1002
    • /
    • 2008
  • 본 논문에서는 3차원 일대일 충돌 감지, 충돌 회피 및 경로점 유도를 위한 알고리듬에 대해 다룬다. 항공기는 질점 모델로 가정하였다. 충돌 감지는 최근접점까지 남은 시간과 그 때의 거리를 기준 값과 비교하여 수행하였다. 충돌 회피는 최적 제어 이론을 이용하여 최종 시간에서의 상대 거리를 최대화하는 가속도 입력을 계산하여 수행하였다. 경로점 유도는 잘 알려진 비례항법유도를 적용하였다. 제안된 알고리듬의 성능은 두 개의 시나리오를 통하여 검증하였다.

A Density-Based K-Nearest Neighbors Search Method

  • Jang I. S.;Min K.W.;Choi W.S
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
    • /
    • pp.260-262
    • /
    • 2004
  • Spatial database system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to visit unnecessary node by applying pruning technique. But this method access more disk than necessary while pruning unnecessary node. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN object using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit fewer disks than MINMAX method by the factor of maximum $22\%\;and\;average\;6\%.$

  • PDF

DIRECT COMPUTATION OF MARGINAL OPERATING CONDITIONS FOR VOLTAGE COLLAPSE

  • Lee, Kyung-Jae;Jung, Tay-Ho
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1989년도 하계종합학술대회 논문집
    • /
    • pp.195-201
    • /
    • 1989
  • Voltage collapse is a serious concern to the electirc utility industry. It is common to associate steady-state stability with the ability of the transmission system to transport real power and to associate voltage collapse with the inability to provide reactive power at the necessary locations within the system. An algorithm to directly calculate the critical point of system voltage collapse was presented by the authors. The method (based on the ordinary power flow equations and explicit requirement of singularity of the Jacobian matrix) is basically one degree of freedom with proper load distribution factors. This paper suggests a modified algorithm to increase the degree of freedom, introducing the nonlinear programming technique. The objective function is a distance measure between the present operating point and the closest voltage collapse point. Knowledge of the distance and the most vulnarable bus from the voltage collapse point of view may be used as a useful index for the secure system operation.

  • PDF

DWW 알고리즘을 적용한 고속 가중 FDNN의 설계 (Design of high speed weighted FDNN applied DWW algorithm)

  • 이철희;변오성;문성룡
    • 전자공학회논문지C
    • /
    • 제35C권7호
    • /
    • pp.101-108
    • /
    • 1998
  • In this paper, after we got to realized FDNN (fuzzy decision neural network) applied the quantization triangularity fuzzy function to DBNN(decision based neural network) of a hierarchical structure for image process, we could esign hardware of the realized FDNN. Also it is normalized the standard image and the input image as the same size. We are applied DWW algorithm which selected the closest value with finding similarity of an interval image by this distance to FDNN. So we could calulated in terms of distance to weight of pixel which composed two image and eliminated the nise of image, minimized the lost of information, obtained the optimal information. It is designed hardware of high speed weighted FDNN using COMPASS tool. Aslo, the total circuit is realized as gates of 61,000 and could show to superiority of FDNN using the simulation.

  • PDF

자율운항선박 시뮬레이션 및 실해역 실험 분석 (Analysis of Simulation and Sea Trial test for MASS)

  • 김동균;김진수;임남균
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2023년도 춘계학술대회
    • /
    • pp.263-264
    • /
    • 2023
  • 본 연구는 자율운항선박의 실제 해상에서의 성능 검증하기 위한 실험을 진행하였다. 먼저 SAS(Samsung Autonomous System)을 활용하여 시뮬레이션을 진행하였다. 시뮬레이션은 Imazu 조우 모델을 기반으로 실험을 진행하였다. 시뮬레이션에서 조우 선박은 2-4척으로 정면, 횡단, 추월 등이 뒤섞인 상황을 가정하였다. 결과 분석은 6가지 항목(속력, Heading, Rate of Turn, Collison Risk Index, DCPA, TCPA, Closest Distance, XTD(Cross-Track Distance))을 분석하였다. 2 차례의 실해역 실험을 진행하였다. 목포-제주도 구간에서 실해역 실험을 진행 후 목포-이어도-독도 항로에서 실해역 실험을 진행하였다. 실해역 실험 결과 Imazu 모델 기반 시뮬레이션과 비슷한 결과를 보였다.

  • PDF

A Study on DNN-based STT Error Correction

  • Jong-Eon Lee
    • International journal of advanced smart convergence
    • /
    • 제12권4호
    • /
    • pp.171-176
    • /
    • 2023
  • This study is about a speech recognition error correction system designed to detect and correct speech recognition errors before natural language processing to increase the success rate of intent analysis in natural language processing with optimal efficiency in various service domains. An encoder is constructed to embedded the correct speech token and one or more error speech tokens corresponding to the correct speech token so that they are all located in a dense vector space for each correct token with similar vector values. One or more utterance tokens within a preset Manhattan distance based on the correct utterance token in the dense vector space for each embedded correct utterance token are detected through an error detector, and the correct answer closest to the detected error utterance token is based on the Manhattan distance. Errors are corrected by extracting the utterance token as the correct answer.

순환검색공간에서 K-최근접객체 쌍을 찾는 알고리즘에 관한 연구 (Algorithm for Finding K-Nearest Object Pairs in Circular Search Spaces)

  • 선휘준;김홍기
    • Spatial Information Research
    • /
    • 제20권2호
    • /
    • pp.165-172
    • /
    • 2012
  • 최근의 검색시스템에서는 두 객체집합에 대하여 가장 근접해 있는 K개의 객체 쌍을 찾는 질의가 자주 발생한다. 이러한 K개의 최대근접 객체 쌍을 찾는 질의를 효율적으로 처리하기 위해서는 객체의 순환적 위치속성이 고려되어야 한다. 본 논문은 순환도메인을 갖는 검색공간에서 서로 간에 가장 근접해 있는 K개의 객체쌍을 찾는 최적의 알고리즘을 제안하고 그 성능을 실험을 통하여 보인다. 제안한 알고리즘은 객체의 순환적 위치속성이 반영된 순환검색거리를 이용하여 K개의 최대 근접객체 쌍을 찾는 비용을 최적화한다.

K-nn을 이용한 Hot Deck 기반의 결측치 대체 (Imputation of Missing Data Based on Hot Deck Method Using K-nn)

  • 권순창
    • 한국IT서비스학회지
    • /
    • 제13권4호
    • /
    • pp.359-375
    • /
    • 2014
  • Researchers cannot avoid missing data in collecting data, because some respondents arbitrarily or non-arbitrarily do not answer questions in studies and experiments. Missing data not only increase and distort standard deviations, but also impair the convenience of estimating parameters and the reliability of research results. Despite widespread use of hot deck, researchers have not been interested in it, since it handles missing data in ambiguous ways. Hot deck can be complemented using K-nn, a method of machine learning, which can organize donor groups closest to properties of missing data. Interested in the role of k-nn, this study was conducted to impute missing data based on the hot deck method using k-nn. After setting up imputation of missing data based on hot deck using k-nn as a study objective, deletion of listwise, mean, mode, linear regression, and svm imputation were compared and verified regarding nominal and ratio data types and then, data closest to original values were obtained reasonably. Simulations using different neighboring numbers and the distance measuring method were carried out and better performance of k-nn was accomplished. In this study, imputation of hot deck was re-discovered which has failed to attract the attention of researchers. As a result, this study shall be able to help select non-parametric methods which are less likely to be affected by the structure of missing data and its causes.

Ray distance를 이용한 3차원 형상의 유사성 판단 (Similarity Measurement of 3D Shapes Using Ray Distances)

  • 황태진;정지훈;오헌영;이건우
    • 한국정밀공학회지
    • /
    • 제21권1호
    • /
    • pp.159-166
    • /
    • 2004
  • Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm, different parts are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

Ray distance를 이용한 3차원 형상의 유사성 판단 (Similarity Measurement of 3D Shapes Using Ray Distances)

  • 정지훈;황태진;오헌영;이건우
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2003년도 춘계학술대회 논문집
    • /
    • pp.70-73
    • /
    • 2003
  • Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm. different paris are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

  • PDF