• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.626-631
• /
• 2005

This paper presents the target object search algorithm under dynamic programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved if the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using a real robot.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.333-338
• /
• 2005

This paper presents the target object search algorithm under Dynamic Programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation of Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved whether the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using our real robot.

• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.91-99
• /
• 2020

This paper obtains an explicit expression for a debtor's consumption, porfolio and time for filing for bankruptcy when the debtor is subject to upper bound on consumption rate. The utility of consumption is CRRA type and the dynamic programming principle is applied.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.4
• /
• pp.417-428
• /
• 2015

Although, in general, the random fluctuation of interest rates gives a limited impact on portfolio optimization, their stochastic nature may exert a significant influence on the process of selecting the proportions of various assets to be held in a given portfolio when the stochastic volatility of risky assets is considered. The stochastic volatility covers a variety of known models to fit in with diverse economic environments. In this paper, an optimal strategy for portfolio selection as well as the smoothness properties of the relevant value function are studied with the dynamic programming method under a market model of both stochastic volatility and stochastic interest rates.

• Smart Structures and Systems
• /
• v.19 no.1
• /
• pp.21-31
• /
• 2017

To control the stochastic vibration of a vibration-sensitive instrument supported on a beam, the beam is designed as a sandwich structure with magneto-rheological visco-elastomer (MRVE) core. The MRVE has dynamic properties such as stiffness and damping adjustable by applied magnetic fields. To achieve better vibration control effectiveness, the optimal bounded parametric control for the MRVE sandwich beam with supported mass under stochastic and deterministic support motion excitations is proposed, and the stochastic and shock vibration suppression capability of the optimally controlled beam with multi-mode coupling is studied. The dynamic behavior of MRVE core is described by the visco-elastic Kelvin-Voigt model with a controllable parameter dependent on applied magnetic fields, and the parameter is considered as an active bounded control. The partial differential equations for horizontal and vertical coupling motions of the sandwich beam are obtained and converted into the multi-mode coupling vibration equations with the bounded nonlinear parametric control according to the Galerkin method. The vibration equations and corresponding performance index construct the optimal bounded parametric control problem. Then the dynamical programming equation for the control problem is derived based on the dynamical programming principle. The optimal bounded parametric control law is obtained by solving the programming equation with the bounded control constraint. The controlled vibration responses of the MRVE sandwich beam under stochastic and shock excitations are obtained by substituting the optimal bounded control into the vibration equations and solving them. The further remarkable vibration suppression capability of the optimal bounded control compared with the passive control and the influence of the control parameters on the stochastic vibration suppression effectiveness are illustrated with numerical results. The proposed optimal bounded parametric control strategy is applicable to smart visco-elastic composite structures under deterministic and stochastic excitations for improving vibration control effectiveness.

• Journal of Korea Water Resources Association
• /
• v.30 no.3
• /
• pp.269-278
• /
• 1997

Operating rules, the basic principle of reservoir operation, are mostly developed from maximum or minimum, mean inflow series so that those rules cannot be used in practical operating situations to estimate the expected benefits or provide the operating policies for uncertainty conditions. Many operating rules based on the deterministic method that considers all operation variables including inflows as known variables can not reflect to uncertainties of inflow variations. Explicit operating rules can be developed for improving the weakness. In this method, stochastic trend of inflow series, one of the reservoir operation variables, can be directly method, the stochastic technique was applied to develop reservoir operating rule. In this study, stochastic dynamic programming using the concepts was applied to develop optimal operating rule for the Chungju reservoir system. The developed operating rules are regarded as a practical usage because the operating policy is following up the basic concept of Lag-1 Markov except for flood season. This method can provide reservoir operating rule using the previous stage's inflow and the current stage's beginning storage when the current stage's inflow cannot be predicted properly.

• Journal for History of Mathematics
• /
• v.29 no.5
• /
• pp.295-314
• /
• 2016

In tropical geometry, the sum of two numbers is defined as the minimum, and the multiplication as the sum. We learned that dynamic programming in tropical algebraic geometry can be used to find the shortest path in graphs. We have also learned about the Bezout's Theorem, which is a theorem concerning the intersections of tropical plane curves, and the stable intersection principle.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.11-16
• /
• 2013

This paper derives an equilibrium asset price when there exist three kinds of traders in financial market: a risk-averse informed trader, noise traders, and risk neutral market makers. This paper is an extended version of Kyle's (1985, Econometrica) continuous time model by introducing insider's risk aversion. We obtain not only the equilibrium asset pricing and market depth parameter but also insider's value function and optimal insider's trading strategy explicitly. The comparative static shows that the market depth (the reciprocal of market pressure) increases with time and volatility of noise traders' trading.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.16
• /
• pp.113-119
• /
• 1987

A Multistage production-inventory model is developed for deteriorating items. The model is developed deterministic but time-varing demand pattern and instantaneous delivery. Deterioration rates are assumed to vary from period to period. Discrete version of Pontryagin's maximum principle is used to present the efficient alogrithm to solve this model easily. A numerical example is given to illustrate the derived results.

• Journal of the military operations research society of Korea
• /
• v.16 no.2
• /
• pp.105-117
• /
• 1990

In the transportation network problems, it is often more desirable to select multiple number of optimal parths to prepare for additional constratints being imposed than to choose single optimal path. This paper addresses 'the problem of finding the k-shortest paths visiting p-specified nodes in a network'. The solution method is derived and the example of application is shown. The keypoint for determining the k-shortest paths via p-specified nodes is to combine the Shier's k-shortest path algorithm and the principle of optimality of dynamic programming method. Finally, for a transportation network problem consisting of national main routes, the k-shortest paths via some specified cites are obtained by using the solution method developed here.