{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:28:40Z","timestamp":1762522120725,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001775","name":"University of Technology Sydney","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001775","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/lra.2018.2794610","type":"journal-article","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T19:19:18Z","timestamp":1516216758000},"page":"1207-1214","source":"Crossref","is-referenced-by-count":25,"title":["Robust Incremental SLAM Under Constrained Optimization Formulation"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9606-3943","authenticated-orcid":false,"given":"Fang","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5763-9644","authenticated-orcid":false,"given":"Teresa","family":"Vidal-Calleja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6124-4178","authenticated-orcid":false,"given":"Shoudong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2014","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICARCV.2016.7838759"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2013.2291626"},{"key":"ref31","first-page":"3011","article-title":"How far is SLAM from a linear least squares problem","author":"huang","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5652656"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/34.481539"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2794610"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref35"},{"key":"ref34","first-page":"23","article-title":"Evaluating the fit of structural equation models: Tests of significance and descriptive goodness-of-fit measures","volume":"8","author":"schermelleh-engel","year":"2003","journal-title":"Methods of Psychological Research Online"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2544304"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759681"},{"article-title":"A certifiably correct algorithm for synchronization over the special Euclidean group","year":"0","author":"rosen","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2718661"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385779"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696329"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907383"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6224709"},{"key":"ref19","first-page":"556","article-title":"Robust pose-graph loop-closures with expectation-maximization","author":"lee","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2008.2006706"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911430419"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915585395"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"3607","DOI":"10.1109\/ICRA.2011.5979949","article-title":"G2O: A general framework for graph optimization","author":"k\u00fcmmerle","year":"2011","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.08.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2014.2321852"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7140014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385742"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1642040"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914523689"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2624754"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630557"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/PLANS.2014.6851458"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913479413"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353363"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913498910"},{"key":"ref26","first-page":"2667","article-title":"Selecting good measurements via $\\ell _1$ relaxation: A convex approach for robust estimation over graphs","author":"carlone","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"article-title":"Robust and efficient robotic mapping","year":"2008","author":"olson","key":"ref25"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8214927\/08260834.pdf?arnumber=8260834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:17:04Z","timestamp":1642004224000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8260834\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":38,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2018.2794610","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}