• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1990년도 하계학술대회 논문집
• /
• pp.64-67
• /
• 1990

A parallel processing algorithm for discrete Kalman filter, which is one of the most commonly used filtering technique in modern control, signal processing, and communication. is proposed. Previously proposed parallel algorithms to decrease the number of computations needed in the Kalman filter are the hierachical structures by distributed processing of measurements, or the systolic structures to disperse the computational burden. In this paper, a new parallel Kalman filter employing a structure similar to recursive doubling is proposed. Estimated values of state variables by the new algorithm converge with two times faster data processing speed than that of the conventional Kalman filter. Moreover it maintains the optimality of the conventional Kalman filter.

• International Journal of Aeronautical and Space Sciences
• /
• 제11권4호
• /
• pp.351-359
• /
• 2010

This paper proposes a linear system control algorithm with collision avoidance in multiple satellites. Consideration of collision avoidance is augmented by adding a weighting term in the cost function of the original tracking problem in linear quadratic control (LQC). Because the proposed algorithm relies on a similar solution procedure to the original LQC, its inherent advantages, including gain-robustness and optimality, are preserved. To confirm and visualize the derived algorithm, a simple example of two-vehicle motion in the two-dimensional plane is illustrated. In addition, the proposed collision avoidance control is applied to satellite formation flying, and verified by numerical simulations.

• International Journal of Aeronautical and Space Sciences
• /
• 제7권1호
• /
• pp.65-72
• /
• 2006

A variable structure controller with an optimized sliding surface is proposed for slew maneuver of a rigid spacecraft. Rodrigues parameters are chosen to represent the spacecraft attitude. The quadratic type of performance index is used to design the sling surface. For optimization of the sliding surface, a Hamilton- Jacobi-Bellman equation is formulated and it is solved through the numerical algorithm using Galerkin approximation. The solution denotes a nonlinear sliding surface, on which the trajectory of the system satisfies the optimality condition approximately. Simulation result demonstrates that the proposed controller is effectively applied to the slew maneuver of a rigid spacecraft.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1416-1424
• /
• 1996

The problem of optimaizing multiframe targe detection (MFTD) performance si discussed. The MFTD problem is treated as a multiple hypothesis desision problem, and a ne optimality criterion for the MFTD problem is established. It is of Neyman-Pearson (NP) type which is extended to multiple hypothesis cases. An optimal solution with respect tot eh established criterion is derived, and also proposed is a suboptimal solution which reduces the compelexity accompanying the optimal one. The trade-off between the reduction of complexity and the amount of loss in the detection performance is also studied. The proposed algorithm is applied to an active sonar system and the performance is evaluated via Monte-Carlo simulations.

• 인문언어
• /
• 제5권
• /
• pp.221-264
• /
• 2003

This paper takes issue with the idea of language as a 'serial-time structure' as opposed to the 'real-time event' of speech, an idea entrenched in Chomskyan model of linguistic theory. The discussion centers around the leitmotif question: Is language constructed entirely from a finite set of apriori discrete symbol types, as the 'competence vs performance' dichotomy implies\ulcorner A set of linguistic patterns examined in this study, largely with regard to phonological considerations, points to the evidence to the contrary. That is, while the patterns may be said to be linguistically distinct, they are not discretely, different, i.e. not different enough to be reliably differentiated. It is demonstrated that much of current research in phonology, including the most recent Optimality Theory, is misdirected in that it falsely presupposes a discrete universal phonetic inventory. The main thrust of the present study is that there is no sharp boundary between 'competence' defined as the formal, symbolic, discrete time domain of language and human cognition on the one hand and 'performance' as the continuous, fuzzy, real-time domain of human physiology on the other.

• 산업경영시스템학회지
• /
• 제18권34호
• /
• pp.61-67
• /
• 1995

Through the model presented in this paper, we study on the depletion of stock taking place due to random loss of items as well as random demand, under the assumption that the distributions of demand are independent of those of loss, and both of them are identical, and that life time distribution of each item is negative exponential. The steady state probability distribution of the stock level assuming instantaneous delivery of order under (s, S) inventory policy. Also we have derived total expected cost expression with loss cost. The results of sensitive analysis show that the effect of loss rate is substantial on the total cost and optimal value of inventory level.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.63-71
• /
• 2009

The traditional portfolio optimization problem is to find an investment plan for securities with reasonable trade-off between the rate of return and the risk. The seminal work in this field is the mean-variance model by Markowitz, which is a quadratic programming problem. Since it is now computationally practical to solve the model, a number of alternative models to overcome this complexity have been proposed. In this paper, among the alternatives, we focus on the Mean Absolute Deviation (MAD) model. More specifically, we developed an algorithm to obtain an optimal portfolio from the MAD model. We showed mathematically that the algorithm can solve the problem to optimality. We tested it using the real data from the Korean Stock Market. The results coincide with our expectation that the method can solve a variety of problems in a reasonable computational time.

• 한국정보통신학회논문지
• /
• 제6권1호
• /
• pp.1-5
• /
• 2002

디지털 제어시스템을 설계하려면, 먼저 아날로그 시스템을 설계한 후, 이산화하여 디지털 시스템을 설계한다. 본 논문에서는 최적 디지털 제어기의 선계에 샘플치 제어이론을 적용한다. 특히, 아날로그 제어기들의 멀티레이트 이산화에 Η$_2$최적화를 이용한다. 멀티레이트 구조상 인과성 제약을 갖는 멀티레이트 Η$_2$최적화를 통해 해를 얻는다. 설계 예제를 통해, 기존 이산화 방법과 비교하여, 멀티레이트 설계방법의 우수성을 확인한다.

• 한국군사과학기술학회지
• /
• 제10권3호
• /
• pp.161-172
• /
• 2007

This article suggests an inverse kinematics analysis of a two degree of freedom spatial parallel motion simulator and design methodology of the robust PID controller. The parallel motion simulator consists of a fixed base and a moving frame connected by two serial chains, with each serial chain containing one revolute joint and two passive spherical joint. First, an inverse kinematics problems are solved in order to find the joint variable necessary to bring the end effector to track the desired trajectory. Second, an inverse optimal PID controller is proposed to track trajectories in the face of uncertainty. And the $H_{\infty}$ optimality and robust stability of the closed-loop system is acquired through the PID controller. Finally numerical results show the effectiveness of the PID controller that is designed by square/linear tuning laws.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (B)
• /
• pp.568-570
• /
• 2004

The error-backpropagation (EBP) algerithm for training multilayer perceptrons (MLPs) is known to have good features of robustness and economical efficiency. However, the algorithm has difficulty in selecting an optimal constant learning rate and thus results in non-optimal learning speed and inflexible operation for working data. This paper Introduces an elastic learning rate that guarantees convergence of learning and its local realization by online upoate of MLP parameters Into the original EBP algorithm in order to complement the non-optimality. The results of experiments on a speaker verification system with Korean speech database are presented and discussed to demonstrate the performance improvement of the proposed method in terms of learning speed and flexibility fer working data of the original EBP algorithm.