• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.777-780
• /
• 1995

Accounting for actuator nonlinearities in control loops has often been perceived as an implementation issue and usually excluded in the design of controllers. Nonlinearities treated in this paper are saturation, and they are modelled as an inequality constraint. The CRHPC(Constrained Receding Horizon Predictive Control) with inequality constraints algorithm is used to handle actuator rate and amplitude limits simultaneously or respectively. Optimum values of future control signals are obtained by quadratic programming. Simulated examples show that predictive control law with inequality constraints offers good performance as compared with input clipping.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2529-2547
• /
• 2012

In this paper, we use a quadrotor-based mobile sink to gather sensor data from the terrestrial deployed wireless sensor network. By analyzing the flight features of the mobile sink node, we theoretically study the flight constraints of height, velocity, and trajectory of the mobile sink node so as to communicate with the terrestrial wireless sensor network. Moreover, we analyze the data amount which the mobile sink can send when it satisfies these flight constraints. Based on these analysis results, we propose a data acquisition approach for the mobile sink node, which is discussed detailed in terms of network performance such as the transmission delay, packet loss rate, sojourning time and mobile trajectory when given the flying speed and height of the mobile sink node. Extensive simulation results validate the efficiency of the proposed scheme.

• Journal of Advanced Marine Engineering and Technology
• /
• v.26 no.4
• /
• pp.415-424
• /
• 2002

In this paper, a robust fuzzy precompensated PID controller using immune algorithm for load frequency control of 2-area power system is proposed. Here, a fuzzy precompensated PID controller is designed as a fuzzy logic based precompensation approach for PID controller. This scheme is easily implemented by adding a fuzzy precompensator to an existing PID controller. We optimize the fuzzy precompensator with an immune algorithm for complementing the demerit such as the difficulty of the component selection of fuzzy controller, namely, scaling factor, membership function and fuzzy rules. Simulation results show that the proposed robust load frequency controller can achieve good performance even in the presence of generation rate constraints.

• Journal of Power System Engineering
• /
• v.3 no.4
• /
• pp.63-68
• /
• 1999

The determination of the optimal machining parameters in metal cutting, such as cutting speed, feed rate, and depth of cut, is an important aspect in an economic manufacturing process. The main objective in general is either to minimize the production cost or to maximize the production rate. Also there are constraints on all the machining operations which put restrictions on the choice of the machining parameters. In this paper as an objective function the production cost is considered with two constraints, surface finish and cutting power. Genetic Algorithm is applied to determine the optimum machining parameters, and the effectiveness of the applied algorithm is demonstrated by means of an example, turning operation.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.3
• /
• pp.320-330
• /
• 2008

This paper presents an improved dynamic programming (IDP) approach to solve the economic power dispatch problem including transmission losses in power systems. A detailed mathematical derivation of recursive dynamic programming approach for the economic power dispatch problem with transmission losses is presented. The transmission losses are augmented with the objective function using price factor. The generalized expression for optimal scheduling of thermal generating units derived in this article can be implemented for the solution of the economic power dispatch problem of a large-scale system. Six-unit, fifteen-unit, and forty-unit sample systems with non-linear characteristics of the generator, such as ramp-rate limits and prohibited operating zones are considered to illustrate the effectiveness of the proposed method. The proposed method results have been compared with the results of genetic algorithm and particle swarm optimization methods reported in the literature. Test results show that the proposed IDP approach can obtain a higher quality solution with better performance.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.823-832
• /
• 2013

We present a new algorithm for solving a system of nonlinear equations with convex constraints which combines proximal point and projection methodologies. Compared with the existing projection methods for solving the problem, we use a different system of linear equations to obtain the proximal point; and moreover, at the step of getting next iterate, our projection way and projection region are also different. Based on the Armijo-type line search procedure, a new hyperplane is introduced. Using the separate property of hyperplane, the new algorithm is proved to be globally convergent under much weaker assumptions than monotone or more generally pseudomonotone. We study the convergence rate of the iterative sequence under very mild error bound conditions.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.6 no.4
• /
• pp.1-8
• /
• 1998

In order to solve the conflict problem between the ride comfort and the road holding, the optimal design of shock absorber that minimizes the r.m.s. of sprung mass vertical acceleration and pitch rate with the understeer characteristics constraints in the high speed stability is proposed. The design of experiments and the nonlinear optimization algorithm are used together to obtain the optimal design of shock absorber. The second order regression models of the input variables(front and rear damping coefficients) and the output variables (ride comfort index and road holding one) are obtained by the central composite design in the design of experiments. Then the optimal design of shock absorber can be systematically adjusted with applying the nonlinear optimization algorithm to the obtained second order regression model. The frequency response analysis of sprung mass acceleration and pitch rate shows the effectiveness of the proposed optimal design of shock absorber in the sprung mass resonance range with the understeer characteristics constraints.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.93-98
• /
• 2003

This paper addresses an AGV dispatching problem in semiconductor clean-room bays where AGVs move cassettes of wafers between machines or machines and a central buffer. Since each machine in a bay has a local buffer of limited capacity, material flow should be controlled in a careful way to maintain high system performance. It is regarded that two most important performance measures in a semiconductor bay are throughput rate and lead-time. The throughput rate is determined by a bottleneck resource and the lead-time depends on smooth material flow in the system. This paper presents an AGV dispatching procedure based on the concept of theory of constraints (TOC), by which dispatching decisions are made to utilize the bottleneck resource at the maximum level and to smooth the flow of material. The new dispatching procedure is compared with existing dispatching rules through simulation experiments.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.4
• /
• pp.467-473
• /
• 1996

This Paper presents a new algorithm to solve Dynamic Economic Dispatch problem. Proposed algorithm is composed of two computational modules; one is dispatch, the other adjusting module. In the dispatch module based on the traditional Static Economic Dispatch method, the power dispatch of each unit is calculated. And in case the results of dispatch module violate ramp rate constraints, Lagrange multipliers are adjusted in the adjusting module. Tests and computer results on test systems are given to show the efficiency of the proposed algorithm. (author). 11 refs., 6 figs., 4 tabs.