{"id":"https://openalex.org/W4399039214","doi":"https://doi.org/10.1109/tii.2024.3399921","title":"Data-Driven Polytopic Approximation for an $n$-Dimensional Probabilistic Reachable Set","display_name":"Data-Driven Polytopic Approximation for an $n$-Dimensional Probabilistic Reachable Set","publication_year":2024,"publication_date":"2024-05-27","ids":{"openalex":"https://openalex.org/W4399039214","doi":"https://doi.org/10.1109/tii.2024.3399921"},"language":"en","primary_location":{"id":"doi:10.1109/tii.2024.3399921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2024.3399921","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"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 Industrial Informatics","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/A5052561219","display_name":"P. Wu","orcid":"https://orcid.org/0000-0001-9865-3218"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]},{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pengcheng Wu","raw_affiliation_strings":["Department of Mechanical and Aerospace Engineering, University of California, San Diego, CA, USA","Department of Aerospace Engineering, San Diego State University, San Diego, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9865-3218","affiliations":[{"raw_affiliation_string":"Department of Mechanical and Aerospace Engineering, University of California, San Diego, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Aerospace Engineering, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100450156","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0001-9896-6898"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jun Chen","raw_affiliation_strings":["Department of Aerospace Engineering, San Diego State University, San Diego, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9896-6898","affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7347,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71815046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"20","issue":"9","first_page":"11192","last_page":"11201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.992900013923645,"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/T10142","display_name":"Formal Methods in Verification","score":0.992900013923645,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7469645142555237},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7361911535263062},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6605672240257263},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6163650155067444},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5788876414299011},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5291717052459717},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5206896066665649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5187075734138489},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47299274802207947},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4704030454158783},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4417630732059479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3974849581718445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35029876232147217},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1812848448753357},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08420026302337646}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7469645142555237},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7361911535263062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6605672240257263},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6163650155067444},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5788876414299011},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5291717052459717},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5206896066665649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5187075734138489},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47299274802207947},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4704030454158783},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4417630732059479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3974849581718445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35029876232147217},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1812848448753357},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08420026302337646},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tii.2024.3399921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2024.3399921","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"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 Industrial Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5934653304","display_name":"ERI: Towards Safe Aviation Autonomy: A Risk-bounded Planning Framework for Dynamical Systems under Uncertainties","funder_award_id":"2138612","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1497695555","https://openalex.org/W1553335074","https://openalex.org/W1982682305","https://openalex.org/W2067719264","https://openalex.org/W2765273006","https://openalex.org/W3035471091","https://openalex.org/W3178340160","https://openalex.org/W4206582390","https://openalex.org/W4226367277","https://openalex.org/W4229885360","https://openalex.org/W4235667863","https://openalex.org/W4283208585","https://openalex.org/W4284708486","https://openalex.org/W4285806152","https://openalex.org/W4288919818","https://openalex.org/W4312598113","https://openalex.org/W4313180720","https://openalex.org/W4318953228","https://openalex.org/W4379743617","https://openalex.org/W4385340891","https://openalex.org/W4385607561","https://openalex.org/W4386821114","https://openalex.org/W4390570524","https://openalex.org/W4391759743","https://openalex.org/W6723872486"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W1493684871","https://openalex.org/W2886567582","https://openalex.org/W2011675579","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"In":[0],"this":[1,47,71,90],"article,":[2],"we":[3,25,49,68],"first":[4],"propose":[5],"an":[6,27],"algorithm":[7,54],"to":[8],"find":[9],"a":[10,20,39,52],"probabilistic":[11],"reachable":[12],"set":[13],"(PRS)":[14],"that":[15,42],"bounds":[16],"system":[17],"states":[18],"given":[19],"prescribed":[21],"confidence":[22],"level.":[23],"Then,":[24],"establish":[26],"optimization":[28],"framework":[29],"using":[30],"mixed":[31],"integer":[32],"linear":[33],"programming,":[34],"where":[35],"the":[36,44,93,99],"solution":[37,60],"identifies":[38],"convex":[40],"polytope":[41],"approximates":[43],"PRS.":[45],"Utilizing":[46],"formulation,":[48],"have":[50,69],"devised":[51],"heuristic":[53,72],"aimed":[55],"at":[56],"efficiently":[57],"determining":[58],"its":[59,75],"without":[61],"compromising":[62],"significant":[63],"accuracy.":[64],"Through":[65],"case":[66],"studies,":[67],"tested":[70],"algorithm,":[73],"showcasing":[74],"simultaneous":[76],"benefits":[77],"in":[78,98],"terms":[79],"of":[80,89,104],"efficiency,":[81],"accuracy,":[82],"near-optimality,":[83],"and":[84],"robustness.":[85],"The":[86],"positive":[87],"outcomes":[88],"research":[91],"lay":[92],"foundation":[94],"for":[95],"potential":[96],"applications":[97],"real-time,":[100],"safety-critical":[101],"motion":[102],"planning":[103],"dynamic":[105],"systems":[106],"under":[107],"uncertainties.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}