• 제목/요약/키워드: local minima

검색결과 236건 처리시간 0.022초

시뮬레이티드 어니얼링을 이용한 경사선분 추출 알고리즘의 개발 (A Tangential Cutting Algorithm using Simulated Annealing)

  • 천인국;김승우;방재철;이효진
    • 한국멀티미디어학회:학술대회논문집
    • /
    • 한국멀티미디어학회 2002년도 춘계학술발표논문집(하)
    • /
    • pp.574-578
    • /
    • 2002
  • 층 단위로 가공하는 RP(Rapid Prototype) 시스템에서 가공되는 물체의 표면에서는 계단형의 윤곽이 나타난다. 이러한 문제점을 보완하기 위해 경사절단 방법으로 3D 모델을 가공하여 기존의 가공방법에 의해 발생하는 계단형 윤곽 모습과 표면 왜곡 둥의 문제를 보완할 수 있다. 최적의 경사선분의 집합을 구하기 위해 경사절단 선분의 길이와 중간층 점의 거리를 정의하여 이를 최소화하는 에너지 함수를 구현한다. 그러나 이 방법은 경사절단 선분이 에너지가 작아지는 방향으로만 움직이기 때문에 레이어의 윤곽이 복잡한 경우 최적의 위치가 아닌 다른 위치에서 더 이상 움직이지 않는 국부적 최적해(Local Minima)가 발생할 수 있다. 본 논문에서는 국부적 최적해를 벗어나기 위해 경사절단 선분 추출 알고리즘에 시뮬레이티드 어니얼링(Simulated Annealing) 방법을 적용하였다. 제안된 방법으로 테스트한 결과 복잡한 레이어 윤곽에서 생길 수 있는 국부적 최적해가 어느 정도 해결되었다.

  • PDF

적층 쾌속조형 시스템을 위한 시뮬레이티드 어닐링 경사절단 알고리즘 (A Simulated Annealing Tangential Cutting Algorithm for Lamination Rapid Prototyping System)

  • 김명숙;엄태준;김승우;천인국;공용해
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권4호
    • /
    • pp.226-234
    • /
    • 2004
  • A rapid Prototyping system that laser-cuts and laminates thick layers can fabricate 3D objects promptly with a variety of materials. Building such a system must consider the surface distortions due to both vertical-cut layers and triangular surfaces. We developed a tangential layer-cutting algorithm by rearranging tangential lines such that they reconstruct 3D surfaces more closely and also constitute smoother laser trajectories. An energy function that reflects the surface-closeness with the tangential lines was formulated and then the energy was minimized by a gradient descent method. Since this simple method tends to cause many local minima for complex 3D objects, we tried to solve this problem by adding a simulated annealing process to the proposed method. To view and manipulate 3D objects, we also implemented a 3D visual environment. Under this environment, experiments on various 3D objects showed that our algorithm effectively approximates 3D surfaces and makes laser-trajectory feasibly smooth.

The shortest path finding algorithm using neural network

  • Hong, Sung-Gi;Ohm, Taeduck;Jeong, Il-Kwon;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
    • /
    • pp.434-439
    • /
    • 1994
  • Recently neural networks leave been proposed as new computational tools for solving constrained optimization problems because of its computational power. In this paper, the shortest path finding algorithm is proposed by rising a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defined at first. To obtain this energy function, the concept of a vector-represented network is introduced to describe the connected path. Through computer simulations, it will be shown that the proposed algorithm works very well in many cases. The local minima problem of a Hopfield type neural network is discussed.

  • PDF

THE PERFORMANCE OF A MODIFIED ARMIJO LINE SEARCH RULE IN BFGS OPTIMIZATION METHOD

  • Kim, MinSu;Kwon, SunJoo;Oh, SeYoung
    • 충청수학회지
    • /
    • 제21권1호
    • /
    • pp.117-127
    • /
    • 2008
  • The performance of a modified Armijo line search rule related to BFGS gradient type method with the results from other well-known line search rules are compared as well as analyzed. Although the modified Armijo rule does require as much computational cost as the other rules, it shows more efficient in finding local minima of unconstrained optimization problems. The sensitivity of the parameters used in the line search rules is also analyzed. The results obtained by implementing algorithms in Matlab for the test problems in [3] are presented.

  • PDF

병렬 CES를 이용한 QAP 해법 (Solution of quadratic assignment problem using parallel combinatorial variant of evolution strategy)

  • 박래정;이현;박철훈
    • 전자공학회논문지C
    • /
    • 제34C권5호
    • /
    • pp.66-70
    • /
    • 1997
  • This paper presents a parallel combinatorial variant of evolution strategy (PCES) to solve well-known combinatorial optimization problems, Quadratic assignment problems (QAPs). The PCES reduces the possibility of getting stuck in local minima due to maintenance of subpopulation and thus it is more effective than the CES. Experiment results on two benchmark problems show that the PCES is better than the cES and the genetic algorithm(GA).

  • PDF

Characteristics of solutions in softening plasticity and path criterion

  • Chen, G.;Baker, G.
    • Structural Engineering and Mechanics
    • /
    • 제16권2호
    • /
    • pp.141-152
    • /
    • 2003
  • Characteristics of solutions of softening plasticity are discussed in this article. The localized and non-localized solutions are obtained for a three-bar truss and their stability is evaluated with the aid of the second-order work. Beyond the bifurcation point, the single stable loading path splits into several post-bifurcation paths and the second-order work exhibits several competing minima. Among the multiple post-bifurcation equilibrium states, the localized solutions correspond to the minimum points of the second-order work, while the non-localized solutions correspond to the saddles and local maximum points. To determine the real post-bifurcation path, it is proposed that the structure should follow the path corresponding to the absolute minimum point of the second-order work. The proposal is further proved equivalent to Bazant's path criterion derived on a thermodynamics basis.

Visual Tracking Using Snake Algorithm Based on Optical Flow Information

  • Kim, Won;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1999년도 제14차 학술회의논문집
    • /
    • pp.13-16
    • /
    • 1999
  • An active contour model, Snake, was developed as a useful segmenting and tracking tool lot rigid or non-rigid (i.e. deformable) objects by Kass in 1987 In this research, Snake is newly designed to cover this large moving case. Image flow energy is proposed to give Snake the motion information of the target object. By this image flow energy Snake's nodes can move uniformly along the direction of the target motion in spite of the existences of local minima. Furthermore, when the motion is too large to apply image flow energy to tracking, a jump mode is proposed for solving the problem. The vector used to make Snake's nodes jump to the new location can be obtained by processing the image flow. The effectiveness of the proposed Snake is confirmed by some simulations.

  • PDF

단층 신경망과 이중 기각 방법을 이용한 문자인식 (Single-Layer Neural Networks with Double Rejection Mechanisms for Character Recognition)

  • 임준호;채수익
    • 전자공학회논문지B
    • /
    • 제32B권3호
    • /
    • pp.522-532
    • /
    • 1995
  • Multilayer neural networks with backpropagation learning algorithm are widely used for pattern classification problems. For many real applications, it is more important to reduce the misclassification rate than to increase the rate of successful classification. But multilayer perceptrons(MLP's) have drawbacks of slow learning speed and false convergence to local minima. In this paper, we propose a new method for character recognition problems with a single-layer network and double rejection mechanisms, which guarantees a very low misclassification rate. Comparing to the MLP's, it yields fast learning and requires a simple hardware architecture. We also introduce a new coding scheme to reduce the misclassification rate. We have prepared two databases: one with 135,000 digit patterns and the other with 117,000 letter patterns, and have applied the proposed method for printed character recognition, which shows that the method reduces the misclassification rate significantly without sacrificing the correct recognition rate.

  • PDF

Tabu 탐색학습알고리즘에 의한 신경회로망을 이용한 결함진단 (Fault Diagnosis using Neural Network by Tabu Search Learning Algorithm)

  • 양보석;신광재;최원호
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1995년도 추계학술대회논문집; 한국종합전시장, 24 Nov. 1995
    • /
    • pp.280-283
    • /
    • 1995
  • 계층형 신경회로망은 학습능력이나 비선형사상능력을 가지고 있고, 그 특징을 이용하여 패턴인식이나 동정 및 제어 등에의 적용이 시도되어 성과를 올리고 있다. 현재, 그 학습법으로 널리 이용되고 있는 것이 역전파학습법으로 최급 강하법이나 공액경사법 등의 최적화 방법이 적용되고 있지만, 학습에 많은 시간이 걸리는 점, 국소적 최적해(local minima)에 해의 수렴이 이루어져 오차가 충분히 작게 되지 않는 점 등이 문제점으로 지적되고 있다. 본 논문에서는 Hu에 의해 고안된 random 탐색법과 조합된 random tabu 탐색법으로 최적결합계수를 구하는 학습알고리즘으로, 국소적 최적해에 수렴하는 것을 방지하고, 수렴정도를 개선하는 새로운 방법을 이용하여 회전기계의 이상진동진단에 적용가능성을 검토하고 오차역전파법에 의한 진단결과와 비교검토한다.

  • PDF

Hybrid PSO-Complex Algorithm Based Parameter Identification for a Composite Load Model

  • Del Castillo, Manuelito Y. Jr.;Song, Hwachang;Lee, Byongjun
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권3호
    • /
    • pp.464-471
    • /
    • 2013
  • This paper proposes a hybrid searching algorithm based on parameter identification for power system load models. Hybrid searching was performed by the combination of particle swarm optimization (PSO) and a complex method, which enhances the convergence of solutions closer to minima and takes advantage of global searching with PSO. In this paper, the load model of interest is composed of a ZIP model and a third-order model for induction motors for stability analysis, and parameter sets are obtained that best-fit the output measurement data using the hybrid search. The origin of the hybrid method is to further apply the complex method as a local search for finding better solutions using the selected particles from the performed PSO procedure.