{"id":"https://openalex.org/W2972858943","doi":"https://doi.org/10.23919/acc.2019.8814354","title":"Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of Linear Systems","display_name":"Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of Linear Systems","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2972858943","doi":"https://doi.org/10.23919/acc.2019.8814354","mag":"2972858943"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2019.8814354","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2019.8814354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/A5029023907","display_name":"Hossein Sartipizadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hossein Sartipizadeh","raw_affiliation_strings":["Department of Aerospace Engineering and Engineering Mechanics, University of New Mexico, TX, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering and Engineering Mechanics, University of New Mexico, TX, US","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050718717","display_name":"Abraham P. Vinod","orcid":"https://orcid.org/0000-0002-7955-9629"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abraham P. Vinod","raw_affiliation_strings":["Department of Aerospace Engineering and Engineering Mechanics, University of New Mexico, TX, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering and Engineering Mechanics, University of New Mexico, TX, US","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044772884","display_name":"Beh\u00e7et A\u00e7\u0131kme\u015fe","orcid":"https://orcid.org/0000-0002-8693-8109"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Behcet Acikmese","raw_affiliation_strings":["Electrical & Computer Engineering, University of New Mexico, Albuquerque, NM, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical & Computer Engineering, University of New Mexico, Albuquerque, NM, US","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070060161","display_name":"Meeko Oishi","orcid":"https://orcid.org/0000-0003-3722-8837"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Meeko Oishi","raw_affiliation_strings":["Department of Aeronautics & Astronautics, University of Washington, Seattle, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aeronautics & Astronautics, University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8524,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86637529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9926000237464905,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7421887516975403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6550391316413879},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6137955188751221},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6016271710395813},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5712642669677734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5274256467819214},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5154210329055786},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5031618475914001},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4983830451965332},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.44888439774513245},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44158223271369934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35235390067100525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25534310936927795},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1270371675491333}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7421887516975403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6550391316413879},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6137955188751221},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6016271710395813},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5712642669677734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5274256467819214},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5154210329055786},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5031618475914001},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4983830451965332},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.44888439774513245},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44158223271369934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35235390067100525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25534310936927795},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1270371675491333},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2019.8814354","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2019.8814354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1524886571","https://openalex.org/W1824914642","https://openalex.org/W1977556410","https://openalex.org/W1977985274","https://openalex.org/W2007032806","https://openalex.org/W2012811607","https://openalex.org/W2080813827","https://openalex.org/W2084772009","https://openalex.org/W2086959852","https://openalex.org/W2097148013","https://openalex.org/W2103012681","https://openalex.org/W2129316296","https://openalex.org/W2156835128","https://openalex.org/W2167412190","https://openalex.org/W2170990015","https://openalex.org/W2400318990","https://openalex.org/W2414860269","https://openalex.org/W2593166942","https://openalex.org/W2612876721","https://openalex.org/W2792213988","https://openalex.org/W2796084235","https://openalex.org/W2887958778","https://openalex.org/W2939750219","https://openalex.org/W2963709688","https://openalex.org/W2964058170","https://openalex.org/W4233413206","https://openalex.org/W4250589301","https://openalex.org/W4252521233","https://openalex.org/W6713444902","https://openalex.org/W6738055024"],"related_works":["https://openalex.org/W3020555194","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2793256277","https://openalex.org/W4360958759","https://openalex.org/W2348235448","https://openalex.org/W2116218375","https://openalex.org/W2135836819"],"abstract_inverted_index":{"We":[0,13,42,130],"address":[1],"the":[2,17,21,39,52,67,71,80,96,106,114,122,142,146,154],"stochastic":[3,11],"reach-avoid":[4,107],"problem":[5],"for":[6,135,151],"linear":[7],"systems":[8],"with":[9,153],"additive":[10],"uncertainty.":[12],"seek":[14],"to":[15,57,66,87,104,144],"compute":[16],"maximum":[18],"probability":[19],"that":[20,59],"states":[22],"remain":[23],"in":[24],"a":[25,29,35,48,89,101,132],"safe":[26,123],"set":[27,37],"over":[28],"finite":[30],"time":[31],"horizon":[32],"and":[33,46,79,124,140],"reach":[34],"target":[36,125],"at":[38,109],"final":[40],"time.":[41],"employ":[43],"sampling-based":[44,72],"methods":[45],"provide":[47,141],"lower":[49,82],"bound":[50,83],"on":[51],"number":[53,147],"of":[54,70,113,148],"scenarios":[55,139],"required":[56],"guarantee":[58,76],"our":[60,74],"estimate":[61],"provides":[62],"an":[63],"underapproximation.":[64],"Due":[65],"probabilistic":[68,91],"nature":[69],"methods,":[73],"underapproximation":[75],"is":[77],"probabilistic,":[78],"proposed":[81],"can":[84],"be":[85],"used":[86],"satisfy":[88],"prescribed":[90],"confidence":[92],"level.":[93],"To":[94],"decrease":[95],"computational":[97,155],"complexity,":[98],"we":[99],"propose":[100,131],"Voronoi":[102],"partition-based":[103],"check":[105],"constraints":[108,119],"representative":[110,138],"scenarios,":[111],"instead":[112],"original":[115],"scenarios.":[116],"The":[117],"state":[118],"arising":[120],"from":[121],"sets":[126],"are":[127],"tightened":[128],"appropriately.":[129],"systematic":[133],"approach":[134],"selecting":[136],"these":[137],"flexibility":[143],"trade-off":[145],"cells":[149],"needed":[150],"accuracy":[152],"cost.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}