• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.8
• /
• pp.831-840
• /
• 1992

This paper presents an efficient short-term generation scheduling method using a rule-based expert/consulting system approach to assist electric energy system operators and planners. The expert system approach is applied to improve the Dynamic Programming(DP) based generation scheduling algorithm. In the selection procedure of the feasible combinations of generating units at each stage, automatic consulting on the manipulation of several constraints such as the minimum up time, the minimum down time and the maximum running time constraints of generating units will be performed by the expert/consulting system. In order to maximize the solution feasibility, the aforementioned constraints are controlled by a rule-based expert system, that is, instead of imposing penalty cost to those constraint violated combinations, which sometimes may become the very reason of no existing solution, several constraints will be manipulated within their flexibilities using the rules and facts that are established by domain experts. In this paper, for the purpose of implementing the consulting of several constraints during the dynamic process of generation scheduling, an expert system named STGSCS is developed. As a building tool of the expert system, C Language Integrated Production System(CLIPS) is used. The effectiveness of the proposed algorithm has been demonstrated by applying it to a model electric energy system.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.793-796
• /
• 1996

This study proposes a new algorithm which performs a production simulation under various constraints and maintains computational efficiency. In order to consider the environmental and operational constraints, the proposed algorithm is based on optimization techniques formulated in LP form In the algorithm, "system characteristic constraints" reflect the system characteristics such as LDC shape, unit loading order and forced outage rate. By using the concept of Energy Invariance Property and two operational rules i.e. Compliance Rule for Emission Constraint, Compliance Rule for Limited Energy of Individual Unit, the number of system characteristic constraints is appreciably reduced. As a solution method of the optimization problem, the author uses Karmarkar's method which performs effectively in solving large scale LP problem. The efficiency of production simulation is meaningful when it is effectively used in power system planning. With the proposed production simulation algorithm, an optimal expansion planning model which can cope with operational constraints, environmental restriction, and various uncertainties is developed. This expansion planning model is applied to the long range planning schemes by WASP, and determines an optimal expansion scheme which considers the effect of supply interruption, load forecasting errors, multistates of unit operation, plural limited energy plants etc.

• Korean Journal of Optics and Photonics
• /
• v.12 no.2
• /
• pp.109-114
• /
• 2001

Optical system has some optical and mechanical constraints. The constraints should be preserved in optimization of optical system. For the purpose, the constraints are combined with the merit function by using Lagrange's undetermined multipliers. We propose an active optimization control by using the fact that the errors of constraints are corrected with higher priority than the other errors of the merit function. In this control, the errors which have large contribution to the merit function are converted into constraints. At that time, if the errors are corrected at once, the optimization will be unstable because of their non-linearity. Hence we introduce a target rate which represents a fraction of error to be corrected, and the errors are corrected progressively. An optimization program was developed on the bases of the proposed active control, and applied to design a photographic lens system. By using the active control, we could get better results compared with conventional damped least squares method. ethod.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.185-201
• /
• 2023

Grant-free random access (GFRA) can reduce the access delay and signaling cost, and satisfy the short transmission packet and strict delay constraints requirement in internet of things (IoT). IoT is a major trend in the future, which is characterized by the variety of applications and devices. However, most existing studies on GFRA only consider a single type of device and omit the effect of access delay. In this paper, we study GFRA in multicell massive multipleinput multiple-output (MIMO) systems where different types of devices with various configurations and requirements co-exist. By introducing the backoff mechanism, each device is randomly activated according to the backoff parameter, and active devices randomly select an orthogonal pilot sequence from a predefined pilot pool. An analytical approximation of the average spectral efficiency for each type of device is derived. Based on it, we obtain the optimal backoff parameter for each type of devices under their delay constraints. It is found that the optimal backoff parameters are closely related to the device number and delay constraint. In general, devices that have larger quantity should have more backoff time before they are allowed to access. However, as the delay constraint become stricter, the required backoff time reduces gradually, and the device with larger quantity may have less backoff time than that with smaller quantity when its delay constraint is extremely strict. When the pilot length is short, the effect of delay constraints mentioned above works more obviously.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.33-40
• /
• 2009

We study Interpreted Systems, ATL, and ATEL to capture the notion of time, knowledge, and strategy which are important in the analysis of multi-agent systems and propose strategic constraints based on subgame perfect Nash equilibrium of game theory as one of the solutions for the issues of ATEL which an agent can access the current state of the whole system when making up his strategy even when he should be uncertain about the state, and no explicit representation of actions in ATEL models makes some natural situations harder to model. Also, we present strategic constraints-based Interpreted Systems for model checking of multi-agent systems.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.12-21
• /
• 1992

Many real-time supporting features are used to execute real-time process in a time-constraints given. In this paper, The real-tiem resources management mechanism based time constraints which order resources supporting real-time processes blocked by the processes was proposed. This mechanism was all implemented and tested on the UNIX operating system.

• Journal of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.17-35
• /
• 2005

Necessary conditions for a deterministic optimal control problem which involves states constraints are derived in the form of a maximum principle. The conditions are similar to those of F.H. Clarke, R.B. Vinter and G. Pappas who assume that the problem's data are Lipschitz. On the other hand, our data are not continuously differentiable but only differentiable. Fermat's rule and Rockafellar's duality theory of convex analysis are the basic techniques in this paper.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.566-569
• /
• 2009

In this paper, we propose a less conservative a linear matrix inequality (LMI) condition for the constrained robust model predictive control of systems with input constraints and polytopic uncertainty. Systems with input constraints are represented as perturbed systems with sector bounded conditions. For the infinite horizon control, closed-loop stability conditions are obtained by using a parameter dependent Lyapunov function. The effectiveness of the proposed method is shown by an example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.1-10
• /
• 1998

We consider the precedence-constrained knapsack problem. which is a knapsack problem with precedence constraints imposed on the set of variables. Especially, we focus on the case where the precedence constraints cir be represented as a bipartite graph, which occurs most frequently in applications. Based on the previous studios for the general case, we specialize the polyhedral results on the related polytope and derive stronger results on the facet-defining properties of the inequalities.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.