Solving Partially Observable Markov Decision Processes (POMDPs) generally is computationally intractable. In this paper, we study a special POMDP class, namely informative POMDPs, where each observation provides good albeit incomplete information about world states. We propose two ways to accelerate value iteration algorithm for such POMDPs. First, dynamic programming (DP) updates can be carrie...

Container movement by trucks with time constraints at origins and destinations is modeled as an asymmetric “multi-Traveling Salesmen Problem with Time Windows” (mTSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes for a fleet of trucks. Since the m-TSPTW problem is NP-hard, the computational time for optimally solv...

Equivalent consumption minimization strategy (ECMS) is one of the main real-time control strategies for hybrid electric vehicles (HEVs). This paper proposes a method to modify this strategy. This modification reduces calculation time of ECMS and therefore, facilitates its application as the real-time controller. Dynamic programming (DP) method is employed to reach this aim. This method is appli...

Container movement by trucks with time constraints at origins and destinations is modeled as an asymmetric ‘‘multi-Traveling Salesmen Problem with Time Windows’’ (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes for a fleet of trucks. Since the m-TSPTW problem is NP-hard, the computational time for optimally s...

This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modi ed dynamic programming (DP) algorithm, called the iterated complete path (ICP) algorithm, that is intended for use with separable source models. A set of heuristic functions are presented for decoding formatted ...

In the power system operations, the economic load dispatch of thermal generating system is among one of the most important problems.Recent global inclination towards the utilization of more and more renewable energy makes this problem important than ever. In this work, the economic dispatch of thermal and PV system with battery storage is carried out. Here Unit Commitment (UC) using Dynamic Pro...

Selective quickest spectrum sensing, which monitors the spectrum activity in multiple channels, is studied for multichannel cognitive radio systems with nonnegligible channel switching time (blind period). The spectrum sensor needs to detect the emergence of primary users as quickly as possible. Due to hardware limitation, it is assumed that only a subset of frequency channels can be monitored ...

For pitch tracking of a single speaker, a common requirement is to find the optimal path through a set of voiced or voiceless pitch estimates over a sequence of time frames. Dynamic programming (DP) algorithms have been applied before to this problem. Here, the pitch candidates are provided by a multi-channel autocorrelation-based estimator, and DP is extended to pitch tracking of multiple conc...

The success of skeletal model in object recognition from segmented images motivates the development of a skeletal model for top-down object recognition and segmentation. We propose a novel skeleton-based generative shape model which is suitable for efficient search using dynamic programming (DP). We have devised an exclusion principle enabling DP to discover multiple instances of an object cate...

Many dynamic programming algorithms are “pure” in that they only use min or max and addition operations in their recursion equations. The well known greedy algorithm of Kruskal solves the minimum weight spanning tree problem on n-vertex graphs using only O(n logn) operations. We prove that any pure DP algorithm for this problem must perform 2 operations. Since the greedy algorithm can also badl...