{"id":"https://openalex.org/W3209559156","doi":"https://doi.org/10.1109/iros51168.2021.9636846","title":"Trajectory Splitting: A Distributed Formulation for Collision Avoiding Trajectory Optimization","display_name":"Trajectory Splitting: A Distributed Formulation for Collision Avoiding Trajectory Optimization","publication_year":2021,"publication_date":"2021-09-27","ids":{"openalex":"https://openalex.org/W3209559156","doi":"https://doi.org/10.1109/iros51168.2021.9636846","mag":"3209559156"},"language":"en","primary_location":{"id":"doi:10.1109/iros51168.2021.9636846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros51168.2021.9636846","pdf_url":null,"source":{"id":"https://openalex.org/S4363607734","display_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5100709173","display_name":"Changhao Wang","orcid":"https://orcid.org/0000-0002-5753-1991"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Changhao Wang","raw_affiliation_strings":["University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050103635","display_name":"Jeffrey Bingham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jeffrey Bingham","raw_affiliation_strings":["X, the Moonshot Factory, Mountain View, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"X, the Moonshot Factory, Mountain View, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064077634","display_name":"Masayoshi Tomizuka","orcid":"https://orcid.org/0000-0003-0206-6639"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Masayoshi Tomizuka","raw_affiliation_strings":["University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6564,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80487106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"8113","last_page":"8120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.994700014591217,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9883000254631042,"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/trajectory","display_name":"Trajectory","score":0.8289252519607544},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7180917263031006},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6229211091995239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6025276184082031},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5685519576072693},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5603245496749878},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47925901412963867},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4682919383049011},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4256693422794342},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41540828347206116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3294225037097931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31008774042129517},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.2187422215938568},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.20978522300720215},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07083731889724731}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.8289252519607544},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7180917263031006},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6229211091995239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6025276184082031},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5685519576072693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5603245496749878},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47925901412963867},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4682919383049011},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4256693422794342},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41540828347206116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3294225037097931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31008774042129517},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2187422215938568},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.20978522300720215},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07083731889724731},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros51168.2021.9636846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros51168.2021.9636846","pdf_url":null,"source":{"id":"https://openalex.org/S4363607734","display_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1976385924","https://openalex.org/W2004139909","https://openalex.org/W2019965290","https://openalex.org/W2056784142","https://openalex.org/W2076261573","https://openalex.org/W2123871098","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2149416133","https://openalex.org/W2152817319","https://openalex.org/W2161819990","https://openalex.org/W2164278908","https://openalex.org/W2293883387","https://openalex.org/W2736013428","https://openalex.org/W2736887377","https://openalex.org/W2753505158","https://openalex.org/W2798766386","https://openalex.org/W2902909548","https://openalex.org/W2943262196","https://openalex.org/W2962853966","https://openalex.org/W2963214840","https://openalex.org/W3002033136","https://openalex.org/W3046196016","https://openalex.org/W3102334304","https://openalex.org/W4250739957","https://openalex.org/W6681136635"],"related_works":["https://openalex.org/W2020990755","https://openalex.org/W3036464408","https://openalex.org/W2377851227","https://openalex.org/W4293088966","https://openalex.org/W2366868484","https://openalex.org/W1616815502","https://openalex.org/W2327610550","https://openalex.org/W2917463375","https://openalex.org/W3101253900","https://openalex.org/W2155219672"],"abstract_inverted_index":{"Efficient":[0],"trajectory":[1,95,101,131,176,190],"optimization":[2,87],"is":[3,26,152,170],"essential":[4],"for":[5,160,178],"avoiding":[6],"collisions":[7],"in":[8,21,60,121],"unstructured":[9],"environments,":[10],"but":[11,120],"it":[12],"remains":[13],"challenging":[14],"to":[15,154,172],"have":[16,71],"both":[17],"speed":[18],"and":[19,75,88,123,157,197],"quality":[20,62],"the":[22,44,49,68,124,140,149,167,180,184,199],"solutions.":[23],"One":[24],"reason":[25],"that":[27,34,64,136],"second-order":[28],"optimality":[29],"requires":[30],"calculating":[31],"Hessian":[32],"matrices":[33],"can":[35,51],"grow":[36],"with":[37,43,132,163],"O(N":[38],"<sup":[39],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[40],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[41],")":[42],"number":[45],"of":[46,93,111,139,186,189,203],"waypoints.":[47,114,165],"Decreasing":[48],"waypoints":[50,58,74],"quadratically":[52],"decrease":[53],"computation":[54,77],"time.":[55],"Unfortunately,":[56],"fewer":[57],"result":[59],"lower":[61],"trajectories":[63,162],"may":[65],"not":[66],"avoid":[67],"collision.":[69],"To":[70],"both,":[72],"dense":[73],"reduced":[76],"time,":[78],"we":[79],"took":[80],"inspiration":[81],"from":[82],"recent":[83],"studies":[84],"on":[85],"consensus":[86,134,144],"propose":[89],"a":[90,99,109,112,129,133,143],"distributed":[91,153],"formulation":[92,169],"collocated":[94],"optimization.":[96],"It":[97],"breaks":[98],"long":[100],"into":[102,128],"several":[103],"segments,":[104],"where":[105],"each":[106,155],"segment":[107,156],"becomes":[108],"subproblem":[110],"few":[113],"These":[115],"subproblems":[116],"are":[117,126],"solved":[118],"classically,":[119],"parallel,":[122],"solutions":[125],"fused":[127],"single":[130],"constraint":[135],"enforces":[137],"continuity":[138],"segments":[141],"through":[142],"update.":[145],"With":[146],"this":[147],"scheme,":[148],"quadratic":[150],"complexity":[151],"enables":[158],"solving":[159,179],"higher-quality":[161],"denser":[164],"Furthermore,":[166],"proposed":[168],"amenable":[171],"using":[173],"any":[174],"existing":[175],"optimizer":[177],"subproblems.":[181],"We":[182],"compare":[183],"performance":[185],"our":[187,204],"implementation":[188],"splitting":[191],"against":[192],"leading":[193],"motion":[194],"planning":[195],"algorithms":[196],"demonstrate":[198],"improved":[200],"computational":[201],"efficiency":[202],"method.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}