• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2516-2520
• /
• 2005

In this paper, finite impulse response (FIR) smoothers are proposed for discrete-time systems. The proposed FIR smoother is designed under the constraints of linearity, unbiasedness, FIR structure, and independence of the initial state information. It is also obtained by directly minimizing the performance criterion with unbiased constraints. The approach to the MVF smoother proposed in this paper is logical and systematic, while existing results have heuristic assumption, such as infinite covariance of the initial state. Additionally, the proposed MVF smoother is based on the general system model that may have the singular system matrix and has both system and measurement noises. Thorough simulation studies, it is shown that the proposed MVF smoother is more robust against modeling uncertainties numerical errors than fixed-lag Kalman smoother which is infinite impulse response (IIR) type estimator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4950-4966
• /
• 2015

Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2005.06a
• /
• pp.287-292
• /
• 2005

In this paper, a state steering strategy using digital control method for chained system is presented. The chained system can be derived from the velocity or acceleration constraints that cannot be integrable. Especially, the chained system derived from an acceleration constraints is called the high order chained system. Such a system classified as a nonholonomic systems and cannot be controlled to its equilibrium points by continuous and time-invariant controller. Therefore discontinuous and time varying controller should be applied to control nonholonomic system. Using variable transformation, two sub system can be obtained from the chained or high order chained system. Deadbeat control and iterative state steering methods are proposed to control the systems that obtained from the variable transformation. Simulation results are given to show the effectiveness of the proposed control scheme.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2004

This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.29-43
• /
• 2021

In this paper, a new approach to solve the constrained dynamic programming is proposed by using the constraint programming. While the conventional dynamic programming scheme has the state space augmented with states on constraints, this approach, without state augmentation, represents states of constraints as domains in a contraining programming solver. It has a hybrid computational mechanism in its computation by combining solving the Bellman equation in the dynamic programming framework and exploiting the propagation and inference methods of the constraint programming. In order to portray the differences of the two approaches, this paper solves a simple version of the long-term car rental financing problem. In the conventional scheme, data structures for state on constraints are designed, and a simple inference borrowed from the constraint programming is used to the reduction of violation of constraints because no inference risks failure of a solution. In the hybrid approach, the architecture of interface of the dynamic programming solution method and the constraint programming solution method is shown. It finally discusses the advantages of the proposed method with the conventional method.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1114-1116
• /
• 1999

This paper presents a new algorithm which evaluates production cost and reliability indices under various constraints of the thermal generation system. In order to consider the operational constraints of thermal units effectively, the proposed algorithm is based on Monte Carlo techniques instead of analytical ones which have difficulty in modelling the units with additional constraints. At that point, generating units are modelled into two types, base load units and peaking units. These generating unit models are used in state duration sampling simulation for which approach can readily consider the peaking unit operating cycles and easily calculates frequency-duration indices. The proposed production simulation algorithm is applied to the IEEE Reliability Test System, and performs the production simulation under the given constraints. The results show that the proposed algorithm is accurate, reliable and useful.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.9-16
• /
• 2018

Predictive control is a very practical method that obtain the current input that minimizes the future errors of the reference command and state by use of the predictive model of the controlled object, and can also consider the constraints of the state and input. Although there have been studies in which predictive control is applied to mobile robots, performance has not been optimized as various control parameters for determining control performance have been arbitrarily specified. In this paper, we apply the genetic algorithm to the trajectory tracking control of a mobile robot with input constraints in order to minimize the trajectory tracking errors through control parameter tuning, and apply the quadratic programming Hildreth method to reflect the input constraints. Through the computer simulation, the superiority of the proposed method is confirmed by comparing with the existing method.

• Journal of the Korean Society for Railway
• /
• v.13 no.4
• /
• pp.419-424
• /
• 2010

Through the process of state estimation in the electric railway substation, this paper presents a new method for improving the reliability of the measurements corrupted by gauge error. Unlike the case of commercial power systems, it has been difficult to perform the state estimation by using the usual methods in the electric railway substation. At some of the monitoring points in the substation, most often, it is hard to define the measurement functions by use of the states or as we set up a new states set with the change of system topology, some of the measurement functions become part of the states themselves, which leads to poor results. To resolve the problems in the existing method caused by the relations between the states and the measurement functions at the monitoring points, the proposed method in this paper exploits the equality constraints. They can be derived numerously and concisely from the current and the voltage attributes of the Scott transformer and the buses connecting conditions, etc. We have proofed the effectiveness of the proposed method by the test on a standard sample substation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1106-1127
• /
• 2012

Service oriented architecture (SOA) lends itself to model the application components to coarse-grained services in such a way that the composition of different services could be feasible. Service composition fulfills numerous service requirements by constructing composite applications with various services. As it is the case in many real-world applications, different users have diverse QoS demands issuing for composite applications. In this paper, we present a service composition framework for a typical service overlay network (SON) considering both multiple QoS constraints and load balancing factors. Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the proposed algorithm results in an acceptable level of efficiency regarding the service composition objective under different circumstances.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.7 no.1
• /
• pp.142-156
• /
• 2015

A new method for ship Inner Shell optimization, which is called Parametric Inner Shell Optimization Method (PISOM), is presented in this paper in order to improve both hull performance and design efficiency of transport ship. The foundation of PISOM is the parametric Inner Shell Plate (ISP) model, which is a fully-associative model driven by dimensions. A method to create parametric ISP model is proposed, including geometric primitives, geometric constraints, geometric constraint solving etc. The standard optimization procedure of ship ISP optimization based on parametric ISP model is put forward, and an efficient optimization approach for typical transport ship is developed based on this procedure. This approach takes the section area of ISP and the other dominant parameters as variables, while all the design requirements such as propeller immersion, fore bottom wave slap, bridge visibility, longitudinal strength etc, are made constraints. The optimization objective is maximum volume of cargo oil tanker/cargo hold, and the genetic algorithm is used to solve this optimization model. This method is applied to the optimization of a product oil tanker and a bulk carrier, and it is proved to be effective, highly efficient, and engineering practical.