{"id":"https://openalex.org/W2991866298","doi":"https://doi.org/10.1109/ccta.2019.8920443","title":"Quickly Finding Recursively Feasible Solutions for MPC with Discrete Variables","display_name":"Quickly Finding Recursively Feasible Solutions for MPC with Discrete Variables","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2991866298","doi":"https://doi.org/10.1109/ccta.2019.8920443","mag":"2991866298"},"language":"en","primary_location":{"id":"doi:10.1109/ccta.2019.8920443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta.2019.8920443","pdf_url":null,"source":{"id":"https://openalex.org/S4306498490","display_name":"2019 IEEE Conference on Control Technology and Applications (CCTA)","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":"2019 IEEE Conference on Control Technology and Applications (CCTA)","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/A5052314881","display_name":"Liren Yang","orcid":"https://orcid.org/0000-0002-7677-8543"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Liren Yang","raw_affiliation_strings":["Dept. of Electrical Engineering and Computer Science, Univ. of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering and Computer Science, Univ. of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045327736","display_name":"Amey Katnik","orcid":null},"institutions":[{"id":"https://openalex.org/I1292974536","display_name":"Ford Motor Company (United States)","ror":"https://ror.org/00g2tkw06","country_code":"US","type":"company","lineage":["https://openalex.org/I1292974536"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amey Katnik","raw_affiliation_strings":["Ford Research & Advanced Engineering, Dearborn, MI, USA"],"affiliations":[{"raw_affiliation_string":"Ford Research & Advanced Engineering, Dearborn, MI, USA","institution_ids":["https://openalex.org/I1292974536"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054418471","display_name":"Necmiye \u00d6zay","orcid":"https://orcid.org/0000-0002-5552-4392"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Necmiye Ozay","raw_affiliation_strings":["Dept. of Electrical Engineering and Computer Science, Univ. of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering and Computer Science, Univ. of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052314881"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.2394052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"374","last_page":"381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":1.0,"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"}},{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T10876","display_name":"Fault Detection and Control Systems","score":0.9940000176429749,"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/heuristics","display_name":"Heuristics","score":0.7792227268218994},{"id":"https://openalex.org/keywords/model-predictive-control","display_name":"Model predictive control","score":0.7766615152359009},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7007826566696167},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6525180339813232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.639517068862915},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5880687832832336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5778829455375671},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5685262680053711},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5231978893280029},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5067020058631897},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4686989486217499},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4568094313144684},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.39867642521858215},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.36150476336479187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2809867262840271}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7792227268218994},{"id":"https://openalex.org/C172205157","wikidata":"https://www.wikidata.org/wiki/Q1782962","display_name":"Model predictive control","level":3,"score":0.7766615152359009},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7007826566696167},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6525180339813232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.639517068862915},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5880687832832336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5778829455375671},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5685262680053711},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5231978893280029},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5067020058631897},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4686989486217499},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4568094313144684},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.39867642521858215},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.36150476336479187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2809867262840271},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"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.1109/ccta.2019.8920443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta.2019.8920443","pdf_url":null,"source":{"id":"https://openalex.org/S4306498490","display_name":"2019 IEEE Conference on Control Technology and Applications (CCTA)","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":"2019 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W174707369","https://openalex.org/W246120801","https://openalex.org/W1483893502","https://openalex.org/W1523360756","https://openalex.org/W1678380195","https://openalex.org/W1973278361","https://openalex.org/W1977985274","https://openalex.org/W1978956894","https://openalex.org/W1983481903","https://openalex.org/W1989103660","https://openalex.org/W1990311592","https://openalex.org/W1991923258","https://openalex.org/W2028790617","https://openalex.org/W2033735555","https://openalex.org/W2046832675","https://openalex.org/W2091364465","https://openalex.org/W2117402460","https://openalex.org/W2124627342","https://openalex.org/W2132877212","https://openalex.org/W2134673975","https://openalex.org/W2149811681","https://openalex.org/W2487779201","https://openalex.org/W2536620281","https://openalex.org/W2571939971","https://openalex.org/W2606482332","https://openalex.org/W2735612372","https://openalex.org/W2748791965","https://openalex.org/W2766402182","https://openalex.org/W3175484244","https://openalex.org/W4240374930","https://openalex.org/W6606952490","https://openalex.org/W6743135849"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2084616826","https://openalex.org/W2008600006","https://openalex.org/W1968202374","https://openalex.org/W2941986668","https://openalex.org/W1593376002","https://openalex.org/W1595394363","https://openalex.org/W2354460058","https://openalex.org/W125276123","https://openalex.org/W2158503982"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,64,117],"consider":[4],"designing":[5],"real-time":[6],"Model":[7],"Predictive":[8],"Control":[9],"(MPC)":[10],"for":[11,61,136],"embedded":[12,62],"control":[13,20,152],"applications":[14],"where":[15,48],"both":[16],"continuous-valued":[17],"and":[18,38,45,82,114,139,164,185],"discrete-valued":[19],"inputs":[21,163,167],"are":[22,54,85],"present.":[23],"The":[24,128],"online":[25],"optimization":[26],"in":[27,79,93],"MPC":[28,94,108,122],"is":[29,168],"formulated":[30],"as":[31],"a":[32,43,66,124,141,149,177],"Mixed":[33],"Integer":[34],"Quadratic":[35,51],"Program":[36],"(MIQP),":[37],"can":[39],"be":[40,75],"achieved":[41],"using":[42],"branch":[44,81,113,184],"bound":[46,83,115,186],"algorithm":[47,84],"multiple":[49],"relaxed":[50,72],"Programs":[52],"(QPs)":[53],"solved.":[55,76],"Due":[56],"to":[57,74,96,106,119,144,170],"the":[58,69,80,90,107,121,146,155,173],"computational":[59],"constraints":[60],"applications,":[63],"impose":[65],"limit":[67],"on":[68],"number":[70],"of":[71],"problems":[73],"Tailored":[77],"heuristics":[78],"developed":[86],"taking":[87],"into":[88],"account":[89],"problem":[91,153],"structure":[92],"framework":[95],"generate":[97],"early":[98],"feasible":[99,178],"solutions.":[100,187],"To":[101],"provide":[102],"recursive":[103],"feasibility":[104],"guarantee":[105],"solved":[109],"with":[110,123,157],"such":[111],"limited":[112],"algorithm,":[116],"propose":[118],"supervise":[120],"correct-by-construction":[125],"switching":[126],"protocol.":[127],"paper":[129],"describes":[130],"these":[131],"concepts,":[132],"provides":[133],"chronometric":[134],"estimates":[135],"some":[137],"problems,":[138],"gives":[140],"numerical":[142],"example":[143],"explain":[145],"behavior.":[147],"Moreover,":[148],"fuel":[150],"cell":[151],"from":[154],"literature":[156],"five":[158],"continuous":[159,162],"states,":[160],"three":[161,165],"discrete":[166],"used":[169],"show":[171],"that":[172],"proposed":[174],"approach":[175],"reaches":[176],"solution":[179],"much":[180],"faster":[181],"than":[182],"standard":[183]},"counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}