• Title/Summary/Keyword: geometric programming

Search Result 94, Processing Time 0.03 seconds

Stability and PSR(Power-Supply Rejection) Models for Design Optimization of Capacitor-less LDO Regulators (회로 최적화를 위한 외부 커패시터가 없는 LDO 레귤레이터의 안정도와 PSR 성능 모델)

  • Joo, Soyeon;Kim, Jintae;Kim, SoYoung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.1
    • /
    • pp.71-80
    • /
    • 2015
  • LDO(Low Drop-Out) regulators have become an essential building block in modern PMIC(Power Managment IC) to extend battery life of electronic devices. In this paper, we optimize capacitor-less LDO regulator via Geometric Programming(GP) designed using Dongbu HiTek $0.5{\mu}m$ BCDMOS process. GP-compatible models for stability and PSR of LDO regulators are derived based on monomial formulation of transistor characteristics. Average errors between simulation and the proposed model are 9.3 % and 13.1 %, for phase margin and PSR, respectively. Based on the proposed models, the capacitor-less LDO optimization can be performed by changing the PSR constraint of the design. The GP-compatible performance models developed in this work enables the design automation of capacitor-less LDO regulator for different design target specification.

Optimal Geometric Path and Minimum-Time Motion for a Manipulator Arm (로봇팔의 최적 기하학적 경로 및 시간최소화 운동)

  • Park, Jong-Keun;Han, Sung-Hyun;Kim, Tae-Han;Lee, Sang-Tak
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.12
    • /
    • pp.204-213
    • /
    • 1999
  • This paper suggests a numerical method of finding optimal geometric path and minimum-time motion for a manipulator arm. To find the minimum-time motion, the optimal geometric path is searched first, and the minimum-time motion is searched on this optimal path. In the algorithm finding optimal geometric path, the objective function is minimizing the combination of joint velocities, joint-jerks, and actuator forces as well as avoiding several static obstacles, where global search is performed by adjusting the seed points of the obstacle models. In the minimum-time algorithm, the traveling time is expressed by the linear combinations of finite-term quintic B-splines and the coefficients of the splines are obtained by nonlinear programming to minimize the total traveling time subject to the constraints of the velocity-dependent actuator forces. These two search algorithms are basically similar and their convergences are quite stable.

  • PDF

NONPARAMETRIC MAXIMUM LIKELIHOOD ESTIMATION OF A CONCAVE RECEIVER OPERATING CHARACTERISTIC CURVE VIA GEOMETRIC PROGRAMMING

  • Lee, Kyeong-Eun;Lim, Johan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.3
    • /
    • pp.523-537
    • /
    • 2011
  • A receiver operating characteristic (ROC) curve plots the true positive rate of a classier against its false positive rate, both of which are accuracy measures of the classier. The ROC curve has several interesting geometrical properties, including concavity which is a necessary condition for a classier to be optimal. In this paper, we study the nonparametric maximum likelihood estimator (NPMLE) of a concave ROC curve and its modification to reduce bias. We characterize the NPMLE as a solution to a geometric programming, a special type of a mathematical optimization problem. We find that the NPMLE is close to the convex hull of the empirical ROC curve and, thus, has smaller variance but positive bias at a given false positive rate. To reduce the bias, we propose a modification of the NPMLE which minimizes the $L_1$ distance from the empirical ROC curve. We numerically compare the finite sample performance of three estimators, the empirical ROC curve, the NMPLE, and the modified NPMLE. Finally, we apply the estimators to estimating the optimal ROC curve of the variance-threshold classier to segment a low depth of field image and to finding a diagnostic tool with multiple tests for detection of hemophilia A carrier.

Automated yield-line analysis of beam-slab systems

  • Johnson, David
    • Structural Engineering and Mechanics
    • /
    • v.3 no.6
    • /
    • pp.529-539
    • /
    • 1995
  • The rigid-plastic yield-line analysis of isotropically reinforced concrete slabs acting in conjunction with torsionally weak supporting beams is developed as the lower-bound form of a linear programming formulation. The analysis is extended to consider geometric variation of chosen yield-line patterns by the technique of sequential linear programming. A strategy is followed of using a fine potential yield-line mesh to identify possible collapse modes, followed by analysis using a coarser, simplified mesh to refine the investigation and for use in conjunction with geometric optimization of the yield-line system. The method is shown to be effective for the analysis of three slabs of varying complexity. The modes detected by the fine and simplified analyses are not always similar but close agreement in load factors has been consistently obtained.

Base Station Placement for Wireless Sensor Network Positioning System via Lexicographical Stratified Programming

  • Yan, Jun;Yu, Kegen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4453-4468
    • /
    • 2015
  • This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

기하학적 계획법

  • Kang, Suk-Ho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.1 no.1
    • /
    • pp.51-54
    • /
    • 1976
  • 1964년에 Duffin과 Zener는 기하적 계획법(Geometric Programming)이란 새로운 비선형 계획법(Nonlinaer Programming)을 개발하였다. 이 새로운 기하적 계획법은 수주한 형태의 비선형 계획문제에만 적용이 가능하지만 반면 적용이 가능한 문제에 관해서는 매우 강력한 계획법중에 하나가 된다. 지금부터 기하적 계획법의 원리와 그에 따르는 문제해결 예제를 들면서 적용 가능한 비선형 문제를 해결하겠다.

  • PDF

The minimum time pocketing cycle for the dialog workshop oriented programming (대화형 작업장 프로그래밍을 위한 최소 시간 포켓 가공 싸이클)

  • 류제석;강성균;전용주
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.848-851
    • /
    • 1996
  • Based on the minimum cutting time criteria, the tool path generation algorithm of a pocket machining is developed as a form of a built-in cycle for the WOP(workshop oriented programming) of a CNC controller. Based on the given CAD database and tool information, an optimal cutting depth and geometric properties can be generated, then six different tool paths will be generated internally and automatically. Finally, the G code which commands tool movements is generated for CNC machining.

  • PDF

A design of a prototype system for automatic robot programming (로보트 자동 프로그래밍을 위한 원형 시스템의 설계)

  • 조혜경;고명삼;이범희
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10a
    • /
    • pp.501-506
    • /
    • 1988
  • This paper describes an experimental system for automatic robot programming, The SNU-ARPS (Seoul National University Automatic Robot Programming System). The SNU-ARPS generates executable robot programs for pick and place operation and some simple mechanical assembly tasks by menudriven dialog. It is intended to enable the user to concentrate on the overall operation sequence instead of the knowledge regarding the details of robot languages. To convert task specifications into manipulator motions, the SNU-ARPS uses an internal representation of the world. This representation initially consists of geometric database from CAD system and is updated at each operation step to reflect the state changes of the world.

  • PDF

DigitalMicrograph Script Source Listing for a Geometric Phase Analysis

  • Kim, Kyou-Hyun
    • Applied Microscopy
    • /
    • v.45 no.2
    • /
    • pp.101-105
    • /
    • 2015
  • Numerous digital image analysis techniques have been developed with regard to transmission electron microscopy (TEM) with the help of programming. DigitalMicrograph (DM, Gatan Inc., USA), which is installed on most TEMs as operational software, includes a script language to develop customized software for image analysis. Based on the DM script language, this work provides a script source listing for quantitative strain measurements based on a geometric phase analysis.

GIROB : Graphic User Interface for Robot Programming (로봇 프로그래밍을 위한 GUI와 CAD의 응용)

  • Kim, J.J.
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.3 no.6
    • /
    • pp.199-211
    • /
    • 1995
  • As international market pressures increase, product life cycles are becoming shorter at same time requirements for productivity and flexibility are becoming higher. Major improvement in robot programming user interface is central to increasing productivity and flexibility for automatic manufacturing environments. New computer technologies have the potential to accomplish this improvement. In this study we have developed a system which proves that interactive computer graphics and geometric modeling have matured to the point where their artful application into an integrated system can rsult in radically new and powerful user interface for robot programming. With the graphic user interface environment the system efficiently utilizes the existing CAD data and gemetric modeling techniques for off-line programming and simulations. Also the system successfully generates robot control programs performing the desired tasks given through off-line programming.

  • PDF