• Title/Summary/Keyword: Global minima

Search Result 68, Processing Time 0.029 seconds

GLOBAL MINIMA OF LEAST SQUARES CROSS VALIDATION FOR A SYMMETRIC POLYNOMIAL KEREL WITH FINITE SUPPORT

  • Jung, Kang-Mo;Kim, Byung-Chun
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.2
    • /
    • pp.183-192
    • /
    • 1996
  • The least squares cross validated bandwidth is the mini-mizer of the corss validation function for choosing the smooth parame-ter of a kernel density estimator. It is a completely automatic method but it requires inordinate amounts of computational time. We present a convenient formula for calculation of the cross validation function when the kernel function is a symmetric polynomial with finite sup-port. Also we suggest an algorithm for finding global minima of the crass validation function.

Mobile Robot Navigation based on Global DWA with Optimal Waypoints (최적 경유점을 갖는 전역 DWA에 기반한 이동로봇의 주행)

  • Ham, Jong-Gyu;Park, Joong-Tae;Song, Jae-Bok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.7
    • /
    • pp.624-630
    • /
    • 2007
  • The dynamic window approach(DWA) is a well known technique for reactive collision avoidance. It shows safe and efficient performance in real-world experiments. However, a robot can get stuck in local minima because no information about the connectivity of the free space is used to determine the motion. The global DWA can solve this problem of local minima by adding a navigation function. Even with the global DWA, it is still difficult for a robot to execute an abrupt change in its direction, for example, entering from the corridor to a doorway. This paper proposes a modified global DWA using the included angles of waypoints extracted from an optimal path. This scheme enables the robot to decelerate in advance before turning into the doorway. Therefore the robot can reach the goal position more safely and efficiently at high speeds.

Multiple Defect Diagnostics of Gas Turbine Engine using Real Coded GA and Artificial Neural Network (실수코드 유전알고리즘과 인공신경망을 이용한 가스터빈 엔진의 복합 결함 진단 연구)

  • Seo, Dong-Hyuck;Jang, Jun-Young;Roh, Tae-Seong;Choi, Dong-Whan
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.11a
    • /
    • pp.23-27
    • /
    • 2008
  • In this study, Real Coded Genetic Algorithm(RCGA) and Artificial Neural Network(ANN) are used for developing the defect diagnostics of the aircraft turbo-shaft engine. ANN accompanied with large amount data has a most serious problem to fall in the local minima. Because of this weak point, it becomes very difficult to obtain good convergence ratio and high accuracy. To solve this problem, GA based ANN has been suggested. GA is able to search the global minima better than ANN. GA based ANN has shown the RMS defect error of 5% less in single and dual defect cases.

  • PDF

A Study on Economic Effects caused by Improvement of Take-off Minima (이륙최저치 개선에 따른 경제적 효과에 관한 연구)

  • Park, Sohee;Moon, Woochoon;Chang, Manheui
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.22 no.2
    • /
    • pp.48-52
    • /
    • 2014
  • The air traffic are getting a lot of the impact of the weather delays, cancellations, etc. occur frequently. In particular, the phenomenon of global warming, extreme weather events have not experienced one after another and the various damage to users and operators are constantly occurring. In this respect, Take-off Minima of this study are presented need for standardization of ICAO Doc 9365(All Weather Operations). And Incheon International Airport to the introduction of a comprehensive improvement process will be introduced in the future to look forward to take advantage of domestic and international airport officials. In addition, implementation of the Take-off Minima to get direct and indirect economic effects, and will be introduced.

Past Block Matching Motion Estimation based on Multiple Local Search Using Spatial Temporal Correlation (시공간적 상관성을 이용한 국소 다중 탐색기반 고속 블록정합 움직임 추정)

  • 조영창;남혜영;이태홍
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.356-364
    • /
    • 2000
  • Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

  • PDF

Real-time obstacle avoidance for redundant manipulator (여유 자유도 로봇의 실시간 충돌 회피)

  • 조웅장;권동수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1140-1143
    • /
    • 1996
  • A new approach based on artificial potential function is proposed for the obstacle avoidance of redundant manipulators. Unlike the so-called "global" path planning method, which requires expensive computation for the path search before the manipulator starts to move, this new approach, "local" path planning, researches the path in real-time using the local distance information. Previous use of artificial potential function has exhibited local minima in some complex environments. This thesis proposes a potential function that has no local minima even for a cluttered environment. This potential function has been implemented for the collision avoidance of a redundant robot in Simulation. The simulation also employ an algorithm that eliminates collisions with obstacles by calculating the repulsive potential exerted on links, based on the shortest distance to object.

  • PDF

Performance improvement of single-layer neural network with feedback by analyzing the computational energy function (계산 에너지 함수 분석을 통한 궤환성을 갖는 단층신경회로망의 성능개선)

  • 고경희;강민제
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.12
    • /
    • pp.54-60
    • /
    • 1997
  • A new method to neglect the third term of the computational energy expression in the single-layer neural network with feedback is introduced. The system often converges to local minima instead of to global minima, because the computational energy is not matched exactly with the cost function being optimized. One of the factors causing these tow functions different is the third term of computational enegy expression. Regarding this third term energy very small, it is always ignored in designing the system. However, a sthe system growing, this third term energy is also growing and this grown term makes the computational energy function much different from the cost function. In results of differency between two functions, system converges to local minima more than before. In this paper, a new method to neglect te third term energy is introduced, so that the system with tis new method has been imroved.

  • PDF

Conformational Analysis and Molecular Dynamics Simulation of Lactose

  • 오재택;김양미;원영도
    • Bulletin of the Korean Chemical Society
    • /
    • v.16 no.12
    • /
    • pp.1153-1162
    • /
    • 1995
  • The conformational details of β-lactose are investigated through molecular dynamics simulations in conjunction with the adiabatic potential energy map. The adiabatic energy map generated in vacuo contains five local minima. The lowest energy structure on the map does not correspond to the structure determined experimentally by NMR and the X-ray crystallography. When aqueous solvent effect is incorporated into the energy map calculation by increasing the dielectric constant, one of the local minima in the vacuum energy map becomes the global minimum in the resultant energy map. The lowest energy structure of the energy map generated in aquo is consistent with the one experimentally determined. Molecular dynamics simulations starting from those fivelocal minima on the vacuum energy map reveal that conformational transitions can take place among various conformations. Molecular dynamics simulations of the lactose and ricin B chain complex system in a stochastic boundary indicate that the most stable conformation in solution phase is bound to the binding site and that there are conformational changes in the exocyclic region of the lactose molecule upon binding.

Computational Neural Networks (연산회로 신경망)

  • 강민제
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.1
    • /
    • pp.80-86
    • /
    • 2002
  • A neural network structure which is able to perform the operations of analog addition and linear equation is proposed. The network employs Hopfkeld's model of a neuron with the connection elements specified on the basis of an analysis of the energy function. The analog addition network and linear equation network are designed by using Hopfield's A/D converter and linear programming respectively. Simulation using Pspice has shown convergence predominently to the correct global minima.

  • PDF