{"title":"用于远程状态估计的随机在线传感器调度","authors":"Junfeng Wu, Yilin Mo, Ling Shi","doi":"10.1109/CPSNA.2013.6614251","DOIUrl":null,"url":null,"abstract":"In this paper, a remote state estimation problem where a sensor measures the state of a linear discrete-time process in an infinite time horizon is considered. We aim to minimize the average estimation error subject to a limited sensor-estimator communication rate. We propose a stochastic online sensor schedule: whether or not the sensor sends data is based on its measurements and a stochastic holding time between the present and the most recent sensor-estimator communication instance. This decision process is formulated as a generalized geometric programming (GGP) optimization problem. It can be solved with a tractable computational complexity and provides a better performance compared with the optimal offline schedule. Numerical example is provided to illustrate main results.","PeriodicalId":212743,"journal":{"name":"2013 IEEE 1st International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Stochastic online sensor scheduler for remote state estimation\",\"authors\":\"Junfeng Wu, Yilin Mo, Ling Shi\",\"doi\":\"10.1109/CPSNA.2013.6614251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a remote state estimation problem where a sensor measures the state of a linear discrete-time process in an infinite time horizon is considered. We aim to minimize the average estimation error subject to a limited sensor-estimator communication rate. We propose a stochastic online sensor schedule: whether or not the sensor sends data is based on its measurements and a stochastic holding time between the present and the most recent sensor-estimator communication instance. This decision process is formulated as a generalized geometric programming (GGP) optimization problem. It can be solved with a tractable computational complexity and provides a better performance compared with the optimal offline schedule. Numerical example is provided to illustrate main results.\",\"PeriodicalId\":212743,\"journal\":{\"name\":\"2013 IEEE 1st International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 1st International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CPSNA.2013.6614251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 1st International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CPSNA.2013.6614251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Stochastic online sensor scheduler for remote state estimation
In this paper, a remote state estimation problem where a sensor measures the state of a linear discrete-time process in an infinite time horizon is considered. We aim to minimize the average estimation error subject to a limited sensor-estimator communication rate. We propose a stochastic online sensor schedule: whether or not the sensor sends data is based on its measurements and a stochastic holding time between the present and the most recent sensor-estimator communication instance. This decision process is formulated as a generalized geometric programming (GGP) optimization problem. It can be solved with a tractable computational complexity and provides a better performance compared with the optimal offline schedule. Numerical example is provided to illustrate main results.