• Title/Summary/Keyword: Stochastic control

Search Result 475, Processing Time 0.024 seconds

On the Comparison of Particle Swarm Optimization Algorithm Performance using Beta Probability Distribution (베타 확률분포를 이용한 입자 떼 최적화 알고리즘의 성능 비교)

  • Lee, ByungSeok;Lee, Joon Hwa;Heo, Moon-Beom
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.8
    • /
    • pp.854-867
    • /
    • 2014
  • This paper deals with the performance comparison of a PSO algorithm inspired in the process of simulating the behavior pattern of the organisms. The PSO algorithm finds the optimal solution (fitness value) of the objective function based on a stochastic process. Generally, the stochastic process, a random function, is used with the expression related to the velocity included in the PSO algorithm. In this case, the random function of the normal distribution (Gaussian) or uniform distribution are mainly used as the random function in a PSO algorithm. However, in this paper, because the probability distribution which is various with 2 shape parameters can be expressed, the performance comparison of a PSO algorithm using the beta probability distribution function, that is a random function which has a high degree of freedom, is introduced. For performance comparison, 3 functions (Rastrigin, Rosenbrock, Schwefel) were selected among the benchmark Set. And the convergence property was compared and analyzed using PSO-FIW to find the optimal solution.

ON STOCHASTIC OPTIMAL REINSURANCE AND INVESTMENT STRATEGIES FOR THE SURPLUS UNDER THE CEV MODEL

  • Jung, Eun-Ju;Kim, Jai-Heui
    • 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.

The mathematical backups in the option pricing theory

  • 김주홍
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.10-10
    • /
    • 2003
  • Option pricing theory developed by Black and Sholes depends on an arbitrage opportunity argument. An investor can exactly replicate the returns to any option on that stock by continuously adjusting a portfolio consisting of a stock and a riskless bond. The value of the option equal the value of the replicating portfolio. However, transactions costs invalidate the Black-Sholes arbitrage argument for option pricing, since continuous revision implies infinite trading, Discrete revision using Black-Sholes deltas generates errors which are correlated with the market, and do not approach zero with more frequent revision when transactions costs are included. Stochastic calculus serves as a fundamental tool in the mathematical finance. We closely look at the utility maximization theory which is one of the main option valuation methods. We also see that how the stochastic optimal control problems and their solution methods are applied to the theory.

  • PDF

Stochastic Traffic Congestion Evaluation of Korean Highway Traffic Information System with Structural Changes

  • Lee, Yongwoong;Jeon, Saebom;Park, Yousung
    • Asia pacific journal of information systems
    • /
    • v.26 no.3
    • /
    • pp.427-448
    • /
    • 2016
  • The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

Seat Allocation Model for Single Flight-leg using Linear Approximation Technique (선형근사 기법을 이용한 단일비행구간의 좌석할당 모형)

  • Song, Yoon-Sook;Lee, Hwi-Young
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.65-75
    • /
    • 2008
  • Over the last three decades, there are many researches focusing on the practice and theory of RM in airlines. Most of them have dealt with a seat assignment problem for maximizing the total revenue. In this study, we focus on a seat assignment problem in airlines. The seat assignment problem can be modeled as a stochastic programming model which is difficulty to solve optimally. However, with some assumptions on the demand distribution functions and a linear approximation technique, we can transform the complex stochastic programming model to a Linear Programming model. Some computational experiments are performed to evaluate out model with randomly generated data. They show that our model has a good performance comparing to existing models, and can be considered as a basis for further studies on improving existing seat assignment models.

  • PDF

NEURAL CHANDRASEKHAR FILTERING METHOD FOR STETIONARY SIGNAL PROCESSES

  • Sugisaka, Masanori
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.742-745
    • /
    • 1994
  • In this paper we show the performance of neural Chandrasekhar filtering which is a special case for the new method of neural filtering using the artificial neural network systems developed recently for the filtering problems of linear and nonlinear, stationary and nonstationary stochastic signals. The neurofilter developed has either the finite impulse response(FIR) structure or the infinite impulse response(IIR) structure. The neurofilter differs from the conventional linear digital FIR and IIR filters because the artificial neural network system used in the neurofilter has nonlinear structure due to the sigmoid function. Numerical studies for the estimation of a second order Butterworth process are performed by changing the structures of the neurofilter in order to evaluate the performance indices under the changes of the output noises or disturbances. In the numerical studies both Chandrasekhar filtering estimates and true signals are used as the training signals for the neurofilter. The results obtained from the studies verified the capabilities which are essentially necessary for on-line filtering of various stochastic signals.

  • PDF

Step-Size Control for Width Adaptation in Radial Basis Function Networks for Nonlinear Channel Equalization

  • Kim, Nam-Yong
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.600-604
    • /
    • 2010
  • A method of width adaptation in the radial basis function network (RBFN) using stochastic gradient (SG) algorithm is introduced. Using Taylor's expansion of error signal and differentiating the error with respect to the step-size, the optimal time-varying step-size of the width in RBFN is derived. The proposed approach to adjusting widths in RBFN achieves superior learning speed and the steady-state mean square error (MSE) performance in nonlinear channel environment. The proposed method has shown enhanced steady-state MSE performance by more than 3 dB in both nonlinear channel environments. The results confirm that controlling over step-size of the width in RBFN by the proposed algorithm can be an effective approach to enhancement of convergence speed and the steady-state value of MSE.

ADAPTIVE CHANDRASEKHAR FILLTER FOR LINEAR DISCRETE-TIME STATIONALY STOCHASTIC SYSTEMS

  • Sugisaka, Masanori
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10b
    • /
    • pp.1041-1044
    • /
    • 1988
  • This paper considers the design problem of adaptive filters based an the state-space models for linear discrete-time stationary stochastic signal processes. The adaptive state estimator consists of both the predictor and the sequential prediction error estimator. The discrete Chandrasakhar filter developed by author is employed as the predictor and the nonlinear least-squares estimator is used as the sequential prediction error estimator. Two models are presented for calculating the parameter sensitivity functions in the adaptive filter. One is the exact model called the linear innovations model and the other is the simplified model obtained by neglecting the sensitivities of the Chandrasekhar X and Y functions with respect to the unknown parameters in the exact model.

  • PDF

Timed fuzzy petri net model for fuzzy control model (퍼지 제어를 위한 시간형 퍼지 페트리넷 모델)

  • 윤정모
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.5
    • /
    • pp.9-18
    • /
    • 1997
  • The petri net is a graphic model which is adaptable in modeling a complex concurrent parallel ssystem, and it is widely used in the fields of industrial enginering, computer science, electric engineeringand chemistry. Recently, the net is applied to the communication protocol, and extended to represent complex systems. There are several extended petri nets named as TPN (timed petri net), SPN (stochastic petri net), FPN(fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this SPN (stochastic petri net), FPN (fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this paper proposes an advanced communication protocol modeling method using the fuzzy value of the transition and firing delay time as the arguments of the function. The proposed method can produce clearer firing rules, and it is supposed to be used to design and analyse communication protocols in great effection.

  • PDF

Redundancy Management of Brake-by-wire System using a Message Scheduling (메시지 스케줄링을 이용한 Brake-by-wire 시스템의 Redundancy Management)

  • Yune, J. W.;Kim, K. W.;Kim, T. Y.;Kim, J. G.;Lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.717-720
    • /
    • 2000
  • Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

  • PDF