• 제목/요약/키워드: Dynamic Programming

검색결과 955건 처리시간 0.032초

역도 드는 동작의 조작도 해석 (Manipulability analysis of the weight lift)

  • 원경태;하인수;이지홍
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
    • /
    • pp.1281-1284
    • /
    • 1997
  • In this article, the configuration of weight lifer is analyzed using manipulibility polytope. After modeling body as 7-link redundant robot, optimal joint angles during first stage are searched by dynamic programmi technique and compared with standard reference data.

  • PDF

부하 대응 제어방식을 적용한 축열식 히트펌프시스템의 성능 해석 (A Performance Analysis on a Heat pump with Thermal Storage Adopting Load Response Control Method)

  • 김동준;강병하;장영수
    • 설비공학논문집
    • /
    • 제30권3호
    • /
    • pp.130-142
    • /
    • 2018
  • We use heat pumps with thermal storage system to reduce peak usage of electric power during winters and summers. A heat pump stores thermal energy in a thermal storage tank during the night, to meet load requirements during the day. This system stabilizes the supply and demand of electric power; moreover by utilizing the inexpensive midnight electric power, thus making it cost effective. In this study, we propose a system wherein the thermal storage tank and heat pump are modeled using the TRNSYS, whereas the control simulations are performed by (i) conventional control methods (i.e., thermal storage priority method and heat pump priority method); (ii) region control method, which operates at the optimal part load ratio of the heat pump; (iii) load response control method, which minimizes operating cost responding to load; and (iv) dynamic programming method, which runs the system by following the minimum cost path. We observed that the electricity cost using the region control method, load response control approach, and dynamic programing method was lower compared to using conventional control techniques. According to the annual simulation results, the electricity cost utilizing the load response control method is 43% and 4.4% lower than those obtained by the conventional techniques. We can note that the result related to the power cost was similar to that obtained by the dynamic programming method based on the load prediction. We can, therefore, conclude that the load response control method turned out to be more advantageous when compared to the conventional techniques regarding power consumption and electricity costs.

동적 프로그래밍을 이용한 오프라인 환경의 문서에 대한 필적 분석 방법 (A Verification Method for Handwritten text in Off-line Environment Using Dynamic Programming)

  • 김세훈;김계영;최형일
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제36권12호
    • /
    • pp.1009-1015
    • /
    • 2009
  • 필적 감정은 개인의 필적 개성을 이용하여 임의의 두 필기 문장 또는 텍스트가 동일인에 의해 작성되었는지를 판별하는 기술이다. 본 논문은 패턴 인식 기술을 사용하여 효과적으로 필적을 분석하고 판별하는 오프-라인 환경에서의 검증 방법을 제안한다. 본 논문에서 연구된 방법의 핵심 절차는 문자 영역 추출, 문서의 구조적 특징을 반영하는 특징의 추출, DTW(Dynamic Time Warping) 알고리즘과 주성분 분석을 이용한 특징 분석이다. 실험 결과는 제안하는 방법의 우수한 성능을 보여준다.

Multiperiod Mean Absolute Deviation Uncertain Portfolio Selection

  • Zhang, Peng
    • Industrial Engineering and Management Systems
    • /
    • 제15권1호
    • /
    • pp.63-76
    • /
    • 2016
  • Multiperiod portfolio selection problem attracts more and more attentions because it is in accordance with the practical investment decision-making problem. However, the existing literature on this field is almost undertaken by regarding security returns as random variables in the framework of probability theory. Different from these works, we assume that security returns are uncertain variables which may be given by the experts, and take absolute deviation as a risk measure in the framework of uncertainty theory. In this paper, a new multiperiod mean absolute deviation uncertain portfolio selection models is presented by taking transaction costs, borrowing constraints and threshold constraints into account, which an optimal investment policy can be generated to help investors not only achieve an optimal return, but also have a good risk control. Threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Based on uncertain theories, the model is converted to a dynamic optimization problem. Because of the transaction costs, the model is a dynamic optimization problem with path dependence. To solve the new model in general cases, the forward dynamic programming method is presented. In addition, a numerical example is also presented to illustrate the modeling idea and the effectiveness of the designed algorithm.

Return-Oriented Programming 공격 방어를 위한 간접 분기 목적 주소 검증 기법 (Indirect Branch Target Address Verification for Defense against Return-Oriented Programming Attacks)

  • 박수현;김선일
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제2권5호
    • /
    • pp.217-222
    • /
    • 2013
  • Return-Oriented Programming(ROP)는 기존 return-to-libc의 발전된 형태로 프로그램의 코드 영역에 있는 가젯을 조합하여 공격자가 원하는 모든 기능을 수행할 수 있는 코드 재사용 공격 기법이다. ROP 공격을 방어하는 기존 방어 기법들은 동적 실행 흐름 분석으로 인한 높은 성능 부하를 보이거나 ROP 공격에 대한 부분적인 방어만 가능하였다. 본 논문에서 제시하는 간접 분기 목적 주소 검증 기법(Indirect Branch Target Address Verification)은 간접 분기문의 목적 주소가 유효한지 검사해서 ROP 공격을 탐지하며, ROP 공격의 대부분을 방어할 수 있다. 또한 동적 실행 흐름 분석이 필요 없기 때문에 낮은 성능 부담을 보인다. SPEC CPU 2006 벤치마크를 대상으로 한 성능평가에서 15%보다 적은 성능 부하를 보였다.

Stochastic Programming for the Optimization of Transportation-Inventory Strategy

  • Deyi, Mou;Xiaoqian, Zhang
    • Industrial Engineering and Management Systems
    • /
    • 제16권1호
    • /
    • pp.44-51
    • /
    • 2017
  • In today's competitive environment, supply chain management is a major concern for a company. Two of the key issues in supply chain management are transportation and inventory management. To achieve significant savings, companies should integrate these two issues instead of treating them separately. In this paper we develop a framework for modeling stochastic programming in a supply chain that is subject to demand uncertainty. With reasonable assumptions, two stochastic programming models are presented, respectively, including a single-period and a multi-period situations. Our assumptions allow us to capture the stochastic nature of the problem and translate it into a deterministic model. And then, based on the genetic algorithm and stochastic simulation, a solution method is developed to solve the model. Finally, the computational results are provided to demonstrate the effectiveness of our model and algorithm.

실시간 비선형 최적화 알고리즘을 이용한 족형 로봇의 Swing 궤적 최적화 방법 (Swing Trajectory Optimization of Legged Robot by Real-Time Nonlinear Programming)

  • 박경덕;최정수;공경철
    • 제어로봇시스템학회논문지
    • /
    • 제21권12호
    • /
    • pp.1193-1200
    • /
    • 2015
  • An effective swing trajectory of legged robots is different from the swing trajectories of humans or animals because of different dynamic characteristics. Therefore, it is important to find optimal parameters through experiments. This paper proposes a real-time nonlinear programming (RTNLP) method for optimization of the swing trajectory of the legged robot. For parameterization of the trajectory, the swing trajectory is approximated to parabolic and cubic spline curves. The robotic leg is position-controlled by a high-gain controller, and a cost function is selected such that the sum of the motor inputs and tracking errors at each joint is minimized. A simplified dynamic model is used to simulate the dynamics of a robotic leg. The purpose of the simulation is to find the feasibility of the optimization problem before an actual experiment occurs. Finally, an experiment is carried out on a real robotic leg with two degrees of freedom. For both the simulation and the experiment, the design variables converge to a feasible point, reducing the cost value.

The Allocation of Inspection Efforts Using a Knowledge Based System

  • Kang, Kyong-sik;Stylianides, Christodoulos;La, Seung-houn
    • 품질경영학회지
    • /
    • 제18권2호
    • /
    • pp.18-24
    • /
    • 1990
  • The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

  • PDF