• 대한전기학회논문지
• /
• 제41권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• 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.

• 한국광학회지
• /
• 제12권2호
• /
• pp.109-114
• /
• 2001

광학설계의 최적화에서는 광학수차를 줄이면서 광학계의 제한조건을 유지시켜야하며, 이를 위하여 Lagrange 부정승수법이 사용되고 있다. 이 과정에서 제한조건이 merit function의 error 항보다 우선적으로 보정된다. 본연구에서는 이를 이용하여 merit function에서 절대값이 큰 error의 보정조건을 제한조건으로 변경하여 우선적으로 보정하는 최적화의 능동적 제어법을 제안하고 이를 사진렌즈계의 최적화에 적용하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권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.

• 한국컴퓨터정보학회논문지
• /
• 제14권12호
• /
• pp.33-40
• /
• 2009

다중에이전트 시스템의 분석에 중요한 시간, 지식, 그리고 전략에 관한 개념들을 구체화하기 위해 번역시스템(Interpreted Systems)과 ATL및 ATEL을 살펴보고, 특히 ATEL의 문제점, 즉 하나의 에이전트는 그 자신의 상태에 대해 확실한 정보를 갖지 못하더라도 전략을 구성함에 있어서 전체 시스템의 현재 상태에 접근할 수 있으며, 또한 ATEL의 불명확한 행위들에 대한 표현은 일반적인 상황을 모델링하는 것을 어렵게 하는 문제점들을 해결하기 위한 방안으로 게임이론의 서브게임 완전한 나쉬평형 (subgame perfect Nash equilibrium)에 기초한 전략적 제한(strategic constraints)을 그 문제의 해결책으로 제안한다. 또한, 전략적 제한에 기초한 번역시스템을 다중에이전트 시스템에서의 모델체킹 (model checking)을 위한 하나의 방법으로 제안한다.

• 전자공학회논문지B
• /
• 제29B권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.

• 대한수학회지
• /
• 제42권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
• /
• 제4권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.

• 한국경영과학회지
• /
• 제23권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.

• 한국경영과학회지
• /
• 제22권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.