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 MoreMetadata
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.
Published in: 52nd IEEE Conference on Decision and Control
Date of Conference: 10-13 December 2013
Date Added to IEEE Xplore: 10 March 2014
ISBN Information:
Print ISSN: 0191-2216