{"id":"https://openalex.org/W3205797072","doi":"https://doi.org/10.1109/icra48506.2021.9561823","title":"AXLE: Computationally-efficient trajectory smoothing using factor graph chains","display_name":"AXLE: Computationally-efficient trajectory smoothing using factor graph chains","publication_year":2021,"publication_date":"2021-05-30","ids":{"openalex":"https://openalex.org/W3205797072","doi":"https://doi.org/10.1109/icra48506.2021.9561823","mag":"3205797072"},"language":"en","primary_location":{"id":"doi:10.1109/icra48506.2021.9561823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","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/A5103139078","display_name":"Edwin Olson","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Edwin Olson","raw_affiliation_strings":["University of Michigan"],"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103139078"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14509246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"7443","last_page":"7448"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12810","display_name":"Real-time simulation and control systems","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T12810","display_name":"Real-time simulation and control systems","score":0.9968000054359436,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.994700014591217,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.7165181636810303},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6461076736450195},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5065962076187134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4748547375202179},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.47233644127845764},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.46805447340011597},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.44739851355552673},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4453172981739044},{"id":"https://openalex.org/keywords/axle","display_name":"Axle","score":0.4438292384147644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4090850055217743},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3429531157016754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3378123342990875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.208107590675354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1894342601299286},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10184696316719055},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08262500166893005}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7165181636810303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6461076736450195},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5065962076187134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4748547375202179},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.47233644127845764},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.46805447340011597},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.44739851355552673},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4453172981739044},{"id":"https://openalex.org/C129727815","wikidata":"https://www.wikidata.org/wiki/Q188209","display_name":"Axle","level":2,"score":0.4438292384147644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4090850055217743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3429531157016754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3378123342990875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.208107590675354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1894342601299286},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10184696316719055},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08262500166893005},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48506.2021.9561823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","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":13,"referenced_works":["https://openalex.org/W1506806321","https://openalex.org/W1520511539","https://openalex.org/W1606157100","https://openalex.org/W1990884907","https://openalex.org/W2024908906","https://openalex.org/W2064169939","https://openalex.org/W2092709233","https://openalex.org/W2159549953","https://openalex.org/W2296279693","https://openalex.org/W2587460705","https://openalex.org/W2890360483","https://openalex.org/W6635851590","https://openalex.org/W6697640024"],"related_works":["https://openalex.org/W650759427","https://openalex.org/W2331622280","https://openalex.org/W127377949","https://openalex.org/W4312942650","https://openalex.org/W2525671755","https://openalex.org/W2545991200","https://openalex.org/W645743027","https://openalex.org/W1679796039","https://openalex.org/W1557056212","https://openalex.org/W2757251458"],"abstract_inverted_index":{"Factor":[0],"graph":[1,9,59],"chains\u2013":[2],"the":[3,48,76,79,96,102,139,159,162,170],"special":[4],"case":[5],"of":[6,30,50,101,113,149,161,195],"a":[7,51,111,147],"factor":[8,58,148],"in":[10,21,34,135,191],"which":[11,137],"there":[12],"are":[13,27,88,123],"no":[14],"potentials":[15],"connecting":[16],"non-adjacent":[17],"nodes\u2013":[18],"arise":[19],"naturally":[20],"many":[22],"robotics":[23],"problems.":[24],"Importantly,":[25],"they":[26],"often":[28,70],"part":[29],"an":[31,62,66],"inner":[32],"loop":[33],"trajectory":[35,193],"optimization":[36],"and":[37,40,117,130],"estimation":[38,194],"problems,":[39],"so":[41],"applications":[42],"can":[43],"be":[44],"very":[45],"sensitive":[46],"to":[47,75],"performance":[49],"solver.Of":[52],"course,":[53],"it":[54],"is":[55,69,133],"well-known":[56],"that":[57,82,106,122],"chains":[60],"have":[61],"O(N)":[63],"solution,":[64],"but":[65],"actual":[67],"solution":[68,97],"left":[71],"as":[72,179],"\"an":[73],"exercise":[74],"reader\"\u2026":[77],"with":[78,197],"inevitable":[80],"consequence":[81],"few":[83],"(if":[84],"any)":[85],"efficient":[86],"solutions":[87],"readily":[89],"available.In":[90],"this":[91],"paper,":[92],"we":[93,108,118],"carefully":[94],"derive":[95],"while":[98,185],"keeping":[99],"track":[100],"specific":[103],"block":[104,154],"structure":[105],"arises,":[107],"work":[109],"through":[110],"number":[112],"practical":[114],"implementation":[115],"challenges,":[116],"highlight":[119],"additional":[120],"optimizations":[121],"not":[124],"at":[125],"first":[126],"apparent.":[127],"An":[128],"easy-to-use":[129],"self-contained":[131],"solver":[132],"provided":[134],"C,":[136],"outperforms":[138],"AprilSAM":[140],"general-purpose":[141],"sparse":[142],"matrix":[143],"factorization":[144],"library":[145],"by":[146,176],"7.3x":[150],"even":[151],"without":[152],"specialized":[153],"operations.The":[155],"name":[156],"AXLE":[157],"reflects":[158],"names":[160],"key":[163,189],"matrices":[164],"involved":[165],"(the":[166],"approach":[167],"here":[168],"solves":[169],"linear":[171],"problem":[172],"AX":[173],"=":[174],"E":[175],"factoring":[177],"A":[178],"LL":[180],"<sup":[181],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[182],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">T</sup>":[183],"),":[184],"also":[186],"reflecting":[187],"its":[188],"application":[190],"kino-dynamic":[192],"vehicles":[196],"axles.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}