{"id":"https://openalex.org/W3188388755","doi":"https://doi.org/10.23919/acc53348.2022.9867459","title":"A Linear Programming Approach to the Minimum Cost Sparsest Input Selection for Structured Systems","display_name":"A Linear Programming Approach to the Minimum Cost Sparsest Input Selection for Structured Systems","publication_year":2022,"publication_date":"2022-06-08","ids":{"openalex":"https://openalex.org/W3188388755","doi":"https://doi.org/10.23919/acc53348.2022.9867459","mag":"3188388755"},"language":"en","primary_location":{"id":"doi:10.23919/acc53348.2022.9867459","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc53348.2022.9867459","pdf_url":null,"source":{"id":"https://openalex.org/S4363607732","display_name":"2022 American Control Conference (ACC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 American Control Conference (ACC)","raw_type":"proceedings-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/A5100858323","display_name":"Yuan Zhang","orcid":"https://orcid.org/0000-0002-4630-0450"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuan Zhang","raw_affiliation_strings":["Beijing Institute of Technology,School of Automation,Beijing,China","School of Automation, Beijing Institute of Technology, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology,School of Automation,Beijing,China","institution_ids":["https://openalex.org/I125839683"]},{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064231378","display_name":"Yuanqing Xia","orcid":"https://orcid.org/0000-0002-5977-4911"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanqing Xia","raw_affiliation_strings":["Beijing Institute of Technology,School of Automation,Beijing,China","School of Automation, Beijing Institute of Technology, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology,School of Automation,Beijing,China","institution_ids":["https://openalex.org/I125839683"]},{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058268261","display_name":"Yufeng Zhan","orcid":"https://orcid.org/0000-0002-4528-1489"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yufeng Zhan","raw_affiliation_strings":["Beijing Institute of Technology,School of Automation,Beijing,China","School of Automation, Beijing Institute of Technology, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology,School of Automation,Beijing,China","institution_ids":["https://openalex.org/I125839683"]},{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100858323"],"corresponding_institution_ids":["https://openalex.org/I125839683"],"apc_list":null,"apc_paid":null,"fwci":0.259,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.30033003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1453","last_page":"1458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9700000286102295,"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/T10409","display_name":"Fuel Cells and Related Materials","score":0.9434999823570251,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/integer-programming","display_name":"Integer programming","score":0.6854960918426514},{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.6801363229751587},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6534988880157471},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6495742797851562},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6063151955604553},{"id":"https://openalex.org/keywords/controllability","display_name":"Controllability","score":0.5215468406677246},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4934023916721344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4769660234451294},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.423276424407959},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.391487717628479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.18576958775520325}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6854960918426514},{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.6801363229751587},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6534988880157471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6495742797851562},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6063151955604553},{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.5215468406677246},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4934023916721344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4769660234451294},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.423276424407959},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.391487717628479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18576958775520325},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc53348.2022.9867459","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc53348.2022.9867459","pdf_url":null,"source":{"id":"https://openalex.org/S4363607732","display_name":"2022 American Control Conference (ACC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1684346447","https://openalex.org/W1766210857","https://openalex.org/W1834582464","https://openalex.org/W1930354283","https://openalex.org/W1938602245","https://openalex.org/W1963646571","https://openalex.org/W1971604476","https://openalex.org/W2003949298","https://openalex.org/W2073647817","https://openalex.org/W2101420429","https://openalex.org/W2106308430","https://openalex.org/W2125690626","https://openalex.org/W2129579944","https://openalex.org/W2296217093","https://openalex.org/W2582646431","https://openalex.org/W2784294807","https://openalex.org/W2806627614","https://openalex.org/W2886293627","https://openalex.org/W2963613986","https://openalex.org/W3080804602","https://openalex.org/W3100920159","https://openalex.org/W3105930213","https://openalex.org/W4213255380","https://openalex.org/W4242973052","https://openalex.org/W4250589301","https://openalex.org/W6603474794","https://openalex.org/W7061639689"],"related_works":["https://openalex.org/W2753007631","https://openalex.org/W4252122881","https://openalex.org/W1623845008","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1973873435","https://openalex.org/W2951295184","https://openalex.org/W4244487479","https://openalex.org/W1963627056"],"abstract_inverted_index":{"In":[0,141],"this":[1,142],"paper,":[2,143],"we":[3,144,181],"consider":[4],"three":[5],"related":[6],"cost-sparsity":[7],"induced":[8],"optimal":[9],"input":[10,32,37,63,70,75,109,113,162],"selection":[11],"problems":[12,55,124,147,176,211],"for":[13,209],"structural":[14,96],"controllability":[15,97],"using":[16],"a":[17,30,41,90,117,156,202],"unifying":[18,203],"linear":[19,151],"programming":[20,152],"(LP)":[21],"framework.":[22],"More":[23],"precisely,":[24],"given":[25],"an":[26,36],"autonomous":[27],"system":[28],"and":[29,72,122,194],"constrained":[31,136],"configuration":[33],"where":[34],"whether":[35],"can":[38,114,185],"directly":[39],"actuate":[40,115],"state":[42,118],"variable,":[43],"as":[44,46,80,82,148],"well":[45],"the":[47,54,59,66,74,78,99,107,120,133,160,167,173,191,196,222,225,230],"corresponding":[48,197],"(possibly":[49],"different)":[50],"cost,":[51],"is":[52,87,138,221],"prescribed,":[53],"are,":[56],"respectively,":[57],"selecting":[58,65,73],"minimum":[60,67],"number":[61],"of":[62,69,98,166,229],"links,":[64,71],"cost":[68,79],"links":[76],"with":[77,171,212],"small":[81],"possible":[83],"while":[84,132],"their":[85],"cardinality":[86],"not":[88],"exceeding":[89],"prescribed":[91,161],"number,":[92],"all":[93],"to":[94,218],"ensure":[95],"resulting":[100],"systems.":[101],"Current":[102],"studies":[103],"show":[104,182],"that":[105,224],"in":[106],"dedicated":[108],"case":[110,137],"(i.e.,":[111],"each":[112],"only":[116],"variable),":[119],"first":[121,174],"second":[123],"are":[125,177,232],"polynomially":[126,179],"solvable":[127],"by":[128,188],"some":[129],"graphtheoretic":[130],"algorithms,":[131],"general":[134],"nontrivial":[135],"largely":[139],"unexploited.":[140],"formulate":[145],"these":[146,183,210],"equivalent":[149],"integer":[150,192],"(ILP)":[153],"problems.":[154],"Under":[155],"weaker":[157],"constraint":[158,227],"on":[159],"configurations":[163],"than":[164,207],"most":[165],"currently":[168],"known":[169],"ones":[170],"which":[172],"two":[175],"reportedly":[178],"solvable,":[180],"ILPs":[184,231],"be":[186],"solved":[187],"simply":[189],"removing":[190],"constraints":[193],"solving":[195],"LP":[198],"relaxations,":[199],"thus":[200],"providing":[201],"algebraic":[204],"method,":[205],"rather":[206],"graph-theoretic,":[208],"polynomial":[213],"time":[214],"complexity.":[215],"The":[216],"key":[217],"our":[219],"approach":[220],"observation":[223],"respective":[226],"matrices":[228],"totally":[233],"unimodular.":[234]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}