• Title/Summary/Keyword: nonlinear minimization

Search Result 156, Processing Time 0.024 seconds

Optimal nonlinear Parameter Estimation of Steady-State Induction Motor using Immune Algorithm

  • Kim, Dong-Hwa;Cho, Jae-Hoon;Hong, Won-Pyo;Lee, Seung-Hack;Lee, Hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.891-895
    • /
    • 2004
  • This paper suggests the techniques in determining the values of the steady-state equivalent circuit parameters of a three-phase squirrel-cage induction machine using immune algorithm. The parameter estimation procedure is based on the steady state phase current versus slip and input power versus slip characteristics. The proposed estimation algorithm is of a nonlinear kind based on clonal selection in immune algorithm. The machine parameters are obtained as the solution of a minimization of least-squares cost function by immune algorithm. Simulation shows better results than the conventional approaches.

  • PDF

On the optimization of the design variables of linear induction motor for 3-D conveyor system (입체 반송용 선형유도전동기의 설계 변수 최적화에 대하여)

  • Im, Dal-Ho;Kim, Gyu-Tak;Park, Seung-Chan
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.139-142
    • /
    • 1991
  • The design variables of SLIM used for 3-D conveyor system are optimized by nonlinear programing. Five design variables are selected as independent ones and object function is expressed as a combination of the weight and the normal force of the motor. Maximum flux density in the teeth, primary length and starting thrust are chosen as constraint functions. Goodness factor considering of conveying characteristic is also included in the constraints. In this paper sequential unconstrained minimization technique(SUMT) and variable metric method are used to solve the nonlinear problem.

  • PDF

OPTIMAL FORMATION TRAJECTORY-PLANNING USING PARAMETER OPTIMIZATION TECHNIQUE

  • Lim, Hyung-Chul;Bang, Hyo-Choong;Park, Kwan-Dong;Lee, Woo-Kyoung
    • Journal of Astronomy and Space Sciences
    • /
    • v.21 no.3
    • /
    • pp.209-220
    • /
    • 2004
  • Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

Torque Harmonics Minimization in PMSM by Using Flux Harmonics Estimation (쇄교자속 추정을 통한 영구자석형 동기전동기의 토오크 제어)

  • 문형태
    • Proceedings of the KIPE Conference
    • /
    • 2000.07a
    • /
    • pp.439-442
    • /
    • 2000
  • An adaptive nonlinear control of a brushless direct drive motor(BLDDM) is proposed. Comparing to the traditional PMSM the direct drive motor has smaller number of per pole and per phase slots to provide higher torque in low speed. This generic construction generates flux harmonics and finally results in unwanted torque harmonics. To control the speed a feedback linearization method is applied by choosing the $i_{ds}$ and $\omega_{m}$ as the output variables. The control of the flux harmonics is provided by using a flux observer with MRAC technique. As shown in the simula-tion results the proposed nonlinear speed controller has a good speed response in the steady state and robust to the flux variation

  • PDF

Optimal Design of a Squeeze Film Damper Using an Enhanced Genetic Algorithm

  • Ahn, Young-Kong;Kim, Young-Chan;Yang, Bo-Suk
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.12
    • /
    • pp.1938-1948
    • /
    • 2003
  • This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

AN APPROACH FOR SOLVING OF A MOVING BOUNDARY PROBLEM

  • Basirzadeh, H.;Kamyad, A.V.
    • Journal of applied mathematics & informatics
    • /
    • v.14 no.1_2
    • /
    • pp.97-113
    • /
    • 2004
  • In this paper we shall study moving boundary problems, and we introduce an approach for solving a wide range of them by using calculus of variations and optimization. First, we transform the problem equivalently into an optimal control problem by defining an objective function and artificial control functions. By using measure theory, the new problem is modified into one consisting of the minimization of a linear functional over a set of Radon measures; then we obtain an optimal measure which is then approximated by a finite combination of atomic measures and the problem converted to an infinite-dimensional linear programming. We approximate the infinite linear programming to a finite-dimensional linear programming. Then by using the solution of the latter problem we obtain an approximate solution for moving boundary function on specific time. Furthermore, we show the path of moving boundary from initial state to final state.

Bandwidth Allocation and Scheduling Algorithms for Ethernet Passive Optical Networks

  • Joo, Un-Gi
    • Management Science and Financial Engineering
    • /
    • v.16 no.1
    • /
    • pp.59-79
    • /
    • 2010
  • This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

Nonlinear Finite Element Model for Tidal Analysis(I) -Model Development- (조석유동 해석을 위한 비선형 유한요소모형(I) -모형의 개발-)

  • 나정우;권순국
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.36 no.3
    • /
    • pp.144-154
    • /
    • 1994
  • An efficient tidal model, TIDE which is an iterative type, nonlinear finite element model has developed for the analysis of the tidal movement in the coastal area which is characterized by irregular boundaries and bottom topography. Traditional time domain finite element models have been in difficulties with requirement for high eddy viscosity coefficients and small time steps to insure numerical instability. These problems are overcome by operating in the frequency domain with an elaborate grid system by combining the triangular and quadrilateral shape grids. Furthermore, in order to handle non-linearity which will be more significant in the shallow region, an iterative scheme with least square error minimization algorithm has been implemented in the model. The results of TIDE model are agreed with the analytical solutions in a rectangular channel under the condition of tidal waves entering the channel closed at one end.

  • PDF

APPROXIMATION OF ZEROS OF SUM OF MONOTONE MAPPINGS WITH APPLICATIONS TO VARIATIONAL INEQUALITY AND IMAGE RESTORATION PROBLEMS

  • Adamu, Abubakar;Deepho, Jitsupa;Ibrahim, Abdulkarim Hassan;Abubakar, Auwal Bala
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.2
    • /
    • pp.411-432
    • /
    • 2021
  • In this paper, an inertial Halpern-type forward backward iterative algorithm for approximating solution of a monotone inclusion problem whose solution is also a fixed point of some nonlinear mapping is introduced and studied. Strong convergence theorem is established in a real Hilbert space. Furthermore, our theorem is applied to variational inequality problems, convex minimization problems and image restoration problems. Finally, numerical illustrations are presented to support the main theorem and its applications.

A Solution Algorithm for Elastic Demand Traffic Assignment Model Based on Dynamic Process (동적과정을 이용한 가변수요 통행배정모형의 알고리듬 개발)

  • Im, Yong-Taek;Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.169-178
    • /
    • 2006
  • Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.