• International Journal of Control, Automation, and Systems
• /
• 제6권2호
• /
• pp.194-203
• /
• 2008

Iterative learning control (ILC) is a simple and effective method for the control of systems that perform the same task repetitively. ILC algorithm uses the repetitiveness of the task to track the desired trajectory. In this paper, we propose a PID (proportional plus integral and derivative) type ILC update law for control discrete-time single input single-output (SISO) linear time-invariant (LTI) systems, performing repetitive tasks. In this approach, the input of controlled system in current cycle is modified by applying the PID strategy on the error achieved between the system output and the desired trajectory in a last previous iteration. The convergence of the presented scheme is analyzed and its convergence condition is obtained in terms of the PID coefficients. An optimal design method is proposed to determine the PID coefficients. It is also shown that under some given conditions, this optimal iterative learning controller can guarantee the monotonic convergence. An illustrative example is given to demonstrate the effectiveness of the proposed technique.

• Advances in Computational Design
• /
• 제5권3호
• /
• pp.233-260
• /
• 2020

The main purpose to introduce model based controller in proposed control technique is to provide better and fast learning of the floating dynamics by means of fuzzy logic controller and also cancelling effect of nonlinear terms of the system. An iterative adaptive dynamic programming algorithm is proposed to deal with the optimal trajectory-tracking control problems for autonomous underwater vehicle (AUV). The optimal tracking control problem is converted into an optimal regulation problem by system transformation. Then the optimal regulation problem is solved by the policy iteration adaptive dynamic programming algorithm. Finally, simulation example is given to show the performance of the iterative adaptive dynamic programming algorithm.

• 한국자동차공학회논문집
• /
• 제7권8호
• /
• pp.208-215
• /
• 1999

Using the orthogonal arrays and the occupant analysis software based on the multi-body dynamics , two interactive design algorithms are proposed to improve the initial design of the occupant protection systems. Algorithm 1 sequentially moves the narrow design space within the upper and the lower design limit. Algorithm 2 sequentially reduces the relatively wide design space. Each design algorithm is composed of two levels . The first level is to improve the characteristics of the crash performance considering the noise factors. In order to obtain the robust design, the second level reduces the variations the noise factors. In order to obtain the robust design, the second level reduces the variations due to the tolerance of the design variable. To utilize the algorithm 1, HIC(Head Injury Criterion) , 3 msec criterion value of the chest acceleration and the femur load decreased by 27.4%, 10.4% and 55.8%, respectively. To utilizer the algorithm 2 , the results decreased by 38.0%, 10.5% and 3.0% , respectively.

• 제어로봇시스템학회논문지
• /
• 제4권3호
• /
• pp.295-300
• /
• 1998

In this paper, we point out the possibility of the divergence of control input caused by the estimation error of delay-time when general iterative learning algorithms are applied to a class of linear dynamic systems with time-delay in which delay-time is not exactly measurable, and then propose a new type of iterative learning algorithm in order to solve this problem. To resolve the uncertainty of delay-time, we propose an algorithm using holding mechanism which has been used in digital control system and/or discrete-time control system. The control input is held as constant value during the time interval of which size is that of the delay-time uncertainty. The output of the system tracks a given desired trajectory at discrete points which are spaced auording to the size of uncertainty of delay-time with the robust property for estimation error of delay-time. Several numerical examples are given to illustrate the effeciency of the proposed algorithm.

• 전자공학회논문지A
• /
• 제33A권10호
• /
• pp.81-89
• /
• 1996

In this paper, a very efficient CAD algorithm is proposedd where rhodes formulae combined with distributed lowpass prototype filter in order to design the corrugated waveguide harmonic rejection filters accurately. The proposed algorithm resolves effectively the problem of proximity effect without any optimiation or iterative design process by using the internally convexed corrugated structure. A 13-section tapered corrugated lowpass filter has been designed by the proposed algorithm and fabricated. The experimental results are in good agreement with the calculated results.

• Journal of Electrical Engineering and Technology
• /
• 제4권3호
• /
• pp.423-428
• /
• 2009

In FIR (Finite Impulse Response) filter applications, Nth-band FIR digital filters are known to be important due to their reduced computational requirements. The conventional methods for designing FIR filters use iterative approaches such as the well-known Parks-McClellan algorithm. The Parks-McClellan algorithm is also used to design Nth-band FIR digital filters after Mintzer's research. However, a disadvantage of the Parks-McClellan algorithm is that it needs a large amount of design time. This paper describes a direct design method for Nth-band FIR Filters using Chebyshev polynomials, which provides a reduced design time over indirect methods such as the Parks-McClellan algorithm. The response of the resulting filter is equi-ripple in passband. Our proposed method produces a passband response that is equi-ripple to within a minuscule error, comparable to that of Mintzer's design method which uses the Parks-McClellan algorithm.

• 동력기계공학회지
• /
• 제9권4호
• /
• pp.202-208
• /
• 2005

The genetic algorithm (GA) which is one of the popular optimum algorithm has been used to solve a variety of optimum problems. Because it need not require the gradient of objective function and is easier to find global solution than gradient-based optimum algorithm using the gradient of objective function. However optimum method using the GA and the finite element method (FEM) takes many computational time to solve the optimum structural design problem which has a great number of design variables, constraints, and system with many degrees of freedom. In order to overcome the drawback of the optimum structural design using the GA and the FEM, the author developed a computer program which can optimize frame structures by using the GA and the generalized transfer stiffness coefficient method. In order to confirm the effectiveness of the developed program, it is applied to optimum design of plane frame structures. The computational results by the developed program were compared with those of iterative design.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권9호
• /
• pp.570-576
• /
• 2005

In FIR (Finite Impulse Response) filter applications, Nth-band FIR digital filters are known to be important due to their reduced computational requirements. The conventional methods for designing FIR filters use iterative approaches such as the well-known Parks-Mcclellan algorithm. the Parks-Mcclellan algorithm is also used to design Nth-band FIR digital filters. But a disadvantage of the Parks-McClellan algorithm Is that it needs a good amount of design time. This paper describes a direct design method for third-band FIR Filters using Chebyshev polynomial, which provide a reduction in design time over indirect methods such as the Parks-McClellan algorithm. The response of the resulting filter is equi-ripple in passband. The proposed method of design produces a passband response that is equi-ripple to within a minuscule error, compare to that of the Parks-McClellan algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(2)
• /
• pp.117-120
• /
• 2002

In this paper, we construct cryptographic accelerators using hardware Implementations of HMACS based on a hash algorithm such as MD5.It is basically a secure version of his previous algorithm, MD4 which is a little faster than MD5 The algorithm takes as Input a message of arbitrary length and produces as output a 128-blt message digest The input is processed In 512-bit blocks In this paper, new architectures, Iterative and full loop, of MD5 have been implemented using Field Programmable Gate Arrays(FPGAS). For the full-loop design, the performance Is about 500Mbps @ 100MHz

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권10호
• /
• pp.630-638
• /
• 2005

In FIR (Finite Impulse Response) filter applications, Nth-band F]U digital filters are known to be important due to their reduced computational requirements. The conventional methods for designing F]U filters use iterative approaches such as the well-known Parks-Mcclellan algorithm. The Parks-Mcclellan algorithm is also used to design Nth-band FIR digital filters. But a disadvantage of the Parks-Mcclellan algorithm is that it needs a good amount of design time. This paper describes a direct design method for Nth-band FIR Filters using Chebyshev polynomials, which provides a reduced design time over indirect methods such as the Parks-Mcclellan algorithm. The response of the resulting filter is equiripple in passband. Our proposed method produces a passband response that is equripple to within a minuscule error, comparable to that of the Parks-Mcclellan algorithm.