• Title/Summary/Keyword: Iterative scheme

Search Result 544, Processing Time 0.026 seconds

Study on Steering Ratio of Four-Row Rigid Tracked Vehicle on Extremely Cohesive Soft Soil Using Numerical Simulation (수치해석을 이용한 연약지반 4열 강체 무한궤도 차량의 최적 선회비 연구)

  • Kim, Hyung-Woo;Lee, Chang-Ho;Hong, Sup;Choi, Jong-Su;Yeu, Tae-Kyeong;Min, Cheon-Hong
    • Journal of Ocean Engineering and Technology
    • /
    • v.27 no.6
    • /
    • pp.81-89
    • /
    • 2013
  • This paper considers the steering characteristics of a four-row tracked vehicle crawling on extremely cohesive soft soil, where each side is composed of two parallel tracks. The four-row tracked vehicle (FRTV) is assumed to be a rigid body with 6-DOF. A dynamic analysis program for the tracked vehicle is developed using the Newmark-${\beta}$ method based on an incremental-iterative scheme. A terra-mechanics model of an extremely cohesive soft soil is implemented in the form of the relationships of the normal pressure to the sinkage, the shear resistance to the shear displacement, and the dynamic sinkage to the shear displacement. In order to investigate the steering characteristics of the four-row tracked vehicle, a series of dynamic simulations is conducted with respect to the distance between the left and right tracks (pitch), steering ratios, driving velocity, reference track velocity, lengths of the tracks, and properties of the cohesive soft soil. Through these numerical simulations, the possibility of using a kinematic steering ratio is explored.

New Motor Parameter Estimation Method of Surface-mounted Permanent Magnet Motors (표면 부착형 영구자석 전동기의 새로운 상수 추정 방법)

  • Lee, Dong-Myung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.4
    • /
    • pp.517-522
    • /
    • 2019
  • This paper proposes a new motor parameter estimation method. Because the proposed method is based on difference equations, it does not affect the error in the voltage magnitude so called dead-time effect. Information on the motor constant may be needed to improve the motor control performance. For example, a control technique called DTC (Direct Torque Control) requires a motor constant when calculating the torque and flux magnitude. As another example, in the case of predictive control, information on the motor parameters is required to generate voltage references. Because the constant of the motor fluctuates according to the driving environment, it is essential to estimate the correct motor constant because the control performance is degraded when incorrect motor information is used. In the proposed scheme, the motor constant estimated based on the voltage difference equation is obtained using the RLS (Recursive Least Square) technique. The RLS algorithm is applied to obtain the value through an iterative calculation so that the estimation performance is robust to noise. The simulation results carried out with surface mounted permanent magnet motors confirmed the validity of the proposed method.

APPROXIMATION OF COMMON FIXED POINTS OF NON-SELF ASYMPTOTICALLY NONEXPANSIVE MAPPINGS

  • Kim, Jong-Kyu;Dashputre, Samir;Diwan, S.D.
    • East Asian mathematical journal
    • /
    • v.25 no.2
    • /
    • pp.179-196
    • /
    • 2009
  • Let E be a uniformly convex Banach space and K a nonempty closed convex subset which is also a nonexpansive retract of E. For i = 1, 2, 3, let $T_i:K{\rightarrow}E$ be an asymptotically nonexpansive mappings with sequence ${\{k_n^{(i)}\}\subset[1,{\infty})$ such that $\sum_{n-1}^{\infty}(k_n^{(i)}-1)$ < ${\infty},\;k_{n}^{(i)}{\rightarrow}1$, as $n{\rightarrow}\infty$ and F(T)=$\bigcap_{i=3}^3F(T_i){\neq}{\phi}$ (the set of all common xed points of $T_i$, i = 1, 2, 3). Let {$a_n$},{$b_n$} and {$c_n$} are three real sequences in [0, 1] such that $\in{\leq}\;a_n,\;b_n,\;c_n\;{\leq}\;1-\in$ for $n{\in}N$ and some ${\in}{\geq}0$. Starting with arbitrary $x_1{\in}K$, define sequence {$x_n$} by setting {$$x_{n+1}=P((1-a_n)x_n+a_nT_1(PT_1)^{n-1}y_n)$$ $$y_n=P((1-b_n)x_n+a_nT_2(PT_2)^{n-1}z_n)$$ $$z_n=P((1-c_n)x_n+c_nT_3(PT_3)^{n-1}x_n)$$. Assume that one of the following conditions holds: (1) E satises the Opial property, (2) E has Frechet dierentiable norm, (3) $E^*$ has Kedec -Klee property, where $E^*$ is dual of E. Then sequence {$x_n$} converges weakly to some p${\in}$F(T).

RSM-based Probabilistic Reliability Analysis of Axial Single Pile Structure (축하중 단말뚝구조물의 RSM기반 확률론적 신뢰성해석)

  • Huh Jung-Won;Kwak Ki-Seok
    • Journal of the Korean Geotechnical Society
    • /
    • v.22 no.6
    • /
    • pp.51-61
    • /
    • 2006
  • An efficient and accurate hybrid reliability analysis method is proposed in this paper to quantify the risk of an axially loaded single pile considering pile-soil interaction behavior and uncertainties in various design variables. The proposed method intelligently integrates the concepts of the response surface method, the finite difference method, the first-order reliability method, and the iterative linear interpolation scheme. The load transfer method is incorporated into the finite difference method for the deterministic analysis of a single pile-soil system. The uncertainties associated with load conditions, material and section properties of a pile and soil properties are explicitly considered. The risk corresponding to both serviceability limit state and strength limit state of the pile and soil is estimated. Applicability, accuracy and efficiency of the proposed method in the safety assessment of a realistic pile-soil system subjected to axial loads are verified by comparing it with the results of the Monte Carlo simulation technique.

New Beamforming Schemes with Optimum Receive Combining for Multiuser MIMO Downlink Channels (다중사용자 다중입출력 하향링크 시스템을 위한 최적 수신 결합을 이용한 새로운 빔 형성 기법)

  • Lee, Sang-Rim;Park, Seok-Hwan;Moon, Sung-Hyun;Lee, In-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.8
    • /
    • pp.15-26
    • /
    • 2011
  • In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a block-diagonalization (BD) algorithm has been proposed for the multiuser MIMO downlink where both a base station and each user have multiple antennas. However, the BD algorithm is not efficient when the number of supported streams per user is smaller than that of receive antennas. Since the BD method utilizes the space based on the channel matrix without considering the receive combining, the degree of freedom for beamforming cannot be fully exploited at the transmitter. In this paper, we optimize the receive beamforming vector under a zero forcing (ZF) constraint, where all inter-user interference is driven to zero. We propose an efficient algorithm to find the optimum receive vector by an iterative procedure. The proposed algorithm requires two phase values feedforward information for the receive combining vector. Also, we present another algorithm which needs only one phase value by using a decomposition of the complex general unitary matrix. Simulation results show that the proposed beamforming scheme outperforms the conventional BD algorithm in terms of error probability and obtains the diversity enhancement by utilizing the degree of freedom at the base station.

Evaluating Reverse Logistics Networks with Centralized Centers : Hybrid Genetic Algorithm Approach (집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법)

  • Yun, YoungSu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.55-79
    • /
    • 2013
  • In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

An Iterative, Interactive and Unified Seismic Velocity Analysis (반복적 대화식 통합 탄성파 속도분석)

  • Suh Sayng-Yong;Chung Bu-Heung;Jang Seong-Hyung
    • Geophysics and Geophysical Exploration
    • /
    • v.2 no.1
    • /
    • pp.26-32
    • /
    • 1999
  • Among the various seismic data processing sequences, the velocity analysis is the most time consuming and man-hour intensive processing steps. For the production seismic data processing, a good velocity analysis tool as well as the high performance computer is required. The tool must give fast and accurate velocity analysis. There are two different approches in the velocity analysis, batch and interactive. In the batch processing, a velocity plot is made at every analysis point. Generally, the plot consisted of a semblance contour, super gather, and a stack pannel. The interpreter chooses the velocity function by analyzing the velocity plot. The technique is highly dependent on the interpreters skill and requires human efforts. As the high speed graphic workstations are becoming more popular, various interactive velocity analysis programs are developed. Although, the programs enabled faster picking of the velocity nodes using mouse, the main improvement of these programs is simply the replacement of the paper plot by the graphic screen. The velocity spectrum is highly sensitive to the presence of the noise, especially the coherent noise often found in the shallow region of the marine seismic data. For the accurate velocity analysis, these noise must be removed before the spectrum is computed. Also, the velocity analysis must be carried out by carefully choosing the location of the analysis point and accuarate computation of the spectrum. The analyzed velocity function must be verified by the mute and stack, and the sequence must be repeated most time. Therefore an iterative, interactive, and unified velocity analysis tool is highly required. An interactive velocity analysis program, xva(X-Window based Velocity Analysis) was invented. The program handles all processes required in the velocity analysis such as composing the super gather, computing the velocity spectrum, NMO correction, mute, and stack. Most of the parameter changes give the final stack via a few mouse clicks thereby enabling the iterative and interactive processing. A simple trace indexing scheme is introduced and a program to nike the index of the Geobit seismic disk file was invented. The index is used to reference the original input, i.e., CDP sort, directly A transformation techinique of the mute function between the T-X domain and NMOC domain is introduced and adopted to the program. The result of the transform is simliar to the remove-NMO technique in suppressing the shallow noise such as direct wave and refracted wave. However, it has two improvements, i.e., no interpolation error and very high speed computing time. By the introduction of the technique, the mute times can be easily designed from the NMOC domain and applied to the super gather in the T-X domain, thereby producing more accurate velocity spectrum interactively. The xva program consists of 28 files, 12,029 lines, 34,990 words and 304,073 characters. The program references Geobit utility libraries and can be installed under Geobit preinstalled environment. The program runs on X-Window/Motif environment. The program menu is designed according to the Motif style guide. A brief usage of the program has been discussed. The program allows fast and accurate seismic velocity analysis, which is necessary computing the AVO (Amplitude Versus Offset) based DHI (Direct Hydrocarn Indicator), and making the high quality seismic sections.

  • PDF

FEM-based Seismic Reliability Analysis of Real Structural Systems (실제 구조계의 유한요소법에 기초한 지진 신뢰성해석)

  • Huh Jung-Won;Haldar Achintya
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.19 no.2 s.72
    • /
    • pp.171-185
    • /
    • 2006
  • A sophisticated reliability analysis method is proposed to evaluate the reliability of real nonlinear complicated dynamic structural systems excited by short duration dynamic loadings like earthquake motions by intelligently integrating the response surface method, the finite element method, the first-order reliability method, and the iterative linear interpolation scheme. The method explicitly considers all major sources of nonlinearity and uncertainty in the load and resistance-related random variables. The unique feature of the technique is that the seismic loading is applied in the time domain, providing an alternative to the classical random vibration approach. The four-parameter Richard model is used to represent the flexibility of connections of real steel frames. Uncertainties in the Richard parameters are also incorporated in the algorithm. The laterally flexible steel frame is then reinforced with reinforced concrete shear walls. The stiffness degradation of shear walls after cracking is also considered. The applicability of the method to estimate the reliability of real structures is demonstrated by considering three examples; a laterally flexible steel frame with fully restrained connections, the same steel frame with partially restrained connections with different rigidities, and a steel frame reinforced with concrete shear walls.

A New Resource Allocation with Rate Proportionality Constraints in OFDMA Systems (OFDMA 시스템에서 비율적 전송률 분배를 위한 자원 할당)

  • Han, Seung-Youp;Oh, Eun-Sung;Han, Myeong-Su;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.59-65
    • /
    • 2008
  • In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.

A New SPW Scheme for PAPR Reduction in OFDM Systems by Using Genetic Algorithm (유전자 알고리즘을 적용한 SPW에 의한 새로운 OFDM 시스템 PAPR 감소 기법)

  • Kim Sung-Soo;Kim Myoung-Je;Kee Jong-Hae
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.11 s.102
    • /
    • pp.1131-1137
    • /
    • 2005
  • An orthogonal frequency division multiplexing(OFDM) system has the problem of peak-to-average power ratio (PAPR) due to the overlapping phenomena of many sub-carriers. In order to improve the performance of PAPR, we propose in this paper a new genetic sub-block phase weighting(GA-SPW) using the SPW technique. Not only the selecting mapping(SLM) and the partial sequence(PTS) but also the previously proposed SPW becomes more effective as the number of sub-blocks and phase elements increases. However, all of them have limitation on the number of sub-blocks since the searching repetition increases exponentially as the number of sub-blocks increases. Therefore, in this research, a new GA SPW is proposed to reduce the amount of calculation by using Genetic algorithm(GA). In the proposed method, the number of calculations involved in the iterative phase searching yields to depend on the number of population and generation not on the number of sub-blocks and phase elements. The superiority of the proposed method is presented in the experimental results and analysis.