Sequential decision making and stochastic networks

Abstract

To solve the problems inherent in working with sequential decision processes, it is proposed to (1) utilize concepts of dominance through bounding in the decision processes (DP) formalism to reduce the amount of computing required. This advocates the marrying of DP recursion and Branch-and-Bound methodology; and (2) relax the requirement of strict optimality in the search over the state space, and be content with a tolerable error.