{"id":"https://openalex.org/W4225974589","doi":"https://doi.org/10.1109/tase.2022.3144230","title":"On Optimization of Automation Systems: Integrating Modular Learning and Optimization","display_name":"On Optimization of Automation Systems: Integrating Modular Learning and Optimization","publication_year":2022,"publication_date":"2022-03-09","ids":{"openalex":"https://openalex.org/W4225974589","doi":"https://doi.org/10.1109/tase.2022.3144230"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2022.3144230","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3144230","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-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/A5027294250","display_name":"Fredrik Hagebring","orcid":"https://orcid.org/0000-0002-1801-1969"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fredrik Hagebring","raw_affiliation_strings":["Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-1801-1969","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039756083","display_name":"Ashfaq Farooqui","orcid":"https://orcid.org/0000-0002-1559-7896"},"institutions":[{"id":"https://openalex.org/I2800664555","display_name":"RISE Research Institutes of Sweden","ror":"https://ror.org/03nnxqz81","country_code":"SE","type":"other","lineage":["https://openalex.org/I2800664555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ashfaq Farooqui","raw_affiliation_strings":["RISE, Research Institutes of Sweden, Borås, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-1559-7896","affiliations":[{"raw_affiliation_string":"RISE, Research Institutes of Sweden, Borås, Sweden","institution_ids":["https://openalex.org/I2800664555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017972835","display_name":"Martin Fabian","orcid":"https://orcid.org/0000-0003-1287-9748"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Martin Fabian","raw_affiliation_strings":["Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-1287-9748","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076331540","display_name":"Bengt Lennartson","orcid":"https://orcid.org/0000-0002-3406-3881"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Lennartson","raw_affiliation_strings":["Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-3406-3881","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1947,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80182064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"19","issue":"3","first_page":"1662","last_page":"1674"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9987000226974487,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9987000226974487,"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/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.8374907374382019},{"id":"https://openalex.org/keywords/automation","display_name":"Automation","score":0.6096943616867065},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6054808497428894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6000238060951233},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5809882879257202},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.520153820514679},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45599836111068726},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4323238730430603},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4266115427017212},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4236878454685211},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3526729941368103},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25186794996261597},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20712417364120483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17942744493484497},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17212209105491638}],"concepts":[{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.8374907374382019},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.6096943616867065},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6054808497428894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000238060951233},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5809882879257202},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.520153820514679},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45599836111068726},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4323238730430603},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4266115427017212},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4236878454685211},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3526729941368103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25186794996261597},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20712417364120483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17942744493484497},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17212209105491638},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tase.2022.3144230","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3144230","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:529161","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/529161","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W28288553","https://openalex.org/W101029079","https://openalex.org/W186035943","https://openalex.org/W1605342503","https://openalex.org/W1643571618","https://openalex.org/W1938383858","https://openalex.org/W1972505764","https://openalex.org/W1979349468","https://openalex.org/W1988883016","https://openalex.org/W1994917823","https://openalex.org/W2016140364","https://openalex.org/W2059057465","https://openalex.org/W2125291333","https://openalex.org/W2169528473","https://openalex.org/W2509841691","https://openalex.org/W2767096559","https://openalex.org/W2783183134","https://openalex.org/W2905304454","https://openalex.org/W2970652714","https://openalex.org/W3160143910","https://openalex.org/W3161420882"],"related_works":["https://openalex.org/W2950944401","https://openalex.org/W3095810947","https://openalex.org/W4308571468","https://openalex.org/W152379590","https://openalex.org/W1564313204","https://openalex.org/W2767047809","https://openalex.org/W2154085832","https://openalex.org/W4225974589","https://openalex.org/W2121656101","https://openalex.org/W3023081192"],"abstract_inverted_index":{"Compositional":[0],"Optimization(CompOpt)":[1,216],"was":[2],"recently":[3],"proposed":[4],"for":[5,222],"optimization":[6,14,21,54,210,224,246,361],"of":[7,10,46,66,83,89,105,115,153,163,175,180,196,200,208,225,234,245,265,285,336,366,373,382],"discrete-event":[8],"systems":[9,143,177],"systems.":[11,118,228],"A":[12,229],"modular":[13,53,96],"model":[15,247],"allows":[16,125],"CompOpt":[17,235],"to":[18,49,75,86,108,127,141,213,352,369,384,388],"divide":[19,308],"the":[20,26,34,67,71,77,90,99,133,138,151,161,173,194,201,205,209,223,232,250,286,309,313,334,354,357,371,380,386],"into":[22,80,252,311],"separate":[23],"sub-problems,":[24],"mitigating":[25],"state":[27,100],"space":[28,101,207],"explosion":[29],"problem.":[30],"This":[31,270,320],"paper":[32,271],"presents":[33],"Modular":[35],"Optimization":[36,166],"Learner":[37],"(MOL),":[38],"a":[39,44,47,63,81,109,169,190,218,242,262,283,299,325],"method":[40,219],"that":[41,95,237,248,278,327,341,349],"interacts":[42],"with":[43,231,275],"simulation":[45,284,289],"system":[48,68,203,251,268,376],"automatically":[50],"learn":[51],"these":[52,176,259,280],"models.":[55],"MOL":[56,126],"uses":[57,70,315],"amodular":[58],"learningthat":[59],"takes":[60,239],"as":[61,240,296,298,324,333],"input":[62,241],"hypothesis":[64],"structure":[65,318],"and":[69,85,148,150,155,182,198,267,338,359,375],"provided":[72],"structural":[73,330,347],"information":[74,348],"split":[76],"acquired":[78],"learning":[79,97,114,310,358],"set":[82],"modules,":[84,135],"prune":[87],"parts":[88],"search":[91,123,206],"space.":[92],"Experiments":[93],"show":[94],"reduces":[98],"by":[102],"many":[103,129],"orders":[104],"magnitude":[106],"compared":[107],"monolithic":[110],"learning,":[111],"which":[112,339],"enables":[113],"much":[116],"larger":[117],"Furthermore,":[119],"an":[120,276,316],"integrated":[121],"greedy":[122],"heuristic":[124],"remove":[128],"sub-optimal":[130],"paths":[131],"in":[132,178,293,379],"individual":[134],"speeding":[136],"up":[137],"subsequent":[139,360],"optimization.Note":[140],"Practitioners\u2014Automation":[142],"are":[144],"becoming":[145],"increasingly":[146],"large":[147],"complex":[149],"automation":[152,202,227],"more":[154,156,346,355],"advanced":[157],"tasks":[158,197],"often":[159],"requires":[160,261],"coordination":[162],"multiple":[164],"subsystems.":[165],"can":[167,290,304,321],"have":[168],"great":[170],"impact":[171],"on":[172],"efficiency":[174],"terms":[179],"cost":[181],"operation":[183],"speed.":[184],"Finding":[185],"optimal":[186],"solutions":[187],"is,":[188],"however,":[189],"difficult":[191],"task.":[192],"As":[193],"number":[195,335],"subsystems":[199,337],"increases,":[204],"problems":[211],"tends":[212],"grow":[214],"exponentially.Compositional":[215],"is":[217,236,350,368],"specifically":[220],"designed":[221],"large-scale":[226],"challenge":[230,274],"application":[233,381],"it":[238],"specific":[243],"type":[244],"divides":[249],"subsystems;":[253],"like":[254],"machines,":[255],"vehicles,":[256],"etc.":[257],"Formulating":[258],"models":[260,281],"high":[263],"level":[264,372],"expertise":[266,374],"knowledge.":[269],"addresses":[272],"this":[273,367],"algorithm":[277,314],"learns":[279],"from":[282],"system.":[287],"The":[288,345,364],"be":[291,305,322],"implemented":[292],"any":[294],"software":[295],"long":[297],"suitable":[300],"interface":[301],"exists":[302],"or":[303],"constructed.":[306],"To":[307],"subsystems,":[312],"initialplant":[317],"hypothesis(PSH).":[319],"viewed":[323],"meta-model":[326],"includes":[328],"known":[329],"information,":[331],"such":[332],"actions":[340],"affect":[342],"each":[343],"subsystem.":[344],"added":[351],"PSH,":[353],"efficient":[356],"will":[362],"be.":[363],"purpose":[365],"reduce":[370],"knowledge":[377],"needed":[378],"optimization,":[383],"simplify":[385],"transition":[387],"Industry":[389],"4.0.":[390]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}