{"id":"https://openalex.org/W7123357439","doi":"https://doi.org/10.1109/cdc57313.2025.11312434","title":"Polytope Inner Approximations with Fewer Faces Subject to Minimum-Volume, Point-Inclusion, and Set-Intersection Constraints","display_name":"Polytope Inner Approximations with Fewer Faces Subject to Minimum-Volume, Point-Inclusion, and Set-Intersection Constraints","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123357439","doi":"https://doi.org/10.1109/cdc57313.2025.11312434"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5083116612","display_name":"Rebecca Jiang","orcid":null},"institutions":[{"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":true,"raw_author_name":"Rebecca H. Jiang","raw_affiliation_strings":["Massachusetts Institute of Technology,Dept. Aeronautics & Astronautics"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Dept. Aeronautics & Astronautics","institution_ids":["https://openalex.org/I46020346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084562136","display_name":"Ravi Gondhalekar","orcid":"https://orcid.org/0000-0003-0797-2470"},"institutions":[{"id":"https://openalex.org/I1343143571","display_name":"Draper Laboratory","ror":"https://ror.org/04378d909","country_code":"US","type":"funder","lineage":["https://openalex.org/I1343143571"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Gondhalekar","raw_affiliation_strings":["The Charles Stark Draper Laboratory, Inc"],"affiliations":[{"raw_affiliation_string":"The Charles Stark Draper Laboratory, Inc","institution_ids":["https://openalex.org/I1343143571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091061678","display_name":"R. Tedrake","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russ Tedrake","raw_affiliation_strings":["Massachusetts Institute of Technology,Dept. Electrical Engineering & Computer Science"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Dept. Electrical Engineering & Computer Science","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083116612"],"corresponding_institution_ids":["https://openalex.org/I46020346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.686144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2517","last_page":"2524"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.657800018787384,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.657800018787384,"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"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.08219999819993973,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0414000004529953,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/hyperplane","display_name":"Hyperplane","score":0.8798999786376953},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8335999846458435},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5993000268936157},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.578499972820282},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5644000172615051},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5389000177383423},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5001999735832214},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.4805999994277954},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.4629000127315521},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4399999976158142}],"concepts":[{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.8798999786376953},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8335999846458435},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5993000268936157},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.578499972820282},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5644000172615051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5601999759674072},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5001999735832214},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.4805999994277954},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44369998574256897},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42829999327659607},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4212999939918518},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.41200000047683716},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4092000126838684},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.3637999892234802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3571999967098236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3434000015258789},{"id":"https://openalex.org/C20556612","wikidata":"https://www.wikidata.org/wiki/Q4469374","display_name":"Volume (thermodynamics)","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32839998602867126},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29249998927116394},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.2808000147342682},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6284850239753723,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"variety":[1],"of":[2,23,54,72,90,175],"applications":[3],"including":[4],"reachability":[5],"analysis,":[6],"model":[7],"predictive":[8],"control,":[9],"and":[10,80,111,124,147,195,201],"motion":[11,122,190],"planning":[12,123,191],"for":[13,45,68,121,182],"robotics":[14],"use":[15],"polytopes":[16,103,184],"described":[17],"by":[18],"hyperplanes":[19,136,152],"to":[20,51,100,187],"represent":[21],"sets":[22,198],"permissible":[24],"states.":[25],"However,":[26],"computation":[27],"times":[28],"suffer":[29],"when":[30],"the":[31,88,98,108,145,151,210],"representation":[32],"has":[33],"many":[34],"hyperplanes,":[35],"motivating":[36],"using":[37],"inner":[38,47,70,109],"approximations":[39,48,71,174],"with":[40,107],"fewer":[41],"hyperplanes.":[42,93],"Existing":[43],"tools":[44],"synthesizing":[46],"frequently":[49],"lead":[50],"significant":[52],"loss":[53],"volume":[55,156,169],"or":[56],"unreasonable":[57],"runtime,":[58],"especially":[59],"as":[60,161],"dimensionality":[61],"increases.":[62],"We":[63,178],"propose":[64],"two":[65],"related":[66],"approaches":[67],"generating":[69],"polytopes,":[73],"one":[74],"based":[75],"on":[76],"mixed-integer":[77],"linear":[78],"programming,":[79],"a":[81,159],"greedy":[82,205],"approximation":[83,110],"that":[84,104,113,133],"scales":[85],"better":[86],"at":[87],"price":[89],"slightly":[91],"more":[92],"Our":[94,129],"proposed":[95,165],"methods":[96,166,172],"allow":[97],"user":[99],"specify":[101],"other":[102],"must":[105,115],"intersect":[106],"points":[112],"it":[114],"contain;":[116],"these":[117],"capabilities":[118],"are":[119,137,153],"critical":[120],"lacking":[125],"from":[126,144],"available":[127],"methods.":[128],"key":[130],"insight":[131],"is":[132,207],"if":[134],"some":[135],"translated":[138,154],"inward,":[139],"others":[140],"can":[141],"be":[142],"removed":[143],"description,":[146],"controlling":[148],"how":[149],"far":[150],"bounds":[155],"loss.":[157],"As":[158],"result,":[160],"dimension":[162],"increases,":[163],"our":[164],"maintain":[167],"controlled":[168],"whereas":[170],"alternative":[171],"yield":[173],"diminishing":[176],"volume.":[177],"show":[179],"computational":[180],"results":[181],"randomized":[183],"in":[185,192,199,209],"up":[186],"10":[188],"dimensions,":[189,194],"16":[193],"computing":[196],"reachable":[197],"4":[200],"6":[202],"dimensions.":[203],"The":[204],"method":[206],"implemented":[208],"${\\color{Cyan}{\\text{Drake":[211],"Toolbox}}}$":[212],"[1].":[213]},"counts_by_year":[],"updated_date":"2026-01-14T00:46:21.520733","created_date":"2026-01-14T00:00:00"}