Dynamic programming is usually regarded as a design technique, where each application is designed as an individual program. This contrasts with other techniques such as linear programming, where there exists a single generic program that solves all instances. From a software engineering perspective, the lack of a generic solution to dynamic programming is somewhat unsatisfactory. It would be mu...

Dynamic constraint satisfaction is a useful tool for representing and solving sequential decision problems with complete knowledge in dynamic world. We propose an extension of the dynamic constraint satisfaction framework so as to represent stochastic events in sequential decision making. The basis of this extension consists in modeling evolution of the dynamic constraint satisfaction problem b...

We consider a partially observable Markov decision problem (POMDP) that models a class of sequencing problems. Although POMDPs are typically intractable, our formulation admits tractable solution. Instead of maintaining a value function over a high-dimensional set of belief states, we reduce the state space to one of smaller dimension, in which grid-based dynamic programming techniques are effe...

A symbolic dynamic programming approach for solving first-order Markov decision processes within the situation calculus is presented. As an alternative specification language for dynamic worlds the fluent calculus is chosen and the fluent calculus formalization of the symbolic dynamic programming approach is provided. The major constructs of Markov decision processes such as the optimal value f...

The purpose of this study is to analyze the behavior some industrial systems in light cost-free warranty policy. According policy, we assume that repairman not always present system. When active unit fails, will be called visit system; however, administrative procedures may delay for time. Once on system, first inspects whether fault caused by user or and it repairable not. product laws, carrie...

this study develops a long run optimal pattern for nomadic ranchers of fars province under climate uncertainty by simulating dynamic process of livestock and forage productivity as well as employing dynamic stochastic programming. results indicate that the nomadic representatives do not perform, optimally. despite their attachments to livestock as an asset, and their life dependency on livestoc...

We consider a repairable system such that different completeness degrees are possible for the repair (or corrective maintenance) that go from a `minimal' up to a `complete' repair. Our question is: to what extent must the system be repaired in case of failure for the long-run availability to be optimal? The system evolves in time according to a Markov process as long as it is running, whereas t...

Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and packing. As an application of this bridge, some optimal locally repairable codes can be obtained by packings, which gives optimal locally repairable codes with flexible parameters. Index Terms Distributed storage, loc...

We consider a dynamic team of communicating decision makers performing Bayesian sequential multihypothesis testing under nonstationary observations. A simple decision rule is shown to be memberby-member optimal if the observations are uniformly distributed, if the observation costs are defined to reflect the quality of observations, and if ‘‘vague’’ terminal decisions are allowed without additi...