{"id":"https://openalex.org/W7140817680","doi":"https://doi.org/10.1109/ieeeconf67917.2025.11443874","title":"Solving the Goal-Oriented Communication Problem through Policy-Level Constrained Programming","display_name":"Solving the Goal-Oriented Communication Problem through Policy-Level Constrained Programming","publication_year":2025,"publication_date":"2025-10-26","ids":{"openalex":"https://openalex.org/W7140817680","doi":"https://doi.org/10.1109/ieeeconf67917.2025.11443874"},"language":"en","primary_location":{"id":"doi:10.1109/ieeeconf67917.2025.11443874","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeeconf67917.2025.11443874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 59th Asilomar Conference on Signals, Systems, and Computers","raw_type":"proceedings-article"},"type":"conference-paper","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/A5031458924","display_name":"Federico Chiariotti","orcid":"https://orcid.org/0000-0002-7915-7275"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Chiariotti","raw_affiliation_strings":["University of Padova,Department of Information Engineering,Padua,Italy,35131"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padova,Department of Information Engineering,Padua,Italy,35131","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130713251","display_name":"Pietro Talli","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pietro Talli","raw_affiliation_strings":["University of Padova,Department of Information Engineering,Padua,Italy,35131"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padova,Department of Information Engineering,Padua,Italy,35131","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061523718","display_name":"Federico Mason","orcid":"https://orcid.org/0000-0001-5681-1695"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Mason","raw_affiliation_strings":["University of Padova,Department of Information Engineering,Padua,Italy,35131"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padova,Department of Information Engineering,Padua,Italy,35131","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130691232","display_name":"Andrea Zanella","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Zanella","raw_affiliation_strings":["University of Padova,Department of Information Engineering,Padua,Italy,35131"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padova,Department of Information Engineering,Padua,Italy,35131","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1157","last_page":"1161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.25459998846054077,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.25459998846054077,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0812000036239624,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.05590000003576279,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.3682999908924103},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.3160000145435333},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.30970001220703125},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.2766000032424927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607699990272522},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3682999908924103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3434000015258789},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28529998660087585},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2791000008583069},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2761000096797943},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2599000036716461}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ieeeconf67917.2025.11443874","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeeconf67917.2025.11443874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 59th Asilomar Conference on Signals, Systems, and Computers","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3593718","is_oa":false,"landing_page_url":"https://hdl.handle.net/11577/3593718","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1966349642","https://openalex.org/W2134293360","https://openalex.org/W2142505627","https://openalex.org/W2963718773","https://openalex.org/W2978725006","https://openalex.org/W3176048614","https://openalex.org/W3204192621","https://openalex.org/W4313455370","https://openalex.org/W4393906088","https://openalex.org/W4394585814","https://openalex.org/W4409310580","https://openalex.org/W7124240801"],"related_works":[],"abstract_inverted_index":{"A":[0],"prototypal":[1],"goal-oriented":[2],"communication":[3],"system":[4,46],"consists":[5],"of":[6,14,36,62,67,79,93,153],"a":[7,15,21,51,118,161,173,178,186],"transmitter":[8,110],"agent":[9,23],"that":[10,24,160],"observes":[11],"the":[12,29,34,37,41,60,63,65,77,80,91,94,101,106,109,150,154],"state":[13,81],"process":[16,38,42],"and":[17,71],"communicates":[18],"it":[19],"to":[20,32,90,99,121,139],"receiver":[22,107],"takes":[25],"actions":[26],"based":[27],"on":[28],"information":[30,103],"received":[31],"affect":[33],"behavior":[35],"itself.":[39],"If":[40],"is":[43,88],"Markovian,":[44],"this":[45,114],"can":[47,167],"be":[48],"modeled":[49],"as":[50,127],"remote":[52,123],"Partially":[53],"Observable":[54],"Markov":[55],"Decision":[56],"Process":[57],"(POMDP).":[58],"Despite":[59],"simplicity":[61],"scenario,":[64],"complexity":[66,152],"finding":[68],"optimal":[69],"transmission":[70],"control":[72],"policies":[73],"grows":[74],"exponentially":[75],"with":[76],"size":[78],"space,":[82],"calling":[83],"for":[84,144],"heuristic":[85],"solutions.":[86],"This":[87],"due":[89],"interplay":[92],"agents\u2019":[95],"strategies,":[96],"which":[97,181],"need":[98],"consider":[100],"implicit":[102],"acquired":[104],"by":[105,130],"when":[108],"stays":[111],"silent.":[112],"In":[113,156],"paper,":[115],"we":[116,158],"propose":[117],"new":[119],"way":[120],"optimize":[122],"POMDPs,":[124],"posing":[125],"them":[126],"single-agent":[128],"problems":[129],"introducing":[131],"policy-level":[132],"constraints.":[133],"The":[134],"proposed":[135],"formulation":[136],"allows":[137],"us":[138],"adopt":[140],"standard":[141],"optimization":[142],"tools":[143],"quadratically-constrained":[145],"linear":[146],"programming,":[147],"significantly":[148],"reducing":[149],"computational":[151,175],"task.":[155],"particular,":[157],"show":[159],"Disciplined":[162],"Convex-Concave":[163],"Programming":[164],"(DCCP)":[165],"approach":[166],"perform":[168],"near":[169],"optimally":[170],"while":[171],"maintaining":[172],"manageable":[174],"burden":[176],"in":[177,180],"scenario":[179],"policy":[182],"iteration-based":[183],"heuristics":[184],"have":[185],"wide":[187],"optimality":[188],"gap.":[189]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-27T00:00:00"}