Suboptimality Bounds for Stochastic Shortest Path Problems

Details Suboptimality Bounds for Stochastic Shortest Path Problems Suboptimality Bounds for Stochastic Shortest Path Problems

2012-02-14

arxiv.org/abs/1202.3729v1

Computer Science

Artificial Intelligence

Scientific paper

We consider how to use the Bellman residual of the dynamic programming operator to compute suboptimality bounds for solutions to stochastic shortest path problems. Such bounds have been previously established only in the special case that "all policies are proper," in which case the dynamic programming operator is known to be a contraction, and have been shown to be easily computable only in the more limited special case of discounting. Under the condition that transition costs are positive, we show that suboptimality bounds can be easily computed even when not all policies are proper. In the general case when there are no restrictions on transition costs, the analysis is more complex. But we present preliminary results that show such bounds are possible.

Affiliated with

Also associated with

No associations

Rating

Suboptimality Bounds for Stochastic Shortest Path Problems 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 Suboptimality Bounds for Stochastic Shortest Path Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Suboptimality Bounds for Stochastic Shortest Path Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90485