Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information about an underlying phenomena of interest in a speedy manner while accounting for the penalty of wrong declaration. Due to the sequential nature of the problem, the decision maker relies on his current information state to adaptively select the most “informative” sensing action amon...

Market-makers serve an important role as providers of liquidity and order in financial markets, particularly during periods of high volatility. Optimal market-makers solve a sequential decision making problem, where they face an exploration versus exploitation dilemma at each time step. A belief state MDP based solution was presented by Das and Magdon-Ismail [2008]. This solution however, was c...

this paper surveys parallel scheduling problems and metrics correlated to and then applys metrics to make decision in comparison to other policy schedulers. parallel processing is new trend in computer science especially in embedded and multicore systems whereas needs more power consumption to reach speed up. the qos requirement for users is to have good responsiveness and for service providers...

This paper provides a replacement policy for warranty products with different failure rate from the consumer’s viewpoint. Assume that the product is replaced once within a finite planning horizon, and the failure rate of the second product is lower than the failure rate of the first product. Within warranty period (WP), the failed product is corrected by minimal repair without any cost to the c...

ABSTRACT The present paper, considered the allocation problem of repairable components for a parallel-series system as a multi-objective optimization problem for two different models. In the first model, the reliability of subsystems are considered as different objectives. While in the second model, the cost and time spent on repairing the components are considered as two different objectives. ...

The problem of sequential vector quantization of a stationary Markov source is cast as an equivalent stochastic control problem with partial observations. This problem is analyzed using the techniques of dynamic programming, leading to a characterization of optimal encoding schemes.

Dynamic Programming

This paper deals with Markov Decision Processes (MDPs) on Borel spaces with an infinite horizon and a discounted total cost. It will be considered a stochastic optimal control problem which arises by perturbing the transition law of a deterministic control problem, through an additive random noise term with coefficient epsilon. In the paper, we will analyze the behavior of the optimal solution ...

This paper presents a sequential optimization technique for the design of optimal trajectories while minimizing a cost index subject to system dynamics, path and actuation constraints. A novel coordinate transformation is introduced to cast the non-convex trajectory generation problem as a convex optimization problem. A sequential linear programming approach is discussed to solve the resulting ...