• 대한전기학회논문지
• /
• 제34권7호
• /
• pp.283-288
• /
• 1985

This paper is concerned with the analysis of microprocessor-based PID control for the current source inverter-induction motor derive system. A linearized dynamic model of the motor is derived and is converted into the discrete-time model. With the equation, the overall system including the feedback loops is formulated into a single discrete-time state equation. The stability regions are determined at various values of controller gains. The transient responses of the motor speed are simulated by digital computer and are verified by laboratory experiments.

• 한국CDE학회논문집
• /
• 제17권1호
• /
• pp.45-53
• /
• 2012

In this paper, oil spreading simulation model is proposed for analyzing the oil spreading phenomenon rapidly when the ocean is polluted by the oil from a stranded ship. The space occupied by the ocean is converted into the latticed cell, and the each cell contains the information, such as the quantity of the oil, the temperature of the ocean, and the direction of current and wind. Two states, such as "clean" and "polluted" are defined in the each cell, and the oil in the cell spreads to the neighbor cells by the spreading rules. There are three spreading rules. First, the oil in the certain cell only spreads to the neighbor cells that contain larger oil than the certain cell. Second, the oil evaporates in proportion to the temperature of the ocean at the every time step. Third, the oil spreading property is affected by the direction and the speed of the current and the wind. The oil spreading simulation model of the each cell is defined by using the combined discrete event and discrete time simulation model architecture with the information and the spreading rules in the cell. The oil spreading simulation is performed when the oil of 10,000 kL is polluted in the ocean environment of 300 m by 300 m with various current and wind.

• 한국CDE학회논문집
• /
• 제19권1호
• /
• pp.29-40
• /
• 2014

Conceptual Modeling is the process of abstracting a model from a real or proposed system. It is probably the most important aspect of a simulation study. Relate works show that the elementary developers devoted little time to understanding how the systems actually worked, namely they didn't build appropriate conceptual model. Thus, the result of simulation is inconsistent because it depends on developer's competence. Although many researchers suggested various techniques enabling developer to build conceptual model, there were several limitations. In this study, to overcome the limitations of existing techniques, we proposed COMBINE-DES (COnceptual Model BuildINg framEwork using ontology for Discrete Event Simulation). The COM-BINE-DES supports expediting the conceptual modeling with Solution ontology generated by Domain ontology and Simulation ontology. Moreover, it provides consistent simulation result regardless of repeated modeling.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.128-147
• /
• 1991

We propose a dynamic incidence matrix (DIM) for reflecting states and time conditions of a timed Petri net (TPN) explicitly. Since a DIM consists of a conventional incidence matrix, two time-related vectors and two state-related vectors, we can get the advantages inherent in the conventional incidence matrix of describing a static structure of a system as well as another advantage of expressing time dependent state transitions. We introduce an algorithm providing the DIM with a state transition mechanism. Because the algorithm is, in fact, an algorithmic model for discrete event simulation of TPN models, we provide a theoretical basis of model transformation of a TPN model into a DEVS(Discrete Event system Specification) model. By executing the algorithm we can carry out performance analysis of computer communication protocols which are represented TPN models.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.581-585
• /
• 1992

A unified approach to continuous and discrete-time Nehari problems, based on recently developed results by the authors for the one-block and Hankel-norm model reduction problems, is proposed. First, we derive discrete-time solutions in delta domain where numerical error is small and then we show that the derived form becomes same as the continuous form when the sampling interval approaches to zero.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.176-176
• /
• 2000

Generally, discrete-time processing is applied to the uniformly-sampled signals. But, radars emit pulse trains with irregular time instances. In this paper, we formulate the radar pulse train as a stochastic discrete-time dynamic linear model. The estimation task can be done via linear signal processing using Kalman Filter and some considerations. As a result, we can estimate the pulse repetition interval of a pulse train and predict the time instances of the next pulses to be received.

• Smart Structures and Systems
• /
• 제20권4호
• /
• pp.483-498
• /
• 2017

Real-Time Hybrid Simulation (RTHS) is a powerful and cost-effective dynamic experimental technique. To implement a stable and accurate RTHS, time delay present in the experiment loop needs to be compensated. This delay is mostly introduced by servo-hydraulic actuator dynamics and can be reduced by applying appropriate compensators. Existing compensators have demonstrated effective performance in achieving good tracking performance. Most of them have been focused on their application in cases where the structure under investigation is subjected to inputs with relatively low frequency bandwidth such as earthquake excitations. To advance RTHS as an attractive technique for other engineering applications with broader excitation frequency, a discrete-time feedforward compensator is developed herein via various optimization techniques to enhance the performance of RTHS. The proposed compensator is unique as a discrete-time, model-based feedforward compensator. The feedforward control is chosen because it can substantially improve the reference tracking performance and speed when the plant dynamics is well-understood and modeled. The discrete-time formulation enables the use of inherently stable digital filters for compensator development, and avoids the error induced by continuous-time to discrete-time conversion during the compensator implementation in digital computer. This paper discusses the technical challenges in designing a discrete-time compensator, and proposes several optimal solutions to resolve these challenges. The effectiveness of compensators obtained via these optimal solutions is demonstrated through both numerical and experimental studies. Then, the proposed compensators have been successfully applied to RTHS tests. By comparing these results to results obtained using several existing feedforward compensators, the proposed compensator demonstrates superior performance in both time delay and Root-Mean-Square (RMS) error.

• 산업경영시스템학회지
• /
• 제27권2호
• /
• pp.102-113
• /
• 2004

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of vehicle is determined. A distribution system is consisted of a distribution center and many retailers. The model is assumed that the time horizon is discrete and finite, and the demand of retailers is dynamic and deterministic. Products are transported from distribution center to retailers according to transportation planning. Cost factors are the transportation cost and the inventory cost, which transportation cost is proportional to transportation distance of vehicle when products are transported from distribution center to retailers, and inventory cost is proportional to inventory amounts of retailers. Transportation time to retailers is represented as a genetic string. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. A mathematical model is developed. Genetic algorithm procedure is suggested, and a illustrative example is shown to explain the procedure.

• 산업경영시스템학회지
• /
• 제43권1호
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• 한국멀티미디어학회논문지
• /
• 제19권1호
• /
• pp.22-29
• /
• 2016

Hidden Markov Model is one of the most successful and popular tools for modeling real world sequential data. Real world signals come in a variety of shapes and variabilities, among which temporal and spectral ones are the prime targets that the HMM aims at. A new problem that is gaining increasing attention is characterizing missing observations in incomplete data sequences. They are incomplete in that there are holes or omitted measurements. The standard HMM algorithms have been developed for complete data with a measurements at each regular point in time. This paper presents a modified algorithm for a discrete HMM that allows substantial amount of omissions in the input sequence. Basically it is a variant of Baum-Welch which explicitly considers the case of isolated or a number of omissions in succession. The algorithm has been tested on online handwriting samples expressed in direction codes. An extensive set of experiments show that the HMM so modeled are highly flexible showing a consistent and robust performance regardless of the amount of omissions.