{"id":"https://openalex.org/W2565651782","doi":"https://doi.org/10.1109/iros.2016.7759505","title":"Decoupled, consistent node removal and edge sparsification for graph-based SLAM","display_name":"Decoupled, consistent node removal and edge sparsification for graph-based SLAM","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2565651782","doi":"https://doi.org/10.1109/iros.2016.7759505","mag":"2565651782"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2016.7759505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5041069558","display_name":"Kevin Eckenhoff","orcid":"https://orcid.org/0000-0001-6985-3210"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Eckenhoff","raw_affiliation_strings":["Department of Mechanical Engineering, University of Delaware, Newark, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of Delaware, Newark, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037065865","display_name":"Liam Paull","orcid":"https://orcid.org/0000-0003-2492-6660"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liam Paull","raw_affiliation_strings":["Department of Mechanical Engineering, University of Delaware, Newark, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of Delaware, Newark, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008502528","display_name":"Guoquan Huang","orcid":"https://orcid.org/0000-0001-9932-0685"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoquan Huang","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":115.9713,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.99855636,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3275","last_page":"3282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9998999834060669,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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.9887999892234802,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5710551738739014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5707942247390747},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.5524373650550842},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.534274160861969},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5293344259262085},{"id":"https://openalex.org/keywords/markov-blanket","display_name":"Markov blanket","score":0.500197172164917},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.48933881521224976},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.475129634141922},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4609238803386688},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4167558550834656},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3586351275444031},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33111825585365295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32314354181289673},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.3031480312347412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28597313165664673},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23187044262886047},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.1779577136039734},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14389511942863464},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10982277989387512}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710551738739014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5707942247390747},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.5524373650550842},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.534274160861969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5293344259262085},{"id":"https://openalex.org/C123867240","wikidata":"https://www.wikidata.org/wiki/Q3001792","display_name":"Markov blanket","level":5,"score":0.500197172164917},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.48933881521224976},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.475129634141922},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4609238803386688},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4167558550834656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3586351275444031},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33111825585365295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32314354181289673},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.3031480312347412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28597313165664673},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23187044262886047},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.1779577136039734},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14389511942863464},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10982277989387512},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2016.7759505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7400000095367432,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W900890939","https://openalex.org/W1503398984","https://openalex.org/W1968315983","https://openalex.org/W1997645979","https://openalex.org/W2006368361","https://openalex.org/W2026230478","https://openalex.org/W2033923716","https://openalex.org/W2064169939","https://openalex.org/W2073968412","https://openalex.org/W2080823437","https://openalex.org/W2095025682","https://openalex.org/W2096052462","https://openalex.org/W2107905629","https://openalex.org/W2135492382","https://openalex.org/W2137052305","https://openalex.org/W2151290401","https://openalex.org/W2164035059","https://openalex.org/W2164278908","https://openalex.org/W2295984417","https://openalex.org/W2565651782","https://openalex.org/W2738092578","https://openalex.org/W3140425959","https://openalex.org/W3146325346","https://openalex.org/W4246483956","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W6624142628","https://openalex.org/W6741192805"],"related_works":["https://openalex.org/W2761923836","https://openalex.org/W2766005066","https://openalex.org/W4300818674","https://openalex.org/W2788721134","https://openalex.org/W2084326697","https://openalex.org/W2027903142","https://openalex.org/W2354322608","https://openalex.org/W2804608325","https://openalex.org/W2077211377","https://openalex.org/W3023326395"],"abstract_inverted_index":{"Graph-based":[0],"SLAM":[1],"approaches":[2],"have":[3],"had":[4],"success":[5],"recently":[6],"despite":[7],"suffering":[8],"from":[9],"ever-increasing":[10],"computational":[11],"costs":[12],"due":[13],"to":[14,43,57,87,130,135,161,164],"the":[15,20,33,59,75,89,98,102,112,138,143,165],"need":[16],"of":[17,35,48,61,78,93,101],"optimizing":[18],"over":[19,65],"entire":[21],"robot":[22],"trajectory.":[23],"To":[24],"address":[25],"this":[26,29],"issue,":[27],"in":[28,81,97,111],"paper,":[30],"we":[31,69,117],"advocate":[32],"decoupling":[34],"marginalization":[36,53],"(node":[37],"removal)":[38],"and":[39,155,159],"sparsification":[40],"(edge":[41],"reduction)":[42],"allow":[44],"for":[45],"short-term":[46],"retention":[47],"dense":[49,83,140],"factors":[50,85,134,141],"induced":[51],"by":[52],"while":[54],"enabling":[55],"us":[56,129],"spread":[58],"computation":[60],"these":[62],"two":[63],"operations":[64],"time.":[66],"In":[67],"particular,":[68],"analytically":[70],"show":[71],"that":[72],"during":[73,115],"marginalization,":[74],"correct":[76],"choice":[77],"linearization":[79],"points":[80],"constructing":[82],"marginal":[84],"is":[86,149],"use":[88],"relative":[90],"(local),":[91],"instead":[92],"global,":[94],"state":[95],"estimates":[96],"Markov":[99,144],"blanket":[100],"marginalized":[103],"node,":[104],"which":[105,127],"has":[106],"lacked":[107],"a":[108],"general":[109],"consensus":[110],"literature.":[113],"Furthermore,":[114],"sparsification,":[116],"determine":[118],"an":[119],"online":[120],"sparse":[121,133],"topology":[122],"through":[123],"sparsity-regularized":[124],"convex":[125],"optimization,":[126],"guides":[128],"construct":[131],"consistent":[132],"best":[136],"approximate":[137],"original":[139],"across":[142],"blanket.":[145],"The":[146],"proposed":[147],"approach":[148],"tested":[150],"extensively":[151],"on":[152],"both":[153],"2D":[154],"3D":[156],"public":[157],"datasets":[158],"shown":[160],"perform":[162],"competitively":[163],"state-of-the-art":[166],"algorithms.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-10-10T00:00:00"}