{"id":"https://openalex.org/W7130591142","doi":"https://doi.org/10.48550/arxiv.2602.15838","title":"TurboADMM: A Structure-Exploiting Parallel Solver for Multi-Agent Trajectory Optimization","display_name":"TurboADMM: A Structure-Exploiting Parallel Solver for Multi-Agent Trajectory Optimization","publication_year":2026,"publication_date":"2026-01-14","ids":{"openalex":"https://openalex.org/W7130591142","doi":"https://doi.org/10.48550/arxiv.2602.15838"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.15838","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","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/A5126413049","display_name":"Yucheng Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chen, Yucheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5126413049"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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.1704999953508377,"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.1704999953508377,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.14100000262260437,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.10270000249147415,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/solver","display_name":"Solver","score":0.7912999987602234},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6988000273704529},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4708000123500824},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.4339999854564667},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4242999851703644},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4147999882698059},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.414000004529953},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4004000127315521},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.37869998812675476}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7912999987602234},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6988000273704529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5295000076293945},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4708000123500824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4708000123500824},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4147999882698059},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4004000127315521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38089999556541443},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.3443000018596649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3418000042438507},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.3382999897003174},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C45473103","wikidata":"https://www.wikidata.org/wiki/Q851503","display_name":"Riccati equation","level":3,"score":0.3111000061035156},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.2922999858856201},{"id":"https://openalex.org/C13847129","wikidata":"https://www.wikidata.org/wiki/Q4723989","display_name":"Algebraic Riccati equation","level":4,"score":0.2897000014781952},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.267300009727478},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2606000006198883}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.15838","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.15838","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15838","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.15838","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multi-agent":[0],"trajectory":[1],"optimization":[2],"with":[3,46],"dense":[4,63,103],"interaction":[5],"networks":[6],"require":[7],"solving":[8],"large":[9],"coupled":[10],"QPs":[11],"at":[12],"control":[13],"rates,":[14],"yet":[15],"existing":[16],"solvers":[17,39,50],"fail":[18],"to":[19,62,111],"simultaneously":[20],"exploit":[21],"temporal":[22,53,109],"structure,":[23],"agent":[24,47,81],"decomposition,":[25],"and":[26],"iteration":[27],"similarity.":[28],"One":[29],"usually":[30],"treats":[31],"multi-agent":[32],"problems":[33],"monolithically":[34],"when":[35],"using":[36],"general-purpose":[37],"QP":[38,72,122,141,146,156],"(OSQP,":[40],"MOSEK),":[41],"which":[42],"encounter":[43],"scalability":[44],"difficulties":[45],"count.":[48],"Structure-exploiting":[49],"(HPIPM)":[51],"leverage":[52],"structure":[54,101,110],"through":[55,83],"Riccati":[56,106,136],"recursion":[57],"but":[58],"can":[59],"be":[60],"vulnerable":[61],"coupling":[64],"constraints.":[65],"We":[66],"introduce":[67],"TurboADMM,":[68],"a":[69,144],"specialized":[70],"single-machine":[71],"solver":[73],"that":[74,133],"achieves":[75],"empirically":[76],"near":[77],"linear":[78],"complexity":[79],"in":[80,97],"count":[82],"systematic":[84],"co-design":[85],"of":[86],"three":[87],"complementary":[88],"components:":[89],"(1)":[90],"ADMM":[91,166],"decomposition":[92],"creates":[93],"per-agent":[94],"subproblems":[95],"solvable":[96],"parallel,":[98],"preserving":[99],"block-tridiagonal":[100],"under":[102],"coupling;":[104],"(2)":[105],"warmstart":[107,129],"exploits":[108],"provide":[112],"high-quality":[113],"primal-dual":[114],"initialization":[115,142],"for":[116,143],"each":[117],"agent's":[118],"QP;":[119],"(3)":[120],"parametric":[121],"hotstart":[123,149],"\\footnote{In":[124],"the":[125,131,135,152],"paper,":[126],"we":[127],"refer":[128],"as":[130,139,150],"technique":[132],"uses":[134],"equation":[137],"results":[138],"auxiliary":[140],"single":[145],"solve,":[147],"while":[148],"reusing":[151],"QR":[153],"factorization":[154],"across":[155,165],"solve":[157],"iterations.}in":[158],"qpOASES":[159],"reuses":[160],"similar":[161],"KKT":[162],"system":[163],"factorizations":[164],"iterations.":[167]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-02-20T00:00:00"}