-
33浏览
-
0点赞
-
0收藏
-
0分享
-
117下载
-
0评论
-
引用
期刊论文
A Method based on Kolmogorov Complexity to Improve the Efficiency of Strategy Optimization with Limited Memory Space
Proceedings of the 2006 American Control Conference Minneapolis, Minnesota, USA, June 14-16, 2006,-0001,():
The pervasive application of digital computer in control and optimization techniques forces us to consider the constraint of limited memory space when dealing with large scale practical systems. As an example, we consider the famous Witsenhausen counterexample with the new constraint of limited memory space in this paper. The main difficulty is how to sample strategies that can be stored in the given memory space efficiently. The concept of Kolmogorov complexity measures the minimal memory space to store a strategy (i.e., simple strategies), but is incomputable. To overcome this difficulty, we propose a method based on ordered binary decision diagram to sample only simple strategies. Besides the high sampling efficiency which is demonstrated by numerical testing, the proposed sampling method can be easily combined with optimization algorithms and performance evaluation techniques. As an example, we show how to combine ordinal optimization, numerical integration, and the proposed sampling method to solve the Witsenhausen problem with the constraint of limited memory space. We hope this work can shed some insights to computer-based optimization problems with memory space constraint in a more general situation.
【免责声明】以下全部内容由[贾庆山]上传于[2008年03月19日 17时23分52秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果