{"id":"https://openalex.org/W4382936066","doi":"https://doi.org/10.23919/acc55779.2023.10156299","title":"On the Complexity and Approximability of Optimal Sensor Selection for Mixed-Observable Markov Decision Processes","display_name":"On the Complexity and Approximability of Optimal Sensor Selection for Mixed-Observable Markov Decision Processes","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4382936066","doi":"https://doi.org/10.23919/acc55779.2023.10156299"},"language":"en","primary_location":{"id":"doi:10.23919/acc55779.2023.10156299","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/acc55779.2023.10156299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 American Control Conference (ACC)","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/A5003281480","display_name":"Jayanth Bhargav","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jayanth Bhargav","raw_affiliation_strings":["Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101793459","display_name":"Mahsa Ghasemi","orcid":"https://orcid.org/0000-0003-4302-4806"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahsa Ghasemi","raw_affiliation_strings":["Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076731201","display_name":"Shreyas Sundaram","orcid":"https://orcid.org/0000-0002-5390-2505"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shreyas Sundaram","raw_affiliation_strings":["Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07757592,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3332","last_page":"3337"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9972000122070312,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9961000084877014,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7159161567687988},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6343114972114563},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6129010319709778},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5562341213226318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5543345212936401},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5402661561965942},{"id":"https://openalex.org/keywords/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.5194261074066162},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4949485659599304},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4846659004688263},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.47749635577201843},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4495465159416199},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.42592722177505493},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4243071675300598},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.39019420742988586},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3673786520957947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3136439323425293},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.26919353008270264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2642224133014679},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11860743165016174},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08062049746513367}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7159161567687988},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6343114972114563},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6129010319709778},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5562341213226318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5543345212936401},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5402661561965942},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.5194261074066162},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4949485659599304},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4846659004688263},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.47749635577201843},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4495465159416199},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.42592722177505493},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4243071675300598},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.39019420742988586},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3673786520957947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3136439323425293},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.26919353008270264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2642224133014679},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11860743165016174},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08062049746513367},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc55779.2023.10156299","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/acc55779.2023.10156299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1517928915","https://openalex.org/W1525605957","https://openalex.org/W1532688806","https://openalex.org/W1680189815","https://openalex.org/W1964150751","https://openalex.org/W2032100464","https://openalex.org/W2088830459","https://openalex.org/W2099430963","https://openalex.org/W2106685773","https://openalex.org/W2119940423","https://openalex.org/W2123651102","https://openalex.org/W2410401331","https://openalex.org/W2582646431","https://openalex.org/W2586732548","https://openalex.org/W2596846716","https://openalex.org/W2604176721","https://openalex.org/W2801358835","https://openalex.org/W2949905447","https://openalex.org/W3011038560","https://openalex.org/W3011416673","https://openalex.org/W3013678595","https://openalex.org/W3100843649","https://openalex.org/W3133382421","https://openalex.org/W3185469915","https://openalex.org/W4288773398","https://openalex.org/W6629490593","https://openalex.org/W6631046737","https://openalex.org/W6631722374","https://openalex.org/W6631864160","https://openalex.org/W6735112817"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W2968699064","https://openalex.org/W3204684126","https://openalex.org/W4389478405","https://openalex.org/W2735578456","https://openalex.org/W2963059222","https://openalex.org/W3008838497","https://openalex.org/W2901206941"],"abstract_inverted_index":{"Mixed-Observable":[0],"Markov":[1],"Decision":[2],"Processes":[3],"(MOMDPs)":[4],"are":[5],"used":[6],"to":[7,33,57,89,93,116],"model":[8],"systems":[9],"where":[10,49,62,150],"the":[11,28,47,60,77,95,100,122,145,151,178,188,209],"state":[12,25,40,68],"space":[13,20],"can":[14,120,154],"be":[15],"decomposed":[16],"as":[17],"a":[18,22,36,52,66,72,132],"product":[19],"of":[21,24,38,54,79,84,99,144,164,211],"set":[23,53,83],"variables,":[26],"and":[27,70,102,138,173],"controlling":[29],"agent":[30,101],"is":[31,109],"able":[32],"measure":[34],"only":[35],"subset":[37],"those":[39],"variables.":[41],"In":[42,200],"this":[43,105],"paper,":[44],"we":[45,50,159],"consider":[46],"setting":[48],"have":[51],"potential":[55],"sensors":[56,85],"select":[58],"for":[59,86,125,135,184,197,208,217],"MOMDP,":[61],"each":[63],"sensor":[64,106,147,166,213],"measures":[65],"certain":[67,90],"variable":[69],"has":[71,114],"selection":[73,148,167,214],"cost.":[74],"We":[75,129],"formulate":[76],"problem":[78,108,149,210],"selecting":[80],"an":[81,117],"optimal":[82,123,212],"MOMDPs":[87],"(subject":[88],"budget":[91],"constraints)":[92],"maximize":[94],"expected":[96],"infinite-horizon":[97],"reward":[98],"show":[103,139,174],"that":[104,119,140,190],"placement":[107],"NP-Hard,":[110],"even":[111],"when":[112],"one":[113,191],"access":[115],"oracle":[118],"compute":[121],"policy":[124],"any":[126],"given":[127],"instance.":[128],"then":[130],"study":[131],"greedy":[133,152,165,179],"algorithm":[134,153,180],"approximate":[136],"optimization":[137],"there":[141],"exist":[142],"instances":[143,172],"MOMDP":[146,171],"perform":[155],"arbitrarily":[156],"poorly.":[157],"Finally,":[158],"provide":[160,193],"some":[161],"empirical":[162],"results":[163,207],"over":[168],"randomly":[169],"generated":[170],"that,":[175],"in":[176],"practice,":[177],"provides":[181],"near-optimal":[182],"solutions":[183],"many":[185],"cases,":[186],"despite":[187],"fact":[189],"cannot":[192],"general":[194],"theoretical":[195],"guarantees":[196],"its":[198],"performance.":[199],"total,":[201],"our":[202],"work":[203],"establishes":[204],"fundamental":[205],"complexity":[206],"(at":[215],"design-time)":[216],"MOMDPs.":[218]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}