We consider the task of mapping pedestrian urban areas for a robotic guidance and surveillance application. This mapping is performed by registering three-dimensional laser range scans acquired with two different robots. To solve this task we will use the Iterative Closes Point (ICP) algorithm proposed by Besl and Mackey, but for the minimization step we will use the metric proposed by Biota et al. trying to get advantage of the compensation between translation and rotation they mention. To reduce computational cost in the original ICP during matching, the correspondences search is done with the library Approximate Nearest Neighbor (ANN). Finally we propose a hierarchical new correspondence search strategy, using a point-to-plane strategy at the highest level and the point-to-point metric at finer levels. At the highest level the adjust error between a plane and it's n adjacent points describing the plane is computed, if this error is bigger than a threshold then we change the level. ; This work was supported by the project 'Ubiquitous networking robotics in urban settings' (E-00938).


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Registration of 3d point clouds for urban robot mapping


    Beteiligte:

    Erscheinungsdatum :

    01.01.2008


    Medientyp :

    Sonstige


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629



    Registration of 3d point clouds for urban robot mapping

    Teniente Avilés, Ernesto / Andrade-Cetto, Juan | BASE | 2008

    Freier Zugriff

    Point clouds registration system for autonomous vehicles

    HE RUNXIN / XIAO YONG / YUAN PENGFEI et al. | Europäisches Patentamt | 2023

    Freier Zugriff

    Geometric features for robust registration of point clouds

    Mützel, A. / Neuhaus, F. / Paulus, D. | British Library Online Contents | 2015


    A POINT CLOUDS REGISTRATION SYSTEM FOR AUTONOMOUS VEHICLES

    HE RUNXIN / XIAO YONG / YUAN PENGFEI et al. | Europäisches Patentamt | 2021

    Freier Zugriff