A temporally abstracted Viterbi algorithm

Details A temporally abstracted Viterbi algorithm A temporally abstracted Viterbi algorithm

2012-02-14

arxiv.org/abs/1202.3707v1

Computer Science

Artificial Intelligence

Scientific paper

Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how to apply temporal abstraction to the Viterbi problem. Our algorithm uses bounds derived from analysis of coarse timescales to prune large parts of the state trellis at finer timescales. We demonstrate improvements of several orders of magnitude over the standard Viterbi algorithm, as well as significant speedups over CFDP, for problems whose state variables evolve at widely differing rates.

Affiliated with

Also associated with

No associations

Rating

A temporally abstracted Viterbi algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A temporally abstracted Viterbi algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A temporally abstracted Viterbi algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90368