{"id":"https://openalex.org/W4286306238","doi":"https://doi.org/10.23919/ascc56756.2022.9828074","title":"Optimal time-varying topology for network systems","display_name":"Optimal time-varying topology for network systems","publication_year":2022,"publication_date":"2022-05-04","ids":{"openalex":"https://openalex.org/W4286306238","doi":"https://doi.org/10.23919/ascc56756.2022.9828074"},"language":"en","primary_location":{"id":"doi:10.23919/ascc56756.2022.9828074","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ascc56756.2022.9828074","pdf_url":null,"source":{"id":"https://openalex.org/S4363607827","display_name":"2022 13th Asian Control Conference (ASCC)","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 13th Asian Control Conference (ASCC)","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/A5102963090","display_name":"Takuya Ikeda","orcid":"https://orcid.org/0000-0002-3312-5120"},"institutions":[{"id":"https://openalex.org/I17056963","display_name":"The University of Kitakyushu","ror":"https://ror.org/03mfefw72","country_code":"JP","type":"education","lineage":["https://openalex.org/I17056963"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takuya Ikeda","raw_affiliation_strings":["The University of Kitakyushu,Faculty of Environmental Engineering,Fukuoka,Japan,808-0135"],"affiliations":[{"raw_affiliation_string":"The University of Kitakyushu,Faculty of Environmental Engineering,Fukuoka,Japan,808-0135","institution_ids":["https://openalex.org/I17056963"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066521241","display_name":"Kenji Kashima","orcid":"https://orcid.org/0000-0002-2963-2584"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenji Kashima","raw_affiliation_strings":["Kyoto University,Graduate School of Informatics,Kyoto,Japan,606-8501"],"affiliations":[{"raw_affiliation_string":"Kyoto University,Graduate School of Informatics,Kyoto,Japan,606-8501","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102963090"],"corresponding_institution_ids":["https://openalex.org/I17056963"],"apc_list":null,"apc_paid":null,"fwci":0.4324,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.45759177,"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":"1926","last_page":"1931"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9923999905586243,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9923999905586243,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10046","display_name":"Stability and Control of Uncertain Systems","score":0.9847000241279602,"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/controllability","display_name":"Controllability","score":0.664287269115448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5920674204826355},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5860916972160339},{"id":"https://openalex.org/keywords/controllability-gramian","display_name":"Controllability Gramian","score":0.5625243186950684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5618339776992798},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5226190686225891},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4953128397464752},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.44419345259666443},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4343392252922058},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4160793423652649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3894542455673218},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.15877756476402283}],"concepts":[{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.664287269115448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5920674204826355},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5860916972160339},{"id":"https://openalex.org/C143461762","wikidata":"https://www.wikidata.org/wiki/Q83587","display_name":"Controllability Gramian","level":3,"score":0.5625243186950684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5618339776992798},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5226190686225891},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4953128397464752},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.44419345259666443},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4343392252922058},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4160793423652649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3894542455673218},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.15877756476402283},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ascc56756.2022.9828074","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ascc56756.2022.9828074","pdf_url":null,"source":{"id":"https://openalex.org/S4363607827","display_name":"2022 13th Asian Control Conference (ASCC)","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 13th Asian Control Conference (ASCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338246","display_name":"ACT-X","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W416122618","https://openalex.org/W1829644108","https://openalex.org/W1884503243","https://openalex.org/W1938602245","https://openalex.org/W1993579690","https://openalex.org/W2003949298","https://openalex.org/W2111725629","https://openalex.org/W2463551688","https://openalex.org/W2564415429","https://openalex.org/W2570033587","https://openalex.org/W2734897898","https://openalex.org/W2802842173","https://openalex.org/W2953258579","https://openalex.org/W3018814825","https://openalex.org/W3025700512","https://openalex.org/W3045663012","https://openalex.org/W3104160196","https://openalex.org/W3105644668","https://openalex.org/W3174878077","https://openalex.org/W3203739104","https://openalex.org/W4214554656"],"related_works":["https://openalex.org/W2526478698","https://openalex.org/W4294558370","https://openalex.org/W4210360605","https://openalex.org/W3209184047","https://openalex.org/W2907471383","https://openalex.org/W2912925551","https://openalex.org/W2044791747","https://openalex.org/W2577309101","https://openalex.org/W3121904599","https://openalex.org/W1994014931"],"abstract_inverted_index":{"This":[0],"paper":[1,30],"treats":[2],"an":[3,61,79,104,150],"optimization":[4,86],"problem":[5,87,102,107,124],"of":[6,46,64,71,128],"time-varying":[7],"network":[8,13],"topology":[9,17,35],"for":[10,95],"continuous-time":[11],"linear":[12],"systems.":[14],"Although":[15],"the":[16,27,34,39,44,47,52,57,65,72,84,101,122,129,146],"from":[18],"controllers":[19],"to":[20,50,77],"nodes":[21,76],"has":[22],"been":[23],"widely":[24],"investigated":[25],"in":[26],"literature,":[28],"this":[29],"alternatively":[31],"focuses":[32],"on":[33,139],"among":[36,75],"nodes.":[37],"For":[38,56],"cost":[40],"function,":[41],"we":[42,59,90,115],"employ":[43],"trace":[45],"controllability":[48],"Gramian":[49],"reduce":[51],"required":[53],"control":[54,106],"energy.":[55],"constraint,":[58],"introduce":[60,91],"upper":[62],"bound":[63],"L":[66],"<sup":[67],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[68],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">0</sup>":[69],"norm":[70],"data":[73],"transmission":[74],"find":[78],"effective":[80],"communication":[81],"schedule.":[82],"Since":[83],"formulated":[85],"is":[88],"combinatorial,":[89],"a":[92,117,126,135,140],"convex":[93],"relaxation":[94,123],"its":[96],"computational":[97],"tractability.":[98],"After":[99],"reformulating":[100],"into":[103],"optimal":[105],"where":[108],"Pontryagin's":[109],"maximum":[110],"principle":[111],"can":[112],"be":[113],"applied,":[114],"give":[116],"sufficient":[118],"condition":[119,143],"under":[120],"which":[121],"gives":[125],"solution":[127],"original":[130],"problem.":[131],"We":[132],"finally":[133],"provide":[134],"numerical":[136],"algorithm":[137],"based":[138],"derived":[141],"optimality":[142],"and":[144],"illustrate":[145],"proposed":[147],"method":[148],"with":[149],"example.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}