• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.6
• /
• pp.703-706
• /
• 1998

본 논문에서는 확률 최적 제어문제에서 발생되는 Elliptic type H-J-B(Hamilton-Jacobi-Bellman) 방정식에 대한 수치해를 구하였다. 수치해를 구하기 위하여 Contraction 사상 및 유한차분법을 이용하였으며, 시스템은 It/sub ∧/ 형태의 Stochastic 방정식으로 취하였다. 수치해는 수학적인 테스트 케이스를 설정하여 검증하였으며, 최적제어 Map을 방정식의 해를 구하면서 동시에 구하였다.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.571-576
• /
• 2013

In this paper, we solve the optimal investment problem when the investor gets labor income and may have a wage increase. We assume the investor has constant absolute risk aversion(CARA) utility and obtain closed form solutions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.440-444
• /
• 1998

In this paper, we consider numerical solution of a H-J-B (Hamilton-Jacobi-Bellman) equation of elliptic type arising from the stochastic control problem. For the numerical solution of the equation, we take an approach involving contraction mapping and finite difference approximation. We choose the It(equation omitted) type stochastic differential equation as the dynamic system concerned. The numerical method of solution is validated computationally by using the constructed test case. Map of optimal controls is obtained through the numerical solution process of the equation. We also show how the method applies by taking a simple example of nonlinear spacecraft control.

• Korean Journal of Mathematics
• /
• v.16 no.2
• /
• pp.145-156
• /
• 2008

When we consider a life insurance company that sells a large number of continuous T-year term life insurance policies, it is important to find an optimal strategy which maximizes the surplus of the insurance company at time T. The purpose of this paper is to give an explicit expression for the optimal reinsurance and investment strategy which maximizes the expected exponential utility of the final value of the surplus at the end of T-th year. To do this we solve the corresponding Hamilton-Jacobi-Bellman equation.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.31 no.7
• /
• pp.18-24
• /
• 1982

We derived an optimal control of the Stochastic Bilinear Systems. For that we, firstly, formulated stochastic bilinear system and estimated its state when the system state is not directly observable. Optimal control problem of this system is reviewed on the line of three optimization techniques. An optimal control is derived using Hamilton-Jacobi-Bellman equation via dynamic programming method. It consists of combination of linear and quadratic form in the state. This negative feedback control, also, makes the system stable as far as value function is chosen to be a Lyapunov function. Several other properties of this control are discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.168-173
• /
• 2003

In this paper, we will present a deeper look on optimal design methods that are related to path-planning for a mobile robot. To control the motion of a mobile robot in a clustered environment, it's necessary to know a suitable trajectory assuming certain start and goal point. Up to now, there are many literatures that concern optimal path planning for an obstacle avoided mobile robot. Among those literatures, we have chosen 2 novel methods for our further analysis. The first approach [4] is based on HJB(Hamilton-Jacobi-Bellman) equation whose solution is the return-function that helps to generate a shortest path to the goal. The later [5] is called polynomial-path-planning approach, in this method, a shortest polynomial-shape path would become a solution if it was a collision-free path. The camera network plays the role as sensors to generate updated map which locates the static and dynamic objects in the space. Therefore, the exhibition of both path planning and dynamic obstacle avoidance by the updated map would be accomplished simultaneously. As we mentioned before, our research will include the motion control of a true mobile robot on those optimal planned paths which were generated by above algorithms. Base on the kinematic and dynamic simulation results, we can realize the affection of moving speed to the stable of motion on each generated path. Also, we can verify the time-optimal trajectory through velocity tuning. To simplify for our analysis, we assumed the obstacles are cylindrical circular objects with the same size.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.91-100
• /
• 2011

It is important to find an optimal strategy which maximize the surplus of the insurance company at the maturity time T. The purpose of this paper is to give an explicit expression for the optimal reinsurance and investment strategy, under the CEV model, which maximizes the expected exponential utility of the final value of the surplus at T. To do this optimization problem, the corresponding Hamilton-Jacobi-Bellman equation will be transformed a linear partial differential equation by applying a Legendre transform.

• Journal of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.311-335
• /
• 2022

This paper treats Merton's classical portfolio optimization problem for a market participant who invests in safe assets and risky assets to maximize the expected utility. When the state process is a d-dimensional Markov diffusion, this problem is transformed into a problem of solving a Hamilton-Jacobi-Bellman (HJB) equation. The main purpose of this paper is to solve this HJB equation by a deep learning algorithm: the deep Galerkin method, first suggested by J. Sirignano and K. Spiliopoulos. We then apply the algorithm to get the solution to the HJB equation and compare with the result from the finite difference method.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1153-1170
• /
• 2022

In this paper, we investigate the portfolio optimization problem under the SVCEV model, which is a hybrid model of constant elasticity of variance (CEV) and stochastic volatility, by taking into account of minimum-entropy robustness. The Hamilton-Jacobi-Bellman (HJB) equation is derived and the first two orders of optimal strategies are obtained by utilizing an asymptotic approximation approach. We also derive the first two orders of practical optimal strategies by knowing that the underlying Ornstein-Uhlenbeck process is not observable. Finally, we conduct numerical experiments and sensitivity analysis on the leading optimal strategy and the first correction term with respect to various values of the model parameters.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.254-255
• /
• 2023

This paper discovers a robust managerial strategy for a stochastic inventory of perishable products, where the model experiences changing factors including inner parameters and an external disturbance with unknown form. An analytical solution for the optimization problem can be obtained by applying the Hamilton-Bellman-Jacobi equation, however the policy result cannot completely suppress the oscillation from the external disturbance. Therefore, an intelligent approach named Radial Basis Function Neural Networks is applied to estimate the unknown disturbance and provide a robust controller to manipulate the inventory level more effective. The final results show the outstanding performance of RBFNN controller, where both the estimation error and control error are guaranteed in the predefined limit.