• Title/Summary/Keyword: Problem Space

Search Result 3,975, Processing Time 0.028 seconds

DESIGN PROBLEM SOLVED BY OPTIMAL CONTROL THEORY

  • Butt, Rizwan
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.1
    • /
    • pp.167-178
    • /
    • 1997
  • In this paper we present an application to airfoil design of an optimum design method based on optimal control theory. The method used here transforms the design problem by way of a change of variable into an optimal control problem for a distributed system with Neumann boundary control. This results in a set of variational inequalities which is solved by adding a penalty term to the differential equation. This si inturn solved by a finite element method.

On lower bounds of eigenvalues for self adjoint operators

  • Lee, Gyou-Bong
    • Journal of the Korean Mathematical Society
    • /
    • v.31 no.3
    • /
    • pp.477-492
    • /
    • 1994
  • For the eigenvalue problem of $Au = \lambda u$ where A is considered as a semi-bounded self-adjoint operator on a Hilbert space, we are used to apply two complentary methods finding upper bounds and lower bounds to the eigenvalues. The most popular method for finding upper bounds may be the Rayleigh-Ritz method which was developed in the 19th century while a method for computing lower bounds may be the method of intermediate eigenvalue problems which has been developed since 1950's. In the method of intermediate eigenvalue problems (IEP), we consider the original operator eigenvalue problem as a perturbation of a simpler, resolvable, self-adjoint eigenvalue problem, called a base problem, that gives rough lower bounds.

  • PDF

INVERSE MINIMUM FLOW PROBLEM

  • Ciurea, Eleonor;Deaconu, Adrian
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.193-203
    • /
    • 2007
  • In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

A NEW ALGORITHM FOR SOLVING MIXED EQUILIBRIUM PROBLEM AND FINDING COMMON FIXED POINTS OF BREGMAN STRONGLY NONEXPANSIVE MAPPINGS

  • Biranvand, Nader;Darvish, Vahid
    • Korean Journal of Mathematics
    • /
    • v.26 no.4
    • /
    • pp.777-798
    • /
    • 2018
  • In this paper, we study a new iterative method for solving mixed equilibrium problem and a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the framework of reflexive real Banach spaces. Moreover, we prove a strong convergence theorem for finding common fixed points which also are solutions of a mixed equilibrium problem.

Optimization of Sigmoid Activation Function Parameters using Genetic Algorithms and Pattern Recognition Analysis in Input Space of Two Spirals Problem (유전자알고리즘을 이용한 시그모이드 활성화 함수 파라미터의 최적화와 이중나선 문제의 입력공간 패턴인식 분석)

  • Lee, Sang-Wha
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.10-18
    • /
    • 2010
  • This paper presents a optimization of sigmoid activation function parameter using genetic algorithms and pattern recognition analysis in input space of two spirals benchmark problem. To experiment, cascade correlation learning algorithm is used. In the first experiment, normal sigmoid activation function is used to analyze the pattern classification in input space of the two spirals problem. In the second experiment, sigmoid activation functions using different fixed values of the parameters are composed of 8 pools. In the third experiment, displacement of the sigmoid function to determine the value of the three parameters is obtained using genetic algorithms. The parameter values applied to the sigmoid activation functions for candidate neurons are used. To evaluate the performance of these algorithms, each step of the training input pattern classification shows the shape of the two spirals.

Minimum-Energy Spacecraft Intercept on Non-coplanar Elliptical Orbits Using Genetic Algorithms

  • Oghim, Snyoll;Lee, Chang-Yull;Leeghim, Henzeh
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.18 no.4
    • /
    • pp.729-739
    • /
    • 2017
  • The objective of this study was to optimize minimum-energy impulsive spacecraft intercept using genetic algorithms. A mathematical model was established on two-body system based on f and g solution and universal variable to address spacecraft intercept problem for non-coplanar elliptical orbits. This nonlinear problem includes many local optima due to discontinuity and strong nonlinearity. In addition, since it does not provide a closed-form solution, it must be solved using a numerical method. Therefore, the initial guess is that a very sensitive factor is needed to obtain globally optimal values. Genetic algorithms are effective for solving these kinds of optimization problems due to inherent properties of random search algorithms. The main goal of this paper was to find minimum energy solution for orbit transfer problem. The numerical solution using initial values evaluated by the genetic algorithm matched with results of Hohmann transfer. Such optimal solution for unrestricted arbitrary elliptic orbits using universal variables provides flexibility to solve orbit transfer problems.

Orthogonalization principle for hybrid control of robot arms under geometric constraint

  • Arimoto, Suguru
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.1-6
    • /
    • 1992
  • A principle of "orthogonalization" is proposed as an extended notion of hybrid (force and position) control for robot manipulators under geometric endpoint constraints. The principle realizes the hybrid control in a strict sense by letting position and velocity feedback signals be orthogonal in joint space to the contact force vector whose components are exerted at corresponding joints. This orthogonalization is executed via a projection matrix computed in real-time from a gradient of the equation of the surface in joint coordinates and hence both projected position and velocity feedback signals become perpendicular to the force vector that is normal to the surface at the contact point in joint space. To show the important role of the principle in control of robot manipulators, three basic problems are analyzed, the first is a hybrid trajectory tracking problem by means of a "modified hybrid computed torque method", the second is a model-based adaptive control problem for robot manipulators under geometric endpoint constraints, and the third is an iterative learning control problem. It is shown that the passivity of residual error dynamics of robots follows from the orthogonalization principle and it plays a crucial role in convergence properties of both positional and force error signals.force error signals.

  • PDF

Real Time Estimation in 1-Dimensional Temperature Distribution Using Modal Analysis and Observer (모드해석과 관측기를 이용한 1차원 온도분포의 실시간 예측)

  • An, Jung-Yong;Park, Yeong-Min;Jeong, Seong-Jong
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.25 no.2
    • /
    • pp.195-201
    • /
    • 2001
  • An inverse heat conduction problem(IHCP) arises when unknown heat fluxes and whole temperature field are to be found with temperature measurements of a few points. In this paper, observers are proposed as solution algorithm for the IHCP. A 1-dimensional heat transfer problem is modeled with modal analysis and state space equations. Position of the heat source is estimated through test heat inputs and the autocorrelation among a few of temperature data. The modified Bass-Gura method is used to design a state observer to estimate the intensity of heat source and the whole temperature field of a 1-dimensional body. To verify the reliability of this estimator, analytic solutions obtained from the proposed method are compared.

Reconfiguration of Redundant Thrusters by Allocation Method

  • Jin, Jae-Hyun;Tahk, Min-Jea
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.6 no.2
    • /
    • pp.76-83
    • /
    • 2005
  • Thrusters are important actuators where air is rare. Since the maintenance or replacement of thrusters is not easy in such an environment, a thrusting system must be highly reliable. Redundant thrusters are used to meet the reliability requirement. In this paper, a reconfiguration problem for those redundant thrusters is discussed, especially the management or distribution logic of redundant thrusters is focused on. The logic has to be changed if faults occur at thrusters. Reconfiguration is to change the distribution logic to accommodate thrusters' faults. The authors propose a reconfiguration algorithm based on the linear programming method. The authors define the reconfiguration problem as an optimization problem. The performance index is a quantity related with total fuel consumption by thrusters. This algorithm can accommodate multiple faults. Numerical examples are given to show the advantage of the proposed algorithm over existing methods.