{"id":"https://openalex.org/W2963595662","doi":"https://doi.org/10.23919/acc.2018.8431016","title":"On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering","display_name":"On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2963595662","doi":"https://doi.org/10.23919/acc.2018.8431016","mag":"2963595662"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2018.8431016","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8431016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual 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/A5043334116","display_name":"Lintao Ye","orcid":"https://orcid.org/0000-0001-8608-5815"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lintao Ye","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103231201","display_name":"Sandip Roy","orcid":"https://orcid.org/0000-0002-5558-9698"},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sandip Roy","raw_affiliation_strings":["School of Electrical and Computer Engineering and Computer Science, Washington State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering and Computer Science, Washington State University","institution_ids":["https://openalex.org/I72951846"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076731201","display_name":"Shreyas Sundaram","orcid":"https://orcid.org/0000-0002-5390-2505"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shreyas Sundaram","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6189,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94579613,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5049","last_page":"5054"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9998999834060669,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9998999834060669,"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/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9980999827384949,"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/T10046","display_name":"Stability and Control of Uncertain Systems","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kalman-filter","display_name":"Kalman filter","score":0.781272292137146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6088584661483765},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5667324066162109},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5411590337753296},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5156549215316772},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5112133026123047},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4749177396297455},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45281073451042175},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.446961909532547},{"id":"https://openalex.org/keywords/covariance-matrix","display_name":"Covariance matrix","score":0.4213341772556305},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42080414295196533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3836153745651245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33223530650138855},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12964531779289246}],"concepts":[{"id":"https://openalex.org/C157286648","wikidata":"https://www.wikidata.org/wiki/Q846780","display_name":"Kalman filter","level":2,"score":0.781272292137146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6088584661483765},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5667324066162109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5411590337753296},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5156549215316772},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5112133026123047},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4749177396297455},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45281073451042175},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.446961909532547},{"id":"https://openalex.org/C185142706","wikidata":"https://www.wikidata.org/wiki/Q1134404","display_name":"Covariance matrix","level":2,"score":0.4213341772556305},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42080414295196533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3836153745651245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33223530650138855},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12964531779289246},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2018.8431016","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8431016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1501233054","https://openalex.org/W1680189815","https://openalex.org/W1803898544","https://openalex.org/W1938602245","https://openalex.org/W1963646571","https://openalex.org/W1978978100","https://openalex.org/W1986085795","https://openalex.org/W2003949298","https://openalex.org/W2011039300","https://openalex.org/W2015713866","https://openalex.org/W2028781966","https://openalex.org/W2045333994","https://openalex.org/W2058590322","https://openalex.org/W2100729440","https://openalex.org/W2131824593","https://openalex.org/W2176421236","https://openalex.org/W2582646431","https://openalex.org/W2963595662","https://openalex.org/W2964202295","https://openalex.org/W3003506411","https://openalex.org/W3104345178","https://openalex.org/W6679608865","https://openalex.org/W6696741278"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W4309156034","https://openalex.org/W2962917430","https://openalex.org/W2163115662","https://openalex.org/W2045237525","https://openalex.org/W2028468530","https://openalex.org/W189401716","https://openalex.org/W2898570308"],"abstract_inverted_index":{"Given":[0],"a":[1,129],"linear":[2],"dynamical":[3],"system,":[4],"we":[5,58,82,127],"consider":[6],"the":[7,25,28,35,61,67,71,84,109,123,141],"problem":[8,44,62,142],"of":[9,16,27,34,50,103,122,143],"selecting":[10],"(at":[11],"design-time)":[12],"an":[13],"optimal":[14],"set":[15],"sensors":[17],"(subject":[18],"to":[19,23],"certain":[20,48],"budget":[21],"constraints)":[22],"minimize":[24],"trace":[26],"steady":[29],"state":[30],"error":[31],"covariance":[32],"matrix":[33],"Kalman":[36,148],"filter.":[37],"Previous":[38],"work":[39],"has":[40],"shown":[41],"that":[42,60,87,133],"this":[43,56,96],"is":[45,73,89],"NP-hard":[46,64],"for":[47,66,95,140,147],"classes":[49,102],"systems":[51],"and":[52,75,120],"sensor":[53,77,104,145],"costs;":[54],"in":[55,108],"paper,":[57],"show":[59,83],"remains":[63],"even":[65],"special":[68],"case":[69],"where":[70],"system":[72],"stable":[74],"all":[76],"costs":[78],"are":[79],"identical.":[80],"Furthermore,":[81],"stronger":[85],"result":[86],"there":[88],"no":[90],"constant-factor":[91,114],"(polynomial-time)":[92],"approximation":[93],"algorithm":[94],"problem.":[97],"This":[98],"contrasts":[99],"with":[100],"other":[101],"selection":[105,146],"problems":[106],"studied":[107],"literature,":[110],"which":[111],"typically":[112],"pursue":[113],"approximations":[115],"by":[116],"leveraging":[117],"greedy":[118,134],"algorithms":[119,135],"submodularity":[121],"cost":[124],"function.":[125],"Here,":[126],"provide":[128],"specific":[130],"example":[131],"showing":[132],"can":[136],"perform":[137],"arbitrarily":[138],"poorly":[139],"design-time":[144],"filtering.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}