{"id":"https://openalex.org/W4410536662","doi":"https://doi.org/10.1109/tcomm.2025.3571950","title":"Semantic-Aware Remote Estimation of Multiple Markov Sources Under Constraints","display_name":"Semantic-Aware Remote Estimation of Multiple Markov Sources Under Constraints","publication_year":2025,"publication_date":"2025-05-20","ids":{"openalex":"https://openalex.org/W4410536662","doi":"https://doi.org/10.1109/tcomm.2025.3571950"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2025.3571950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2025.3571950","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007334592","display_name":"Jiping Luo","orcid":"https://orcid.org/0000-0003-0113-5460"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jiping Luo","raw_affiliation_strings":["Department of Computer and Information Science, Link&#x00F6;ping University, Link&#x00F6;ping, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0113-5460","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link&#x00F6;ping University, Link&#x00F6;ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084740578","display_name":"\u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u03a0\u03b1\u03c0\u03c0\u03ac\u03c2","orcid":"https://orcid.org/0000-0003-4416-7702"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Nikolaos Pappas","raw_affiliation_strings":["Department of Computer and Information Science, Link&#x00F6;ping University, Link&#x00F6;ping, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4416-7702","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link&#x00F6;ping University, Link&#x00F6;ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":11.7382,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.9825344,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"73","issue":"11","first_page":"11093","last_page":"11105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9447000026702881,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9447000026702881,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9294999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6577091217041016},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5567412972450256},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5535717606544495},{"id":"https://openalex.org/keywords/estimation","display_name":"Estimation","score":0.5049296021461487},{"id":"https://openalex.org/keywords/reliability-engineering","display_name":"Reliability engineering","score":0.33345043659210205},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2461870014667511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23190000653266907},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2134602963924408},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16727802157402039}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6577091217041016},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5567412972450256},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5535717606544495},{"id":"https://openalex.org/C96250715","wikidata":"https://www.wikidata.org/wiki/Q965330","display_name":"Estimation","level":2,"score":0.5049296021461487},{"id":"https://openalex.org/C200601418","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability engineering","level":1,"score":0.33345043659210205},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2461870014667511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23190000653266907},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2134602963924408},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16727802157402039},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2025.3571950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2025.3571950","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1144593952","https://openalex.org/W1965497192","https://openalex.org/W1970086194","https://openalex.org/W1997020095","https://openalex.org/W2050882265","https://openalex.org/W2106993639","https://openalex.org/W2107872937","https://openalex.org/W2124839177","https://openalex.org/W2125794835","https://openalex.org/W2154204727","https://openalex.org/W2322261970","https://openalex.org/W2922422094","https://openalex.org/W2963230267","https://openalex.org/W2970351449","https://openalex.org/W2970983057","https://openalex.org/W2994803162","https://openalex.org/W3010946786","https://openalex.org/W3013857281","https://openalex.org/W3044209767","https://openalex.org/W3081916982","https://openalex.org/W3114944817","https://openalex.org/W3128965347","https://openalex.org/W3180974649","https://openalex.org/W3204258145","https://openalex.org/W4206497039","https://openalex.org/W4213251304","https://openalex.org/W4226370802","https://openalex.org/W4286377573","https://openalex.org/W4292604000","https://openalex.org/W4301852635","https://openalex.org/W4318762071","https://openalex.org/W4381415989","https://openalex.org/W4386249811","https://openalex.org/W4386260607","https://openalex.org/W4387882836","https://openalex.org/W4388520009","https://openalex.org/W4388836101","https://openalex.org/W4391020658","https://openalex.org/W4403017590","https://openalex.org/W4405056392","https://openalex.org/W4405974566"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W4236062181","https://openalex.org/W2367222340"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2,19],"the":[3,28,37,44,57,89,102,118,132,150,159,166,197,206,209],"remote":[4,38],"estimation":[5,45,64],"of":[6,32,63,111,168,208],"multiple":[7],"Markov":[8,82],"sources":[9],"over":[10],"a":[11,67,78,94,108,123,137,143],"lossy":[12],"and":[13,34,97,101,161,190],"rate-constrained":[14],"channel.":[15],"Unlike":[16],"most":[17],"existing":[18],"that":[20,36,55,88,130,185],"treat":[21],"all":[22],"source":[23,162],"states":[24],"equally,":[25],"we":[26,121,172],"exploit":[27],"<italic":[29,59,79,125,155,177],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[30,60,80,126,156,178],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">semantics":[31],"information</i>":[33],"consider":[35],"actuator":[39],"has":[40],"different":[41],"tolerances":[42],"for":[43],"errors.":[46],"We":[47,86,140],"aim":[48],"to":[49,148],"find":[50],"an":[51,174],"optimal":[52,72,90,103,133,151],"scheduling":[53,73],"policy":[54,104,134,152],"minimizes":[56],"long-term":[58],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">state-dependent</i>":[61],"costs":[62],"errors":[65],"under":[66],"transmission":[68,187],"frequency":[69],"constraint.":[70],"The":[71],"problem":[74],"is":[75,188],"formulated":[76],"as":[77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">constrained":[81],"decision":[83],"process</i>":[84],"(CMDP).":[85],"show":[87,184],"Lagrangian":[91],"cost":[92],"follows":[93],"piece-wise":[95],"linear":[96],"concave":[98],"(PWLC)":[99],"function,":[100],"is,":[105],"at":[106],"most,":[107],"randomized":[109],"mixture":[110],"two":[112],"simple":[113],"deterministic":[114],"policies.":[115],"By":[116],"exploiting":[117,205],"structural":[119],"results,":[120],"develop":[122],"new":[124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">intersection":[127],"search</i>":[128],"algorithm":[129,147],"finds":[131],"using":[135],"only":[136],"few":[138],"iterations.":[139],"further":[141],"propose":[142,173],"reinforcement":[144],"learning":[145],"(RL)":[146],"compute":[149],"without":[153],"knowing":[154],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">a":[157],"priori</i>":[158],"channel":[160],"statistics.":[163],"To":[164],"avoid":[165],"\u201ccurse":[167],"dimensionality\u201d":[169],"in":[170],"MDPs,":[171],"online":[175],"low-complexity":[176],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">drift-plus-penalty</i>":[179],"(DPP)":[180],"algorithm.":[181],"Numerical":[182],"results":[183],"continuous":[186],"inefficient,":[189],"remarkably,":[191],"our":[192],"semantic-aware":[193],"policies":[194],"can":[195],"attain":[196],"optimum":[198],"by":[199,204],"strategically":[200],"utilizing":[201],"fewer":[202],"transmissions":[203],"timing":[207],"important":[210],"information.":[211]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}