• 제목/요약/키워드: Sampling-Based Algorithm

검색결과 477건 처리시간 0.071초

An artificial neural network residual kriging based surrogate model for curvilinearly stiffened panel optimization

  • Sunny, Mohammed R.;Mulani, Sameer B.;Sanyal, Subrata;Kapania, Rakesh K.
    • Advances in Computational Design
    • /
    • 제1권3호
    • /
    • pp.235-251
    • /
    • 2016
  • We have performed a design optimization of a stiffened panel with curvilinear stiffeners using an artificial neural network (ANN) residual kriging based surrogate modeling approach. The ANN residual kriging based surrogate modeling involves two steps. In the first step, we approximate the objective function using ANN. In the next step we use kriging to model the residue. We optimize the panel in an iterative way. Each iteration involves two steps-shape optimization and size optimization. For both shape and size optimization, we use ANN residual kriging based surrogate model. At each optimization step, we do an initial sampling and fit an ANN residual kriging model for the objective function. Then we keep updating this surrogate model using an adaptive sampling algorithm until the minimum value of the objective function converges. The comparison of the design obtained using our optimization scheme with that obtained using a traditional genetic algorithm (GA) based optimization scheme shows satisfactory agreement. However, with this surrogate model based approach we reach optimum design with less computation effort as compared to the GA based approach which does not use any surrogate model.

변류기 포화 판단 알고리즘의 저역통과 필터에 대한 성능 분석 (Performance Analysis of a Lowpass Filter on a CT Saturation Detection Algorithm)

  • 강용철;옥승환;윤재성;강상희
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제51권10호
    • /
    • pp.495-501
    • /
    • 2002
  • A difference based current transformer (CT) saturation detection algorithm uses the third difference of a secondary current to detect the instants of the beginning/end of saturation. The third difference of a secondary current contains high frequency components when a CT is saturated. Thus, an effect of an anti-aliasing lowpass filter implemented in digital protection relays on the detection algorithm should be studied. This paper describes performance analysis of a lowpass filter on the CT saturation detection algorithm. The cutoff frequency of the lowpass filter is normally set to be half of a sampling frequency. In this Paper, two sampling frequencies of 3,840 (Hz) corresponding to 64 sample/cycle (s/c) and 1,920 (Hz) corresponding to 32 (s/c) are studied; the cutoff frequencies of the lowpass filters are set to be 1,920 (Hz), 960 (Hz) and 960(Hz), 480(Hz), respectively. And the proposed algorithm is verified by experiment. A 2nd order Butterworth filter is designed as a lowpass filter. The test results and experiment results clearly indicate that the saturation detection algorithm successfully detects the instants of the beginning/end of saturation even though a secondary current is filtered by the designed lowpass filters.

A Hybrid Estimation of Distribution Algorithm with Differential Evolution based on Self-adaptive Strategy

  • Fan, Debin;Lee, Jaewan
    • 인터넷정보학회논문지
    • /
    • 제22권1호
    • /
    • pp.1-11
    • /
    • 2021
  • Estimation of distribution algorithm (EDA) is a popular stochastic metaheuristic algorithm. EDA has been widely utilized in various optimization problems. However, it has been shown that the diversity of the population gradually decreases during the iterations, which makes EDA easily lead to premature convergence. This article introduces a hybrid estimation of distribution algorithm (EDA) with differential evolution (DE) based on self-adaptive strategy, namely HEDADE-SA. Firstly, an alternative probability model is used in sampling to improve population diversity. Secondly, the proposed algorithm is combined with DE, and a self-adaptive strategy is adopted to improve the convergence speed of the algorithm. Finally, twenty-five benchmark problems are conducted to verify the performance of HEDADE-SA. Experimental results indicate that HEDADE-SA is a feasible and effective algorithm.

그리드 단체 위의 디리슐레 분포에서 마르코프 연쇄 몬테 칼로 표집 (MCMC Algorithm for Dirichlet Distribution over Gridded Simplex)

  • 신봉기
    • 정보과학회 컴퓨팅의 실제 논문지
    • /
    • 제21권1호
    • /
    • pp.94-99
    • /
    • 2015
  • 비모수 베이스 통계학, 확률적 표집에 기반한 추론 등이 기계학습의 주요 패러다임으로 등장하면서 디리슐레(Dirichlet) 분포는 최근 다양한 그래프 모형 곳곳에 등장하고 있다. 디리슐레 분포는 일변수 감마 분포를 벡터 분포로 확장한 형태의 하나이다. 본 논문에서는 감마 분포를 갖는 임의의 자연수 X를 K개의 자연수의 합으로 임의 분할 할 때 각 부분의 크기 비율을 디리슐레 분포에서 표집하는 방법을 제안한다. 일반적으로 디리슐레 분포는 연속적인 (K-1)-단체(simplex) 위에 정의 되지만 자연수로 분할하는 표본은 자연수라는 조건 때문에 단체 내부의 이산 그리드 점에만 정의된다. 본 논문에서는 단체 위의 그리드 상의 이웃 점들의 확률 분포로부터 마르코프연쇄 몬테 칼로(MCMC) 제안 분포를 정의하고 일련의 표본들의 마르코프 연쇄를 구현하는 알고리듬을 제안한다. 본 방법은 마르코프 모델, HMM 및 준-HMM 등에서 각 상태별 시간 지속 분포를 표현하는데 활용 가능하다. 나아가 최근 제안된 전역-지역(global-local) 상태지속 분포를 동시에 모형화하는 감마-디리슐레 HMM에도 응용가능하다.

소비자 보호를 위한 선별형 샘플링 검사와 신뢰성 샘플링 검사의 최적설계에 관한 연구 (A Study on the Rectifying Inspection Plan & Life Test Sampling Plan Considering Cost)

  • 강보철;조재립
    • 품질경영학회지
    • /
    • 제30권1호
    • /
    • pp.74-96
    • /
    • 2002
  • The objectives of this study is to suggest the rectifying sampling inspection plan considering quality cost. Limiting quality level(LQL) plans(also called LTPD plans) and outgoing quality(OQ) plans are considered. The Hald's linear cost model is discussed with and without a beta prior for the distribution of the fraction of nonconforming items in a lot. It is assumed that the sampling inspection is error free. We consider the design of reliability acceptance sampling plan (RASP) for failure rate level qualification at selected confidence level. The lifetime distribution of products is assumed to be exponential. MIL-STD-690C and K C 6032 standards provide this procedures. But these procedures have some questions to apply in the field. The cost of test and confidence level(1-$\beta$ risk) are the problem between supplier and user. So, we suggest that the optimal life test sampling inspection plans using simple linear cost model considering product cost, capability of environment chamber, environmental test cost, and etc. Especially, we consider a reliability of lots that contain some nonconforming items. In this case we assumed that a nonconforming item fail after environmental life test. Finally, we develope the algorithm of the optimal sampling inspection plan based on minimum costs for rectifying inspection and RASP. And computer application programs are developed So, it is shown how the desired sampling plan can be easily found.

Choice of Efficient Sampling Rate for GNSS Signal Generation Simulators

  • Jinseon Son;Young-Jin Song;Subin Lee;Jong-Hoon Won
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제12권3호
    • /
    • pp.237-244
    • /
    • 2023
  • A signal generation simulator is an economical and useful solution in Global Navigation Satellite System (GNSS) receiver design and testing. A software-defined radio approach is widely used both in receivers and simulators, and its flexible structure to adopt to new signals is ideally suited to the testing of a receiver and signal processing algorithm in the signal design phase of a new satellite-based navigation system before the deployment of satellites in space. The generation of highly accurate delayed sampled codes is essential for generating signals in the simulator, where its sampling rate should be chosen to satisfy constraints such as Nyquist criteria and integer and non-commensurate properties in order not to cause any distortion of original signals. A high sampling rate increases the accuracy of code delay, but decreases the computational efficiency as well, and vice versa. Therefore, the selected sampling rate should be as low as possible while maintaining a certain level of code delay accuracy. This paper presents the lower limits of the sampling rate for GNSS signal generation simulators. In the simulation, two distinct code generation methods depending on the sampling position are evaluated in terms of accuracy versus computational efficiency to show the lower limit of the sampling rate for several GNSS signals.

샘플링 범위 제한을 이용한 원 및 구 장애물 환경에서의 RRT* 계열 알고리즘 성능 개량 (Performance Improvement of RRT* Family Algorithms by Limiting Sampling Range in Circular and Spherical Obstacle Environments)

  • 이상일;박종호;임재성
    • 한국항공우주학회지
    • /
    • 제50권11호
    • /
    • pp.809-817
    • /
    • 2022
  • 무인 로봇과 UAV의 발달로 경로 계획 알고리즘의 필요성이 높아지고 있으며 다양한 환경에서 잘 작동하는 RRT* 알고리즘이 여러 분야에서 유용하게 활용되고 있다. RRT* 알고리즘에 다양한 변형을 통해 더 좋은 경로를 생성하기 위한 많은 연구가 진행되고 있으며, 이러한 노력 덕분에 알고리즘의 성능 향상은 거듭되는 중이다. 본 논문은 이러한 연구의 연장선에서 샘플링 범위의 제한을 이용하여 효율적인 경로를 생성하는 방법을 제안한다. 장애물이 있는 환경에서 경로가 장애물에 근접할수록 최적의 경로에 가까워진다는 발상에 근거하여 더 짧은 경로를 얻기 위해 장애물 근처에 노드를 생성한다. 또한 경로가 장애물을 휘감는 경우 변경된 재연결 방법을 통해 빠르게 직선화된 경로를 얻는다. 기존의 알고리즘과 제안하는 방법을 비교 분석하여 성능을 검증하고, 무인항공기의 운동학 모델을 도입하여 생성된 경로를 추적할 수 있음을 확인한다.

Compressed Sensing-based Multiple-target Tracking Algorithm for Ad Hoc Camera Sensor Networks

  • Lu, Xu;Cheng, Lianglun;Liu, Jun;Chen, Rongjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권3호
    • /
    • pp.1287-1300
    • /
    • 2018
  • Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.

측정치 융합에 기반을 둔 다중표적 방위각 추적 알고리즘 (Mutiple Target Angle Tracking Algorithm Based on measurement Fusion)

  • 류창수
    • 전자공학회논문지 IE
    • /
    • 제43권3호
    • /
    • pp.13-21
    • /
    • 2006
  • Ryu 등은 배열센서 출력을 이용하여 추정한 신호부공간으로부터 표적의 방위각 측정치를 구하고, 이를 이용하여 표적의 방위각 궤적을 추적하는 알고리즘을 제안하였다. Ryu 등이 제안한 방위각 추적 알고리즘은 별도의 데이터연관 필터가 필요 없으며 구조가 간단하다는 장점을 가지고 있다. Ryu의 방위각 추적 알고리즘에서는 신호부공간이 센서출력에 의해서 계속 쇄신되고 있지만 표본시간의 신호부공간에서 구한 측정치만을 사용하고 있으며, 신호대잡음비가 낮은 경우에는 Ryu 알고리즘의 추적 성능이 매우 급격히 저하되는 문제점을 가지고 있다. 본 논문에서는 Ryu 알고리즘의 방위각 추적 성능을 개선하기 위하여 표본시간의 신호부공간에서 구한 측정치뿐만 아니라 표본시간에 인접한 신호부공간으로부터 구한 측정치까지 사용할 수 있도록 ML(Maximum Lekelihood)에 기반을 둔 측정치 융합 기법을 제안한다. 그리고 제안한 측정치 융합 기법을 이용하여 Ryu 알고리즘과 같은 구조를 가지는 새로운 방위각 추적 알고리즘을 제안한다. 제안한 방위각 추적 알고리즘은 Ryu 알고리즘의 장점을 그대로 유지하면서 Ryu 알고리즘보다 향상된 추적 성능을 가진다.