• Title/Summary/Keyword: Optimal point

Search Result 2,305, Processing Time 0.031 seconds

Development of a Multi-objective function Method Based on Pareto Optimal Point (Pareto 최적점 기반 다목적함수 기법 개발에 관한 연구)

  • Na, Seung-Soo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.42 no.2 s.140
    • /
    • pp.175-182
    • /
    • 2005
  • It is necessary to develop an efficient optimization technique to optimize the engineering structures which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of engineering structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points by spreading point randomly entire the design spaces. In this paper, a Pareto optimal based multi-objective function method (PMOFM) is developed by considering the search direction based on Pareto optimal points, step size, convergence limit and random search generation . The PMOFM can also apply to the single objective function problems, and can consider the discrete design variables such as discrete plate thickness and discrete stiffener spaces. The design results are compared with existing Evolutionary Strategies (ES) method by performing the design of double bottom structures which have discrete plate thickness and discrete stiffener spaces.

A Study on the Optimal Control Strategy of Air-Conditioning System with Slab Thermal Storage - Results Influenced by the Choice of a Criterion Function - (슬래브축열의 최적제어방책에 관한 연구 -평가함수의 선택이 결과에 미치는 영향-)

  • Jung, Jae-Hoon;Shin, Young-Gy
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.18 no.11
    • /
    • pp.896-905
    • /
    • 2006
  • An optimal control of an air-conditioning system with slab thermal storage is investigated by making use of the Maximum Principle. An optimal heat input to a plenum chamber and an air-conditioned room is determined by minimizing a criterion function which is given as integral sum of two terms. The first term is the square of the deviation in the room air temperature from the set-point value, and the second is the absolute value of the heat input. The result indicates that it tries to keep a room air temperature in set-point value by heating as much as possible at the time of a setup of a room air temperature or just before that, in order to avoid a heat loss arising at the time of the non-air conditioning. The result is compared with that of the case when the square of the heat input is used as a criterion.

A Study on Passive Homing Trajectory for Maximizing Target Information (표적 정보량을 최대화하는 피동 호밍궤적에 관한 고찰)

  • Ra, Won-Sang;Shin, Hyo-Sang;Jung, Bo-Young;Whang, Ick-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.172-181
    • /
    • 2019
  • This paper deals with the problem of generating the energy optimal trajectory which is intended to enhance the target tracking performance of a passive homing missile. Noticing that the essence of passive target tracking is the range estimation problem, the target information gathered by passive measurements can be readily analyzed by introducing the range estimator designed in line-of-sight(LOS) frame. Moreover, for the linear filter structure of the suggested range estimator, the cost function associated with the target information is clearly expressed as a function of the line-of-sight rate. Based on this idea, the optimal missile trajectory maximizing the target information is obtained by solving the saddle point problem for an indefinite quadratic cost which consists of the target information and the energy. It is shown that, different from the previous heuristic approaches, the guidance command producing the optimal passive homing trajectory is produced by the modified proportional navigation guidance law whose navigation constant is determined by the weighting coefficient for target information cost.

Artificial Neural Network for Stable Robotic Grasping (안정적 로봇 파지를 위한 인공신경망)

  • Kim, Kiseo;Kim, Dongeon;Park, Jinhyun;Lee, Jangmyung
    • The Journal of Korea Robotics Society
    • /
    • v.14 no.2
    • /
    • pp.94-103
    • /
    • 2019
  • The optimal grasping point of the object varies depending on the shape of the object, such as the weight, the material, the grasping contact with the robot hand, and the grasping force. In order to derive the optimal grasping points for each object by a three fingered robot hand, optimal point and posture have been derived based on the geometry of the object and the hand using the artificial neural network. The optimal grasping cost function has been derived by constructing the cost function based on the probability density function of the normal distribution. Considering the characteristics of the object and the robot hand, the optimum height and width have been set to grasp the object by the robot hand. The resultant force between the contact area of the robot finger and the object has been estimated from the grasping force of the robot finger and the gravitational force of the object. In addition to these, the geometrical and gravitational center points of the object have been considered in obtaining the optimum grasping position of the robot finger and the object using the artificial neural network. To show the effectiveness of the proposed algorithm, the friction cone for the stable grasping operation has been modeled through the grasping experiments.

Minimizing Weighted Mean of Inefficiency for Robust Designs

  • Seo, Han-Son
    • Communications for Statistical Applications and Methods
    • /
    • v.15 no.1
    • /
    • pp.95-104
    • /
    • 2008
  • This paper addresses issues of robustness in Bayesian optimal design. We may have difficulty applying Bayesian optimal design principles because of the uncertainty of prior distribution. When there are several plausible prior distributions and the efficiency of a design depends on the unknown prior distribution, robustness with respect to misspecification of prior distribution is required. We suggest a new optimal design criterion which has relatively high efficiencies across the class of plausible prior distributions. The criterion is applied to the problem of estimating the turning point of a quadratic regression, and both analytic and numerical results are shown to demonstrate its robustness.

Optimal replacement strategy under repair warranty with age-dependent minimal repair cost

  • Jung, K.M.
    • International Journal of Reliability and Applications
    • /
    • v.12 no.2
    • /
    • pp.117-122
    • /
    • 2011
  • In this paper, we suggest the optimal replacement policy following the expiration of repair warranty when the cost of minimal repair depends on the age of system. To do so, we first explain the replacement model under repair warranty. And then the optimal replacement policy following the expiration of repair warranty is discussed from the user's point of view. The criterion used to determine the optimality of the replacement model is the expected cost rate per unit time, which is obtained from the expected cycle length and the expected total cost for our replacement model. The numerical examples are given for illustrative purpose.

  • PDF

On the Linear Quadratic Regulator for Descriptor Systems

  • Katayama, Tohru;Minamino, Katsuki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.219-224
    • /
    • 1992
  • This paper deals with the linear quadratic optimal regulator problem for descriptor systems without performing a preliminary transformation for a descriptor system. We derive a generalized Riccati differential equation (GRDE) based on the two-point boundary value problem for a Hamiltonian equation. We then obtain an optimal feedback control and the optimal cost in terms of the solution of GRE. A simple example is included.

  • PDF

ON A GENERAL CLASS OF OPTIMAL FOURTH-ORDER MULTIPLE-ROOT FINDERS

  • Kim, Young Ik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.3
    • /
    • pp.657-669
    • /
    • 2013
  • A general class of two-point optimal fourth-order methods is proposed for locating multiple roots of a nonlinear equation. We investigate convergence analysis and computational properties for the family. Special and simple cases are considered for real-life applications. Numerical experiments strongly verify the convergence behavior and the developed theory.

Mixture Bayesian Robust Design

  • Seo, Han-Son
    • Journal of Korean Society for Quality Management
    • /
    • v.34 no.1
    • /
    • pp.48-53
    • /
    • 2006
  • Applying Bayesian optimal design principles is not easy when a prior distribution is not certain. We present a optimal design criterion which possibly yield a reasonably good design and also robust with respect to misspecification of the prior distributions. The criterion is applied to the problem of estimating the turning point of a quadratic regression. Exact mathematical results are presented under certain conditions on prior distributions. Computational results are given for some cases not satisfying our conditions.

GIS Optimization for Bigdata Analysis and AI Applying (Bigdata 분석과 인공지능 적용한 GIS 최적화 연구)

  • Kwak, Eun-young;Park, Dea-woo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.171-173
    • /
    • 2022
  • The 4th industrial revolution technology is developing people's lives more efficiently. GIS provided on the Internet services such as traffic information and time information makes people getting more quickly to destination. National geographic information service(NGIS) and each local government are making basic data to investigate SOC accessibility for analyzing optimal point. To construct the shortest distance, the accessibility from the starting point to the arrival point is analyzed. Applying road network map, the starting point and the ending point, the shortest distance, the optimal accessibility is calculated by using Dijkstra algorithm. The analysis information from multiple starting points to multiple destinations was required more than 3 steps of manual analysis to decide the position for the optimal point, within about 0.1% error. It took more time to process the many-to-many (M×N) calculation, requiring at least 32G memory specification of the computer. If an optimal proximity analysis service is provided at a desired location more versatile, it is possible to efficiently analyze locations that are vulnerable to business start-up and living facilities access, and facility selection for the public.

  • PDF