{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:15:55Z","timestamp":1759331755769,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:00:00Z","timestamp":1692835200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:00:00Z","timestamp":1692835200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8,24]]},"DOI":"10.23919\/wiopt58741.2023.10349881","type":"proceedings-article","created":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T19:18:56Z","timestamp":1703272736000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Age-of-Information Minimization for Energy Harvesting Sensor in Non-Stationary Environment"],"prefix":"10.23919","author":[{"given":"Akanksha","family":"Jaiswal","sequence":"first","affiliation":[{"name":"Indian Institute of Technology,Department of Electrical Engineering,Delhi"}]},{"given":"Arpan","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"Bharti School of Telecom Technology and Management, Indian Institute of Technology,Department of Electrical Engineering,Delhi"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154220"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517831"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2991992"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3114681"},{"key":"ref6","article-title":"Learning to minimize age of information over an unreliable channel with energy harvesting","author":"Ceran","year":"2021","journal-title":"arXiv preprint"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174054"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467053"},{"key":"ref9","article-title":"A sliding-window algorithm for markov decision processes with arbitrarily changing rewards and transitions","author":"Gajane","year":"2018","journal-title":"arXiv preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2023.4704"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3118037"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TGCN.2017.2778501"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437573"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2916097"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TGCN.2021.3092272"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Machine learning"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref19","article-title":"On upper-confidence bound policies for non-stationary bandit problems","author":"Garivier","year":"2008","journal-title":"arXiv preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11407"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3261050"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11746"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/2200000070"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref25","article-title":"Near-optimal regret bounds for reinforcement learning","volume":"21","author":"Auer","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref26","article-title":"Online markov decision processes with time-varying transition probabilities and rewards","volume":"3","author":"Li","year":"2019","journal-title":"ICML work-shop on Real-world Sequential Decision Making"},{"issue":"1","key":"ref27","first-page":"1582","article-title":"Addressing environment non-stationarity by repeating q-learning updates","volume":"17","author":"Abdallah","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01758-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25900"},{"article-title":"Dynamic programming and optimal control 3rd edition, volume ii","volume-title":"Belmont, MA: Athena Scientific, 2011","author":"Bertsekas","key":"ref30"},{"key":"ref31","first-page":"6743","article-title":"Dynamic regret of policy optimization in non-stationary environments","volume":"33","author":"Fei","year":"2020","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","start":{"date-parts":[[2023,8,24]]},"location":"Singapore, Singapore","end":{"date-parts":[[2023,8,27]]}},"container-title":["2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10349702\/10349703\/10349881.pdf?arnumber=10349881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T01:14:30Z","timestamp":1705022070000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10349881\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,24]]},"references-count":31,"URL":"https:\/\/doi.org\/10.23919\/wiopt58741.2023.10349881","relation":{},"subject":[],"published":{"date-parts":[[2023,8,24]]}}}