Autonomous shuttle development has gained popularity as one of the research development areas in autonomous vehicle field. In this chapter, the shuttle development in Universiti Malaysia Pahang is highlighted, while its vehicle simulation environment is developed to mimic the real environment of the university which consists of many roundabout junctions. The roundabout environment is constructed in vehicle simulator for data logging and testing and then published to the ROS network. Point cloud matrices from different moving frames are stitched using iterative closest point (ICP) algorithm to form a final useful map for further post-processing. The ICP algorithm performance is shown with different number of stitching frames and the results show that the algorithm is capable to show a reliable single map from different point cloud frames.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Autonomous Shuttle Development at Universiti Malaysia Pahang: LiDAR Point Cloud Data Stitching and Mapping Using Iterative Closest Point Cloud Algorithm


    Weitere Titelangaben:

    EAI/Springer Innovations in Communication and Computing


    Beteiligte:


    Erscheinungsdatum :

    2021-06-18


    Format / Umfang :

    12 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    The Parallel Iterative Closest Point Algorithm

    Langis, C. / Greenspan, M. / Godin, G. et al. | British Library Conference Proceedings | 2001


    The parallel iterative closest point algorithm

    Langis, C. / Greenspan, M. / Godin, G. | IEEE | 2001


    Fast Iterative Closest Point framework for 3D LIDAR data in intelligent vehicle

    Choi, Won-Seok / Kim, Yang-Shin / Oh, Se-Young et al. | IEEE | 2012


    Compression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm

    Gupta, S. / Sengupta, K. / Kassim, A. A. | British Library Online Contents | 2002