{"id":"https://openalex.org/W7134268407","doi":"https://doi.org/10.48550/arxiv.2603.05916","title":"Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes","display_name":"Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes","publication_year":2026,"publication_date":"2026-03-06","ids":{"openalex":"https://openalex.org/W7134268407","doi":"https://doi.org/10.48550/arxiv.2603.05916"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.05916","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128608324","display_name":"Shuo Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Shuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128460968","display_name":"Zhe Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Zhe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086742095","display_name":"C\u0103lin Belta","orcid":"https://orcid.org/0000-0002-7141-2657"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Belta, Calin A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29880808,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.6626999974250793,"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.6626999974250793,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.2702000141143799,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10791","display_name":"Advanced Control Systems Optimization","score":0.011699999682605267,"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/polytope","display_name":"Polytope","score":0.6187999844551086},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.6166999936103821},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.5115000009536743},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.489300012588501},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4878000020980835},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.45170000195503235},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.43810001015663147},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.42719998955726624},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.4101000130176544},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4075999855995178}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6187999844551086},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.6166999936103821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5802000164985657},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.5115000009536743},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.489300012588501},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4878000020980835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46540001034736633},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.45170000195503235},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.43810001015663147},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.42719998955726624},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.4101000130176544},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.40639999508857727},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.40230000019073486},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.37779998779296875},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.37119999527931213},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C172205157","wikidata":"https://www.wikidata.org/wiki/Q1782962","display_name":"Model predictive control","level":3,"score":0.33899998664855957},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.3212999999523163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31690001487731934},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C91581856","wikidata":"https://www.wikidata.org/wiki/Q2707001","display_name":"Nonlinear control","level":3,"score":0.29910001158714294},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2915000021457672},{"id":"https://openalex.org/C31531917","wikidata":"https://www.wikidata.org/wiki/Q915157","display_name":"Robust control","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.2606000006198883},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2599000036716461},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.05916","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.05916","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.05916","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.05916","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Obstacle":[0],"avoidance":[1],"of":[2,101,109,133],"polytopic":[3,6],"obstacles":[4],"by":[5,78],"robots":[7],"is":[8],"a":[9,92],"challenging":[10],"problem":[11],"in":[12,59,150],"optimization-based":[13],"control":[14,56,73,129],"and":[15,41,104,122,130,142],"trajectory":[16,131],"planning.":[17],"Many":[18],"existing":[19],"methods":[20],"rely":[21],"on":[22],"smooth":[23],"geometric":[24],"approximations,":[25],"such":[26],"as":[27],"hyperspheres":[28],"or":[29],"ellipsoids,":[30],"which":[31],"allow":[32],"differentiable":[33],"distance":[34],"expressions":[35],"but":[36],"distort":[37],"the":[38,43,110],"true":[39],"geometry":[40,106],"restrict":[42],"feasible":[44],"set.":[45],"Other":[46],"approaches":[47],"integrate":[48],"exact":[49,83],"polytope":[50],"distances":[51],"into":[52],"nonlinear":[53,135],"model":[54],"predictive":[55],"(MPC),":[57],"resulting":[58,117],"nonconvex":[60],"programs":[61],"that":[62],"limit":[63],"real-time":[64],"performance.":[65],"In":[66],"this":[67],"paper,":[68],"we":[69],"construct":[70],"linear":[71],"discrete-time":[72],"barrier":[74],"function":[75],"(DCBF)":[76],"constraints":[77],"deriving":[79],"supporting":[80],"hyperplanes":[81],"from":[82],"closest-point":[84],"computations":[85],"between":[86],"convex":[87,95],"polytopes.":[88],"We":[89],"then":[90],"propose":[91],"novel":[93],"iterative":[94],"MPC-DCBF":[96],"framework,":[97],"where":[98],"local":[99],"linearization":[100],"system":[102],"dynamics":[103],"robot":[105],"ensures":[107],"convexity":[108],"finite-horizon":[111],"optimization":[112],"at":[113],"each":[114],"iteration.":[115],"The":[116,137],"formulation":[118],"reduces":[119],"computational":[120],"complexity":[121],"enables":[123],"fast":[124],"online":[125],"implementation":[126],"for":[127],"safety-critical":[128],"planning":[132],"general":[134],"dynamics.":[136],"framework":[138],"extends":[139],"to":[140],"multi-robot":[141],"three-dimensional":[143],"environments.":[144],"Numerical":[145],"experiments":[146],"demonstrate":[147],"collision-free":[148],"navigation":[149],"cluttered":[151],"maze":[152],"scenarios":[153],"with":[154],"millisecond-level":[155],"solve":[156],"times.":[157]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-03-10T00:00:00"}