Optimal self-driven sampling for estimation based on value of information

T. Soleymani, S. Hirche, J. Baras
{"title":"Optimal self-driven sampling for estimation based on value of information","authors":"T. Soleymani, S. Hirche, J. Baras","doi":"10.1109/WODES.2016.7497846","DOIUrl":null,"url":null,"abstract":"Consider an observer (reporter) who desires to inform optimally a distant agent regarding a physical stochastic process in the environment while the directed communication of the observer to the agent has a price. We define a metric, from a task oriented perspective, for the information transferred from the observer to the agent. We develop a framework for optimizing an augmented cost function which is a convex combination of the transferred information and the paid price over a finite horizon. We suppose that the decision making takes place inside a source encoder, and that the sampling schedule is the decision variable. Moreover, we assume that no measurement at the current time is available to the observer for the decision making. We derive the optimal self-driven sampling policy using dynamic programming, and we show that this policy corresponds to a self-driven sampling policy based on a quantity that is in fact the value of information at each time instant. In addition, we use a semi-definite programming relaxation to provide a suboptimal sampling policy. Numerical and simulation results are presented for a simple unstable system.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 13th International Workshop on Discrete Event Systems (WODES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2016.7497846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

Consider an observer (reporter) who desires to inform optimally a distant agent regarding a physical stochastic process in the environment while the directed communication of the observer to the agent has a price. We define a metric, from a task oriented perspective, for the information transferred from the observer to the agent. We develop a framework for optimizing an augmented cost function which is a convex combination of the transferred information and the paid price over a finite horizon. We suppose that the decision making takes place inside a source encoder, and that the sampling schedule is the decision variable. Moreover, we assume that no measurement at the current time is available to the observer for the decision making. We derive the optimal self-driven sampling policy using dynamic programming, and we show that this policy corresponds to a self-driven sampling policy based on a quantity that is in fact the value of information at each time instant. In addition, we use a semi-definite programming relaxation to provide a suboptimal sampling policy. Numerical and simulation results are presented for a simple unstable system.
基于信息值估计的最优自驱动抽样
考虑一个观察者(报告者),他希望将环境中的物理随机过程以最佳方式通知远程代理,而观察者与代理的直接通信是有价格的。我们从面向任务的角度定义了从观察者到代理传递的信息的度量。我们开发了一个优化增广成本函数的框架,该函数是有限范围内传递信息和支付价格的凸组合。我们假设决策是在源编码器内部进行的,并且采样计划是决策变量。此外,我们假设在当前的时间没有测量是可供决策的观察者使用的。我们使用动态规划导出了最优的自驱动抽样策略,并证明了该策略对应于基于数量的自驱动抽样策略,该数量实际上是每个时刻的信息值。此外,我们使用半确定规划松弛来提供次优抽样策略。给出了一个简单的不稳定系统的数值和仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信