Loading [a11y]/accessibility-menu.js
A geometric slicing lower bound for average-cost dynamic programming | IEEE Conference Publication | IEEE Xplore

A geometric slicing lower bound for average-cost dynamic programming


Abstract:

A geometric slicing idea is proposed to lower bound infinite-horizon average-cost dynamic programs. The idea divides an infinite-horizon problem into finite-horizon ones ...Show More

Abstract:

A geometric slicing idea is proposed to lower bound infinite-horizon average-cost dynamic programs. The idea divides an infinite-horizon problem into finite-horizon ones with discounted cost. The idea is applied to control-over-communication-channel problems to find a fundamental limit of such systems. Lower bounds on the performance are given in terms of the capacity of the channel. The lower bounds are compared with explicit control strategies to provide quantitative and qualitative understanding about the strategies.
Date of Conference: 10-13 December 2013
Date Added to IEEE Xplore: 10 March 2014
ISBN Information:
Print ISSN: 0191-2216
Conference Location: Firenze, Italy

References

References is not available for this document.