{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/108927"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/108927","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Analytical SLAM without linearization","abstract":"This thesis solves the classical problem of simultaneous localization and mapping (SLAM) in a fashion which avoids linearized approximations altogether. Based on creating virtual synthetic measurements, the algorithm uses a linear time-varying (LTV) Kalman observer, bypassing errors and approximations brought by the linearization process in traditional extended Kalman filtering (EKF) SLAM. Convergence rates of the algorithm are established using contraction analysis. Different combinations of sensor information can be exploited, such as bearing measurements, range measurements, optical flow, or time-to-contact. As illustrated in simulations, the proposed algorithm can solve SLAM problems in both 2D and 3D scenarios with guaranteed convergence rates in a full nonlinear context. A novel distributed algorithm SLAM-DUNK is proposed in the thesis. The algorithm uses virtual vehicles to achieve information exclusively from corresponding landmarks. Computation complexity is reduced to 0(n), with simulations on Victoria Park dataset to support the validity of the algorithm. In the final section of the thesis, we propose a general framework for cooperative navigation and mapping. The frameworks developed for three different use cases use the null space terms of SLAM problem to guarantee that robots starting with unknown initial conditions could converge to a shared consensus coordinate system with estimates reflecting the truth.","abstract_html":"This thesis solves the classical problem of simultaneous localization and mapping (SLAM) in a fashion which avoids linearized approximations altogether. Based on creating virtual synthetic measurements, the algorithm uses a linear time-varying (LTV) Kalman observer, bypassing errors and approximations brought by the linearization process in traditional extended Kalman filtering (EKF) SLAM. Convergence rates of the algorithm are established using contraction analysis. Different combinations of sensor information can be exploited, such as bearing measurements, range measurements, optical flow, or time-to-contact. As illustrated in simulations, the proposed algorithm can solve SLAM problems in both 2D and 3D scenarios with guaranteed convergence rates in a full nonlinear context. A novel distributed algorithm SLAM-DUNK is proposed in the thesis. The algorithm uses virtual vehicles to achieve information exclusively from corresponding landmarks. Computation complexity is reduced to 0(n), with simulations on Victoria Park dataset to support the validity of the algorithm. In the final section of the thesis, we propose a general framework for cooperative navigation and mapping. The frameworks developed for three different use cases use the null space terms of SLAM problem to guarantee that robots starting with unknown initial conditions could converge to a shared consensus coordinate system with estimates reflecting the truth.","abstract_has_math":false,"creators":["Tan, Feng, Ph. D. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Mechanical Engineering.","school":null,"contributors":[],"advisors":["Jean-Jacques Slotine."],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-22T22:22:10Z","subjects":["Mechanical Engineering."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/108927","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Jean-Jacques Slotine."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Mechanical Engineering."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Mechanical Engineering."]},{"key":"dc:creator","label":"Author","values":["Tan, Feng, Ph. D. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-05-11T19:56:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-05-11T19:56:08Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mechanical Engineering."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/108927"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2017.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 161-173)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis solves the classical problem of simultaneous localization and mapping (SLAM) in a fashion which avoids linearized approximations altogether. Based on creating virtual synthetic measurements, the algorithm uses a linear time-varying (LTV) Kalman observer, bypassing errors and approximations brought by the linearization process in traditional extended Kalman filtering (EKF) SLAM. Convergence rates of the algorithm are established using contraction analysis. Different combinations of sensor information can be exploited, such as bearing measurements, range measurements, optical flow, or time-to-contact. As illustrated in simulations, the proposed algorithm can solve SLAM problems in both 2D and 3D scenarios with guaranteed convergence rates in a full nonlinear context. A novel distributed algorithm SLAM-DUNK is proposed in the thesis. The algorithm uses virtual vehicles to achieve information exclusively from corresponding landmarks. Computation complexity is reduced to 0(n), with simulations on Victoria Park dataset to support the validity of the algorithm. In the final section of the thesis, we propose a general framework for cooperative navigation and mapping. The frameworks developed for three different use cases use the null space terms of SLAM problem to guarantee that robots starting with unknown initial conditions could converge to a shared consensus coordinate system with estimates reflecting the truth."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Analytical SLAM without linearization"]}]}],"canonical_facts":{"dc:contributor.advisor":["Jean-Jacques Slotine."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Mechanical Engineering."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Mechanical Engineering."],"dc:creator":["Tan, Feng, Ph. D. Massachusetts Institute of Technology"],"dc:date.accessioned":["2017-05-11T19:56:08Z"],"dc:date.available":["2017-05-11T19:56:08Z"],"dc:date.issued":["2017"],"dc:description":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2017.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 161-173)."],"dc:description.abstract":["This thesis solves the classical problem of simultaneous localization and mapping (SLAM) in a fashion which avoids linearized approximations altogether. Based on creating virtual synthetic measurements, the algorithm uses a linear time-varying (LTV) Kalman observer, bypassing errors and approximations brought by the linearization process in traditional extended Kalman filtering (EKF) SLAM. Convergence rates of the algorithm are established using contraction analysis. Different combinations of sensor information can be exploited, such as bearing measurements, range measurements, optical flow, or time-to-contact. As illustrated in simulations, the proposed algorithm can solve SLAM problems in both 2D and 3D scenarios with guaranteed convergence rates in a full nonlinear context. A novel distributed algorithm SLAM-DUNK is proposed in the thesis. The algorithm uses virtual vehicles to achieve information exclusively from corresponding landmarks. Computation complexity is reduced to 0(n), with simulations on Victoria Park dataset to support the validity of the algorithm. In the final section of the thesis, we propose a general framework for cooperative navigation and mapping. The frameworks developed for three different use cases use the null space terms of SLAM problem to guarantee that robots starting with unknown initial conditions could converge to a shared consensus coordinate system with estimates reflecting the truth."],"dc:description.degree":["Ph. D."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/108927"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Mechanical Engineering."],"dc:title":["Analytical SLAM without linearization"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:10Z"}