{"id":"https://openalex.org/W2784005535","doi":"https://doi.org/10.1109/cdc.2017.8263811","title":"Trajectory optimization with inter-sample obstacle avoidance via successive convexification","display_name":"Trajectory optimization with inter-sample obstacle avoidance via successive convexification","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2784005535","doi":"https://doi.org/10.1109/cdc.2017.8263811","mag":"2784005535"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2017.8263811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8263811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual 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/A5057333853","display_name":"Daniel Dueri","orcid":null},"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":"Daniel Dueri","raw_affiliation_strings":["Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069377389","display_name":"Yuanqi Mao","orcid":null},"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":"Yuanqi Mao","raw_affiliation_strings":["Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052024188","display_name":"Zohaib T. Mian","orcid":null},"institutions":[{"id":"https://openalex.org/I4401726811","display_name":"Hartford Financial Services (United States)","ror":"https://ror.org/00mwq1g96","country_code":null,"type":"company","lineage":["https://openalex.org/I4401726811"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zohaib Mian","raw_affiliation_strings":["United Technology Research Center, East Hartford, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"United Technology Research Center, East Hartford, CT, USA","institution_ids":["https://openalex.org/I4401726811"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112334593","display_name":"Jerry Ding","orcid":null},"institutions":[{"id":"https://openalex.org/I4401726811","display_name":"Hartford Financial Services (United States)","ror":"https://ror.org/00mwq1g96","country_code":null,"type":"company","lineage":["https://openalex.org/I4401726811"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerry Ding","raw_affiliation_strings":["United Technology Research Center, East Hartford, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"United Technology Research Center, East Hartford, CT, USA","institution_ids":["https://openalex.org/I4401726811"]}]},{"author_position":"last","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/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Behcet Acikmese","raw_affiliation_strings":["University of Washington, Seattle, WA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, US","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8313,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.83144169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1150","last_page":"1156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12158","display_name":"Guidance and Control Systems","score":0.9789000153541565,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6524685025215149},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6096310615539551},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5921468734741211},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5893868207931519},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5634337663650513},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5443853735923767},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4945985972881317},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.4790548086166382},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46446341276168823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46029767394065857},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.4581524431705475},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4548124372959137},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.4535676836967468},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.43793898820877075},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.43236345052719116},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41706350445747375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4100213050842285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.401542067527771},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.3325658440589905},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.24431970715522766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14825686812400818},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.09827053546905518},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09159055352210999},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07977429032325745}],"concepts":[{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6524685025215149},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6096310615539551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5921468734741211},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5893868207931519},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5634337663650513},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5443853735923767},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4945985972881317},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.4790548086166382},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46446341276168823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46029767394065857},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.4581524431705475},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4548124372959137},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.4535676836967468},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.43793898820877075},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.43236345052719116},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41706350445747375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4100213050842285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.401542067527771},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.3325658440589905},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.24431970715522766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14825686812400818},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.09827053546905518},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09159055352210999},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07977429032325745},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2017.8263811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8263811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W1632601927","https://openalex.org/W1777783943","https://openalex.org/W1966185282","https://openalex.org/W1985514811","https://openalex.org/W2003140178","https://openalex.org/W2005755983","https://openalex.org/W2006455928","https://openalex.org/W2020313492","https://openalex.org/W2027928741","https://openalex.org/W2038818107","https://openalex.org/W2040475541","https://openalex.org/W2052862714","https://openalex.org/W2055201760","https://openalex.org/W2086867325","https://openalex.org/W2097867042","https://openalex.org/W2296319761","https://openalex.org/W2320211399","https://openalex.org/W2513178932","https://openalex.org/W3101244677","https://openalex.org/W3102244603","https://openalex.org/W4250589301","https://openalex.org/W6785510440"],"related_works":["https://openalex.org/W1490395035","https://openalex.org/W4200098944","https://openalex.org/W2169860649","https://openalex.org/W2047757139","https://openalex.org/W3214011889","https://openalex.org/W4395060245","https://openalex.org/W828813279","https://openalex.org/W4382519084","https://openalex.org/W4391434308","https://openalex.org/W4200031614"],"abstract_inverted_index":{"This":[0],"paper":[1,67],"develops":[2],"a":[3,29,40,59,90,105,115],"convex":[4,63],"optimization-based":[5],"method":[6],"for":[7,15,74,89,104,114],"real-time":[8],"path":[9],"planning":[10],"onboard":[11],"an":[12],"autonomous":[13],"vehicle":[14],"environments":[16],"with":[17],"cylindrical":[18],"or":[19],"ellipsoidal":[20],"obstacles.":[21],"Obstacles":[22],"render":[23],"the":[24,53,77,95,122,125],"state":[25,110],"space":[26],"non-convex,":[27],"thus":[28],"constrained,":[30],"non-convex":[31,54,109],"optimal":[32,55],"control":[33,56],"problem":[34,57],"must":[35],"be":[36],"solved":[37],"to":[38,51,102,120],"obtain":[39],"feasible":[41],"trajectory.":[42],"A":[43],"technique":[44],"known":[45],"as":[46],"Successive":[47],"Convexification":[48],"is":[49,100],"used":[50],"solve":[52],"via":[58],"convergent":[60],"sequence":[61],"of":[62,92,97,108,124],"optimization":[64],"problems.":[65],"The":[66],"has":[68],"two":[69],"main":[70],"contributions:":[71],"first,":[72],"constraints":[73],"ensuring":[75],"that":[76],"computed":[78],"trajectories":[79],"do":[80],"not":[81],"cross":[82],"obstacles":[83],"between":[84],"discrete":[85],"states":[86],"are":[87,118],"developed":[88],"class":[91,107],"dynamics;":[93],"second,":[94],"theory":[96],"successive":[98],"convexification":[99],"extended":[101],"allow":[103],"general":[106],"constraints.":[111],"Finally,":[112],"simulations":[113],"relevant":[116],"example":[117],"presented":[119],"demonstrate":[121],"effectiveness":[123],"proposed":[126],"method.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}