• Title/Summary/Keyword: D-Optimality

Search Result 75, Processing Time 0.03 seconds

An Analytical Study of the Optimal Constant Speed Regulation of a D.C Control Motor (제어용 직류전동기의 정속도최적제어에 대한 해석적 연구)

  • 장세훈;이양범
    • 전기의세계
    • /
    • v.26 no.6
    • /
    • pp.48-54
    • /
    • 1977
  • The object of this work is to study the optimal control strategy of constant speed characteristics for a D.C control motor under influence of disturbance. In the course of the analysis, the linearization and time invariance schemes on motor dynamics are presumed throughout under certain prescribed conditions and the performance measure for optimality is assumed to be quadratic in state and the control effort, with the initial and final time specified. When the motor speed is deviated from a stationary operating point by any external disturbance, the optimal continuous feedback control law is investigated by the application of the calculus of variation and realizability of the required control meachanism is suggested. Finally, the comparative study of the speed reasponses of the motor, with and without the optimal control effort is also presented to confirm the obtained results.

  • PDF

Fast Pattern Classification with the Multi-layer Cellular Nonlinear Networks (CNN) (다층 셀룰라 비선형 회로망(CNN)을 이용한 고속 패턴 분류)

  • 오태완;이혜정;손홍락;김형석
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.9
    • /
    • pp.540-546
    • /
    • 2003
  • A fast pattern classification algorithm with Cellular Nonlinear Network-based dynamic programming is proposed. The Cellular Nonlinear Networks is an analog parallel processing architecture and the dynamic programing is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast pattern classification with optimization is formed. On such CNN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The algorithm is similar to the conventional neural network-based method in the use of the exemplar patterns but quite different in the use of the most likely path finding of the dynamic programming. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

Presentation Planning for Distributed VoD Systems (분산 VoD 시스템을 위한 프리젠테이션 플래닝)

  • Hwang, In-Jun;Byeon, Gwang-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.577-593
    • /
    • 2000
  • A distributed video-on-demand (VoD) system is one where collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in the setting of a distributed VoD system, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present three types of presentation plans that a local server must construct in order to satisfy the customer request. Informally speaking, a presentation plan is a temporally synchronized detailed sequence of steps that the local server must perform for presenting the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, for evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth is used. We develop algorithms to compute optimal presentation plans for all three types, and carry out extensive experiments to compare their performance. We have also mathematically proved certain results for the presentation plans that had previously been verified experimentally in the literature.

  • PDF

Efficient designs in conjoint analysis (컨조인트 분석에서 효율적인 문항 설계)

  • Chung, Jong Hee;Lim, Yong B.
    • Journal of Korean Society for Quality Management
    • /
    • v.46 no.1
    • /
    • pp.27-38
    • /
    • 2018
  • Purpose: A large number of attributes with mixed levels are often considered in the conjoint analysis. In the cases where attributes have two or three levels, we research on the efficient design of survey questionnaire to estimate all the main effect and two factor interaction effects with a reasonable size of it. Methods: To reduce the number of questions in a questionnaire, the balanced incomplete block mixed level factorial design with minimum aberration was proposed by Lim and Chung (2016). Based on the number of questions and that of the respondents in that design, D-optimality criterion is adopted to find efficient designs where the main effect and two factor interaction effects are estimated. Results: The list of the number of questions and that of the respondents in efficient designs for survey questionnaire are recommended based on the D-efficiency of each design and the proposed selection criteria for the number of both questions and the respondents. By analyzing all the respondents survey data generated by the simulation study, we find the proper model. Conclusion: The proposed methods of designing survey questionnaires seem to perform well in the sense that how often the proper model is found in a simulation study where all the respondents survey data are generated by the simulation model.

Optimal Path Planning Algorithm for Visiting Multiple Mission Points in Dynamic Environments (동적 변화 환경에서 다중 임무점 방문을 위한 최적 경로 계획 알고리즘)

  • Lee, Hohyeong;Chang, Woohyuk;Jang, Hwanchol
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.5
    • /
    • pp.379-387
    • /
    • 2019
  • The complexity of path planning for visiting multiple mission points is even larger than that of single pair path planning. Deciding a path for visiting n mission points requires conducting $n^2+n$ times of single pair path planning. We propose Multiple Mission $D^*$ Lite($MMD^*L$) which is an optimal path planning algorithm for visiting multiple mission points in dynamic environments. $MMD^*L$ reduces the complexity by reusing the computational data of preceding single pair path planning. Simulation results show that the complexity reduction is significant while its path optimality is not compromised.

Design of Step-Stress Accelerated Life Tests for Weibull Distributions with a Nonconstant Shape Parameter

  • Kim, C. M.;D. S. Bai
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.4
    • /
    • pp.415-433
    • /
    • 1999
  • This paper considers the design of step-stress accelerated life tests for the Weibull distribution with a nonconstant shape parameter under Type I censoring. It is assumed that scale and shape parameters are log-linear functions of (possibly transformed) stress and that a cumulative exposure model holds for the effect of changing stress. The asymptotic variance of the maximum likelihood estimator of a stated quantile at design stress is used as an optimality criterion. The optimum three step-stress plans are presented for selected values of design parameters and the effects of errors in pre- estimates of the design parameters are investigated.

  • PDF

A graphical method for evaluating the effect of design augmentation, missing observation, and outlier in mixture experiments (혼합물 실험계획에서 실험점의 확장, 결측치, 이상치의 영향을 평가할 수 있는 그래픽 방법)

  • Jang, Dae-Heung;Park, Sang-Hyun
    • Journal of Korean Society for Quality Management
    • /
    • v.24 no.4
    • /
    • pp.156-167
    • /
    • 1996
  • D-optimality is used often in design augmentation of mixture experiments. Although such alphabetic criteria provide a valuable foundation for generating designs, they often fail to convey the true nature of the design's support of the fitted model in terms of prediction variance over a region of interest. Thus, a graphical method is proposed to evaluate augmented designs in mixture experiments. This method can be used to evaluate the effect of missing observation and outlier in mixture experiments.

  • PDF

A BOUNDARY CONTROL PROBLEM FOR THE TIME-DEPENDENT 2D NAVIER-STOKES EQUATIONS

  • Kim, Hongchul;Kim, Seon-Gyu
    • Korean Journal of Mathematics
    • /
    • v.16 no.1
    • /
    • pp.57-84
    • /
    • 2008
  • In this paper, a boundary control problem for a flow governed by the time-dependent two dimensional Navier-Stokes equations is considered. We derive a mathematical formulation and a relevant process for an appropriate control along the part of the boundary to minimize the drag due to the flow. After showing the existence of an optimal solution, the first order optimality conditions are derived. The strict differentiability of the state solution in regard to the control parameter shall be exposed rigorously, and the necessary conditions along with the system for the optimal solution shall be deduced in conjunction with the evaluation of the first order Gateaux derivative to the performance functional.

  • PDF

A dual approach to input/output variance constrained control problem

  • Kim, Jac-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.28-33
    • /
    • 1994
  • An optimal controller, e.g. LQG controller, may not be realistic in the sense that the required control power may not be achieved by existing actuators, and the measured output is not satisfactory. To be realistic, the controller should meet such constraints as sensor or actuator limitation, performance limit, etc. In this paper, the lnput/Output Variance Constrained (IOVC) control problem will be considered from the viewpoint of mathematical programming. A dual version shall be developed to solve the IOVC control problem, whose objective is to find a stabilizing control law attaining a minimum value of a quadratic cost function subject to the inequality constraint on each input and output variance for a stabilizable and detectable plant. One approach to the constrained optimization problem is to use the Kuhn-Tucker necessary conditions for the optimality and to seek an optimal point by an iterative algorithm. However, since the algorithm uses only the necessary conditions, the convergent point may not be optimal solution. Our algorithm will guarantee a sufficiency.

  • PDF

Bilevel-programming based failure-censored ramp-stress ALTSP for the log-logistic distribution with warranty cost

  • Srivastava, P.W.;Sharma, D.
    • International Journal of Reliability and Applications
    • /
    • v.17 no.1
    • /
    • pp.85-105
    • /
    • 2016
  • In this paper accelerated life testing is incorporated in quality control technique of acceptance sampling plan to induce early failures in high reliability products.Stress under accelerated condition can be applied in constant-stress, step-stress and progressive-stress or combination of such loadings. A ramp-stress results when stress is increased linearly (from zero) with time. In this paper optimum failure-censored ramp-stress accelerated life test sampling plan for log-logistic distribution has been formulated with cost considerations. The log-logistic distribution has been found appropriate for insulating materials. The optimal plans consist in finding optimum sample size, sample proportion allocated to each stress, and stress rate factor such that producer's and consumer's interests are safeguarded. Variance optimality criterion is used when expected cost per lot is not taken into consideration, and bilevel programming approach is used in cost optimization problems. The methods developed have been illustrated using some numerical examples, and sensitivity analyses carried out in the context of ramp-stress ALTSP based on variable SSP for proportion nonconforming.