IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i2p1172-d1028856.html
   My bibliography  Save this article

Two-Dimensional-Simultaneous Localisation and Mapping Study Based on Factor Graph Elimination Optimisation

Author

Listed:
  • Xinzhao Wu

    (School of Mechanical and Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China)

  • Peiqing Li

    (School of Mechanical and Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China
    School of Mechanical Engineering, Zhejiang University, Hangzhou 310058, China)

  • Qipeng Li

    (School of Mechanical and Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China)

  • Zhuoran Li

    (Faculty of Information Technology, City University Malaysia, Petaling Jaya 46100, Malaysia)

Abstract

A robust multi-sensor fusion simultaneous localization and mapping (SLAM) algorithm for complex road surfaces is proposed to improve recognition accuracy and reduce system memory occupation, aiming to enhance the computational efficiency of light detection and ranging in complex environments. First, a weighted signed distance function (W-SDF) map-based SLAM method is proposed. It uses a W-SDF map to capture the environment with less accuracy than the raster size but with high localization accuracy. The Levenberg–Marquardt method is used to solve the scan-matching problem in laser SLAM; it effectively alleviates the limitations of the Gaussian–Newton method that may lead to insufficient local accuracy, and reduces localisation errors. Second, ground constraint factors are added to the factor graph, and a multi-sensor fusion localisation algorithm is proposed based on factor graph elimination optimisation. A sliding window is added to the chain factor graph model to retain the historical state information within the window and avoid high-dimensional matrix operations. An elimination algorithm is introduced to transform the factor graph into a Bayesian network to marginalize the historical states and reduce the matrix dimensionality, thereby improving the algorithm localisation accuracy and reducing the memory occupation. Finally, the proposed algorithm is compared and validated with two traditional algorithms based on an unmanned cart. Experiments show that the proposed algorithm reduces memory consumption and improves localisation accuracy compared to the Hector algorithm and Cartographer algorithm, has good performance in terms of accuracy, reliability and computational efficiency in complex pavement environments, and is better utilised in practical environments.

Suggested Citation

  • Xinzhao Wu & Peiqing Li & Qipeng Li & Zhuoran Li, 2023. "Two-Dimensional-Simultaneous Localisation and Mapping Study Based on Factor Graph Elimination Optimisation," Sustainability, MDPI, vol. 15(2), pages 1-20, January.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:2:p:1172-:d:1028856
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/2/1172/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/2/1172/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Łukasz Marchel & Cezary Specht & Mariusz Specht, 2020. "Testing the Accuracy of the Modified ICP Algorithm with Multimodal Weighting Factors," Energies, MDPI, vol. 13(22), pages 1-17, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrea Cassoni & Luigi Manganiello & Giorgio Barbera & Paolo Priore & Maria Teresa Fadda & Resi Pucci & Valentino Valentini, 2022. "Three-Dimensional Comparison of the Maxillary Surfaces through ICP-Type Algorithm: Accuracy Evaluation of CAD/CAM Technologies in Orthognathic Surgery," IJERPH, MDPI, vol. 19(18), pages 1-10, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:2:p:1172-:d:1028856. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.