• Title/Summary/Keyword: Optimum-adaptive

Search Result 238, Processing Time 0.024 seconds

Margin Adaptive Optimization in Multi-User MISO-OFDM Systems under Rate Constraint

  • Wei, Chuanming;Qiu, Ling;Zhu, Jinkang
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.112-117
    • /
    • 2007
  • In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

Maximum Power Tracking Control for parallel-operated DFIG Based on Fuzzy-PID Controller

  • Gao, Yang;Ai, Qian
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.6
    • /
    • pp.2268-2277
    • /
    • 2017
  • As constantly increasing wind power penetrates power grid, wind power plants (WPPs) are exerting a direct influence on the traditional power system. Most of WPPs are using variable speed constant frequency (VSCF) wind turbines equipped with doubly fed induction generators (DFIGs) due to their high efficiency over other wind turbine generators (WTGs). Therefore, the analysis of DFIG has attracted considerable attention. Precisely measuring optimum reference speed is basis of utilized maximum wind power in electric power generation. If the measurement of wind speed can be easily taken, the reference of rotation speed can be easily calculated by known system's parameters. However, considering the varying wind speed at different locations of blade, the turbulence and tower shadow also increase the difficulty of its measurement. The aim of this study is to design fuzzy controllers to replace the wind speedometer to track the optimum generator speed based on the errors of generator output power and rotation speed in varying wind speed. Besides, this paper proposes the fuzzy adaptive PID control to replace traditional PID control under rated wind speed in variable-pitch wind turbine, which can detect and analyze important aspects, such as unforeseeable conditions, parameters delay and interference in the control process, and conducts online optimal adjustment of PID parameters to fulfill the requirement of variable pitch control system.

Bayesian Optimization Analysis of Containment-Venting Operation in a Boiling Water Reactor Severe Accident

  • Zheng, Xiaoyu;Ishikawa, Jun;Sugiyama, Tomoyuki;Maruyama, Yu
    • Nuclear Engineering and Technology
    • /
    • v.49 no.2
    • /
    • pp.434-441
    • /
    • 2017
  • Containment venting is one of several essential measures to protect the integrity of the final barrier of a nuclear reactor during severe accidents, by which the uncontrollable release of fission products can be avoided. The authors seek to develop an optimization approach to venting operations, from a simulation-based perspective, using an integrated severe accident code, THALES2/KICHE. The effectiveness of the containment-venting strategies needs to be verified via numerical simulations based on various settings of the venting conditions. The number of iterations, however, needs to be controlled to avoid cumbersome computational burden of integrated codes. Bayesian optimization is an efficient global optimization approach. By using a Gaussian process regression, a surrogate model of the "black-box" code is constructed. It can be updated simultaneously whenever new simulation results are acquired. With predictions via the surrogate model, upcoming locations of the most probable optimum can be revealed. The sampling procedure is adaptive. Compared with the case of pure random searches, the number of code queries is largely reduced for the optimum finding. One typical severe accident scenario of a boiling water reactor is chosen as an example. The research demonstrates the applicability of the Bayesian optimization approach to the design and establishment of containment-venting strategies during severe accidents.

A Study on Adaptive Partitioning-based Genetic Algorithms and Its Applications (적응 분할법에 기반한 유전 알고리즘 및 그 응용에 관한 연구)

  • Han, Chang-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.4
    • /
    • pp.207-210
    • /
    • 2012
  • Genetic algorithms(GA) are well known and very popular stochastic optimization algorithm. Although, GA is very powerful method to find the global optimum, it has some drawbacks, for example, premature convergence to local optima, slow convergence speed to global optimum. To enhance the performance of GA, this paper proposes an adaptive partitioning-based genetic algorithm. The partitioning method, which enables GA to find a solution very effectively, adaptively divides the search space into promising sub-spaces to reduce the complexity of optimization. This partitioning method is more effective as the complexity of the search space is increasing. The validity of the proposed method is confirmed by applying it to several bench mark test function examples and the optimization of fuzzy controller for the control of an inverted pendulum.

Optimum design of retaining structures under seismic loading using adaptive sperm swarm optimization

  • Khajehzadeh, Mohammad;Kalhor, Amir;Tehrani, Mehran Soltani;Jebeli, Mohammadreza
    • Structural Engineering and Mechanics
    • /
    • v.81 no.1
    • /
    • pp.93-102
    • /
    • 2022
  • The optimum design of reinforced concrete cantilever retaining walls subjected to seismic loads is an extremely important challenge in structural and geotechnical engineering, especially in seismic zones. This study proposes an adaptive sperm swarm optimization algorithm (ASSO) for economic design of retaining structure under static and seismic loading. The proposed ASSO algorithm utilizes a time-varying velocity damping factor to provide a fine balance between the explorative and exploitative behavior of the original method. In addition, the new method considers a reasonable velocity limitation to avoid the divergence of the sperm movement. The proposed algorithm is benchmarked with a set of test functions and the results are compared with the standard sperm swarm optimization (SSO) and some other robust metaheuristic from the literature. For seismic optimization of retaining structures, Mononobe-Okabe method is employed for dynamic loading conditions and total construction cost of the structure is considered as the single objective function. The optimization constraints include both geotechnical and structural restrictions and the design variables are the geometrical dimensions of the wall and the amount of steel reinforcement. Finally, optimization of two benchmark retaining structures under static and seismic loads using the ASSO algorithm is presented. According to the numerical results, the ASSO may provide better optimal solutions, and the designs obtained by ASSO have a lower cost by up to 20% compared with some other methods from the literature.

A Study on the Optimum Convergence Factor for Adaptive Filters (적응필터를 위한 최적수렴일자에 관한 연구)

  • 부인형;강철호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.49-57
    • /
    • 1994
  • An efficient approach for the computationtion of the optimum convergence factor is proposed for the LMS algorithm applied to a transversal FIR structure in this study. The approach automatically leads to an optimum step size algorithm at each weight in every iteration that results in a dramatic reduction in terms of convergence time. The algorithm is evaluated in system identification application where two alternative computer simulations are considered for time-invariant and time-varying system cases. The results show that the proposed algorithm needs not appropriate convergence factor and has better performance than AGC(Automatic Gain Control) algorithm and Karni algorithm, which require the convergence factors controlled arbitrarily in computer simulation for time-invariant system and time-varying systems. Also, itis shown that the proposed algorithm has the excellent adaptability campared with NLMS(Normalized LMS) algorithm and RLS (Recursive least Square) algorithm for time-varying circumstances.

  • PDF

A Study on the Adaptive Method for Extracting Optimum Features of Speech Signal (음성신호의 최적특징을 적응적으로 추출하는 방법에 관한 연구)

  • 장승관;차태호;최웅세;김창석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.2
    • /
    • pp.373-380
    • /
    • 1994
  • In this paper, we proposed a method of extracting optimum features of speech signal to adjust signal level. For extracting features of speech signal we used FRLS(Fast Recursive Least Square) algorithm, we adjusted each frames of equal to constant level, and extracted optimum features of speech signal by using equalized autocorrelation function proposed in this paper.

  • PDF

Application of adaptive neuro-fuzzy system in prediction of nanoscale and grain size effects on formability

  • Nan Yang;Meldi Suhatril;Khidhair Jasim Mohammed;H. Elhosiny Ali
    • Advances in nano research
    • /
    • v.14 no.2
    • /
    • pp.155-164
    • /
    • 2023
  • Grain size in sheet metals in one of the main parameters in determining formability. Grain size control in industry requires delicate process control and equipment. In the present study, effects of grain size on the formability of steel sheets is investigated. Experimental investigation of effect of grain size is a cumbersome method which due to existence of many other effective parameters are not conclusive in some cases. On the other hand, since the average grain size of a crystalline material is a statistical parameter, using traditional methods are not sufficient for find the optimum grain size to maximize formability. Therefore, design of experiment (DoE) and artificial intelligence (AI) methods are coupled together in this study to find the optimum conditions for formability in terms of grain size and to predict forming limits of sheet metals under bi-stretch loading conditions. In this regard, a set of experiment is conducted to provide initial data for training and testing DoE and AI. Afterwards, the using response surface method (RSM) optimum grain size is calculated. Moreover, trained neural network is used to predict formability in the calculated optimum condition and the results compared to the experimental results. The findings of the present study show that DoE and AI could be a great aid in the design, determination and prediction of optimum grain size for maximizing sheet formability.

Fast Motion Estimation with Adaptive Search Range Adjustment using Motion Activities of Temporal and Spatial Neighbor Blocks (시·공간적 주변 블록들의 움직임을 이용하여 적응적으로 탐색 범위 조절을 하는 고속 움직임 추정)

  • Lee, Sang-Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.372-378
    • /
    • 2010
  • This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.

Adaptive Kernel Estimation for Learning Algorithms based on Euclidean Distance between Error Distributions (오차분포 유클리드 거리 기반 학습법의 커널 사이즈 적응)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.5
    • /
    • pp.561-566
    • /
    • 2021
  • The optimum kernel size for error-distribution estimation with given error samples cannot be used in the weight adjustment of minimum Euclidean distance between error distributions (MED) algorithms. In this paper, a new adaptive kernel estimation method for convergence enhancement of MED algorithms is proposed. The proposed method uses the average rate of change in error power with respect to a small interval of the kernel width for weight adjustment of the MED learning algorithm. The proposed kernel adjustment method is applied to experiments in communication channel compensation, and performance improvement is demonstrated. Unlike the conventional method yielding a very small kernel calculated through optimum estimation of error distribution, the proposed method converges to an appropriate kernel size for weight adjustment of the MED algorithm. The experimental results confirm that the proposed kernel estimation method for MED can be considered a method that can solve the sensitivity problem from choosing an appropriate kernel size for the MED algorithm.