{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1361137045245358336.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1177/0278364911430419"}},{"identifier":{"@type":"URI","@value":"https://journals.sagepub.com/doi/pdf/10.1177/0278364911430419"}}],"dc:title":[{"@value":"iSAM2: Incremental smoothing and mapping using the Bayes tree"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:p> We present a novel data structure, the Bayes tree, that provides an algorithmic foundation enabling a better understanding of existing graphical model inference algorithms and their connection to sparse matrix factorization methods. Similar to a clique tree, a Bayes tree encodes a factored probability density, but unlike the clique tree it is directed and maps more naturally to the square root information matrix of the simultaneous localization and mapping (SLAM) problem. In this paper, we highlight three insights provided by our new data structure. First, the Bayes tree provides a better understanding of the matrix factorization in terms of probability densities. Second, we show how the fairly abstract updates to a matrix factorization translate to a simple editing of the Bayes tree and its conditional densities. Third, we apply the Bayes tree to obtain a completely novel algorithm for sparse nonlinear incremental optimization, named iSAM2, which achieves improvements in efficiency through incremental variable re-ordering and fluid relinearization, eliminating the need for periodic batch steps. We analyze various properties of iSAM2 in detail, and show on a range of real and simulated datasets that our algorithm compares favorably with other recent mapping algorithms in both quality and efficiency. </jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381137045245358338","@type":"Researcher","foaf:name":[{"@value":"Michael Kaess"}],"jpcoar:affiliationName":[{"@value":"Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045245358339","@type":"Researcher","foaf:name":[{"@value":"Hordur Johannsson"}],"jpcoar:affiliationName":[{"@value":"Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045245358341","@type":"Researcher","foaf:name":[{"@value":"Richard Roberts"}],"jpcoar:affiliationName":[{"@value":"School of Interactive Computing, Georgia Institute of Technology, Atlanta, GA, USA"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045245358340","@type":"Researcher","foaf:name":[{"@value":"Viorela Ila"}],"jpcoar:affiliationName":[{"@value":"School of Interactive Computing, Georgia Institute of Technology, Atlanta, GA, USA"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045245358337","@type":"Researcher","foaf:name":[{"@value":"John J Leonard"}],"jpcoar:affiliationName":[{"@value":"Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045245358336","@type":"Researcher","foaf:name":[{"@value":"Frank Dellaert"}],"jpcoar:affiliationName":[{"@value":"School of Interactive Computing, Georgia Institute of Technology, Atlanta, GA, USA"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"02783649"},{"@type":"EISSN","@value":"17413176"}],"prism:publicationName":[{"@value":"The International Journal of Robotics Research"}],"dc:publisher":[{"@value":"SAGE Publications"}],"prism:publicationDate":"2011-12-20","prism:volume":"31","prism:number":"2","prism:startingPage":"216","prism:endingPage":"235"},"reviewed":"false","dc:rights":["https://journals.sagepub.com/page/policies/text-and-data-mining-license"],"url":[{"@id":"https://journals.sagepub.com/doi/pdf/10.1177/0278364911430419"}],"createdAt":"2011-12-21","modifiedAt":"2025-03-01","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360025430648169600","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Tightly-coupled LiDAR-IMU-wheel odometry with an online neural kinematic model learning via factor graph optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1360306904401434880","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"GLIM: 3D range-inertial localization and mapping with GPU-accelerated scan matching factors"}]},{"@id":"https://cir.nii.ac.jp/crid/1360869855126576768","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Tightly-Coupled LiDAR-IMU-Wheel Odometry With Online Calibration of a Kinematic Model for Skid-Steering Robots"}]},{"@id":"https://cir.nii.ac.jp/crid/1390010292711634944","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"High-Precision and Fast LiDAR Odometry and Mapping Algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1390025197284035712","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"F4-SLAM: LiDAR-Visualの時間整列と同時最適化を用いた高速かつ高精度SLAM"},{"@language":"en","@value":"F4-SLAM: Fast and Accurate SLAM Using LiDAR-Visual Temporal Alignment and Joint Optimization"},{"@language":"ja-Kana","@value":"F4-SLAM : LiDAR-Visual ノ ジカン セイレツ ト ドウジ サイテキカ オ モチイタ コウソク カツ コウセイド SLAM"}]},{"@id":"https://cir.nii.ac.jp/crid/1390302635599203712","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"F3-SLAM: Flexible and Fast Features SLAM"},{"@language":"ja","@value":"F3-SLAM：柔軟なセンサ構成に対応した高速かつ高精度なSLAM"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845713023857280","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Visual Monocular Localization, Mapping, and Motion Estimation of a Rotating Small Celestial Body"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1177/0278364911430419"},{"@type":"CROSSREF","@value":"10.1016/j.robot.2025.104929_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"},{"@type":"CROSSREF","@value":"10.1016/j.robot.2024.104750_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"},{"@type":"CROSSREF","@value":"10.20965/jaciii.2022.p0206_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"},{"@type":"CROSSREF","@value":"10.20965/jrm.2017.p0856_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"},{"@type":"CROSSREF","@value":"10.9746/sicetr.60.631_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"},{"@type":"CROSSREF","@value":"10.1109/access.2024.3461655_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"},{"@type":"CROSSREF","@value":"10.9746/sicetr.61.524_references_DOI_3osFCk5m1b1m5l4MYDPtZfz5Jub"}]}