{"id":"https://openalex.org/W4413392707","doi":"https://doi.org/10.23919/acc63710.2025.11108039","title":"An ADMM-inspired Algorithm for Sensor Selection and Scheduling with Routing Constraints","display_name":"An ADMM-inspired Algorithm for Sensor Selection and Scheduling with Routing Constraints","publication_year":2025,"publication_date":"2025-07-08","ids":{"openalex":"https://openalex.org/W4413392707","doi":"https://doi.org/10.23919/acc63710.2025.11108039"},"language":"en","primary_location":{"id":"doi:10.23919/acc63710.2025.11108039","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc63710.2025.11108039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5049980144","display_name":"Neil K. Dhingra","orcid":"https://orcid.org/0000-0001-8995-9135"},"institutions":[{"id":"https://openalex.org/I4210091604","display_name":"Health Innovations (United States)","ror":"https://ror.org/00darzp70","country_code":"US","type":"company","lineage":["https://openalex.org/I4210091604"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neil K. Dhingra","raw_affiliation_strings":["Auria Innovations,Boulder,CO,USA"],"affiliations":[{"raw_affiliation_string":"Auria Innovations,Boulder,CO,USA","institution_ids":["https://openalex.org/I4210091604"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049980144"],"corresponding_institution_ids":["https://openalex.org/I4210091604"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29074206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1611","last_page":"1616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9832000136375427,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9832000136375427,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7497020959854126},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.58418869972229},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5422505140304565},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46856003999710083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3482853174209595},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3424834907054901},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2670937180519104},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2442573606967926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10201019048690796}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7497020959854126},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.58418869972229},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5422505140304565},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46856003999710083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3482853174209595},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3424834907054901},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2670937180519104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2442573606967926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10201019048690796}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc63710.2025.11108039","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc63710.2025.11108039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1559169059","https://openalex.org/W1621047323","https://openalex.org/W1966089070","https://openalex.org/W1980183459","https://openalex.org/W1993645048","https://openalex.org/W2013943064","https://openalex.org/W2058590322","https://openalex.org/W2073233149","https://openalex.org/W2169207653","https://openalex.org/W2612294590","https://openalex.org/W2810138448","https://openalex.org/W2963966702","https://openalex.org/W3086068030","https://openalex.org/W4292363360","https://openalex.org/W4388523510"],"related_works":["https://openalex.org/W4205762803","https://openalex.org/W2535856026","https://openalex.org/W2265065644","https://openalex.org/W2134699697","https://openalex.org/W3017188156","https://openalex.org/W2322875716","https://openalex.org/W2383516975","https://openalex.org/W2374878784","https://openalex.org/W2147679489","https://openalex.org/W2371642785"],"abstract_inverted_index":{"We":[0,172],"consider":[1,32,48],"the":[2,15,39,78,89,97,103,111,134,151,205],"problem":[3,29,79,166,195],"of":[4,17,41,58,93,146],"parsimoniously":[5],"selecting":[6],"sensors":[7,42,67],"or":[8,35,43],"scheduling":[9],"sensor":[10,44],"observation":[11],"actions":[12,45],"to":[13,24,71,109,116,142,184,192],"optimize":[14],"covariance":[16],"a":[18,33,49,53,119,129,147,159,174,179],"predicted":[19],"system":[20],"state.":[21],"In":[22],"contrast":[23],"previous":[25],"work":[26],"on":[27,38],"this":[28,164],"which":[30],"typically":[31],"budget":[34,50],"cardinality":[36],"constraint":[37,59],"number":[40],"chosen,":[46],"we":[47,83,188],"imposed":[51],"by":[52,88],"routing":[54],"constraint.":[55],"This":[56,113],"type":[57],"arises":[60],"in":[61],"multi-target":[62],"tracking":[63],"(MTT)":[64],"applications":[65],"using":[66,96],"that":[68,177,198],"must":[69],"slew":[70],"point":[72],"at":[73],"different":[74],"targets.":[75],"To":[76],"decompose":[77],"into":[80],"tractable":[81],"subproblems,":[82],"develop":[84],"an":[85,193],"approach":[86],"inspired":[87],"alternating":[90],"direction":[91],"method":[92,183],"multipliers":[94],"(ADMM)":[95],"Earth":[98],"mover\u2019s":[99],"distance":[100],"rather":[101],"than":[102],"squared":[104],"\u2113<inf":[105],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[106],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[107],"norm":[108],"augment":[110],"Lagrangian.":[112],"allows":[114],"us":[115],"avoid":[117],"solving":[118],"mixed":[120],"integer":[121],"quadratic":[122],"program":[123],"(MIQP).":[124],"Moreover,":[125],"because":[126],"it":[127,137,199],"is":[128,154,161,169],"more":[130],"natural":[131],"metric":[132],"for":[133,163],"underlying":[135],"variables,":[136],"makes":[138],"intermediate":[139],"iterates":[140],"easier":[141],"interpret,":[143],"facilitating":[144],"extraction":[145],"feasible":[148],"solution":[149],"when":[150],"algorithm":[152,191],"iteration":[153],"stopped":[155],"before":[156],"convergence.":[157],"Such":[158],"property":[160],"desirable":[162],"nonconvex":[165],"since":[167],"convergence":[168],"not":[170],"guaranteed.":[171],"perform":[173],"polishing":[175],"step":[176],"uses":[178],"simple":[180],"local":[181],"search":[182],"improve":[185],"performance.":[186],"Finally,":[187],"apply":[189],"our":[190],"example":[194],"and":[196,203],"show":[197],"outperforms":[200],"baseline":[201],"heuristics":[202],"achieves":[204],"global":[206],"optimal":[207],"solution.":[208]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}