27 research outputs found

    Unsupervised Learning for Subterranean Junction Recognition Based on 2D Point Cloud

    Get PDF
    This article proposes a novel unsupervised learning framework for detecting the number of tunnel junctions in subterranean environments based on acquired 2D point clouds. The implementation of the framework provides valuable information for high level mission planners to navigate an aerial platform in unknown areas or robot homing missions. The framework utilizes spectral clustering, which is capable of uncovering hidden structures from connected data points lying on non-linear manifolds. The spectral clustering algorithm computes a spectral embedding of the original 2D point cloud by utilizing the eigen decomposition of a matrix that is derived from the pairwise similarities of these points. We validate the developed framework using multiple data-sets, collected from multiple realistic simulations, as well as from real flights in underground environments, demonstrating the performance and merits of the proposed methodology

    Unsupervised Learning for Subterranean Junction Recognition Based on 2D Point Cloud

    Get PDF
    This article proposes a novel unsupervised learning framework for detecting the number of tunnel junctions in subterranean environments based on acquired 2D point clouds. The implementation of the framework provides valuable information for high level mission planners to navigate an aerial platform in unknown areas or robot homing missions. The framework utilizes spectral clustering, which is capable of uncovering hidden structures from connected data points lying on non-linear manifolds. The spectral clustering algorithm computes a spectral embedding of the original 2D point cloud by utilizing the eigen decomposition of a matrix that is derived from the pairwise similarities of these points. We validate the developed framework using multiple data-sets, collected from multiple realistic simulations, as well as from real flights in underground environments, demonstrating the performance and merits of the proposed methodology

    Vehicle Localization Based on Visual Lane Marking and Topological Map Matching

    Get PDF
    International audienceAccurate and reliable localization is crucial to autonomous vehicle navigation and driver assistance systems. This paper presents a novel approach for online vehicle localization in a digital map. Two distinct map matching algorithms are proposed: i) Iterative Closest Point (ICP) based lane level map matching is performed with visual lane tracker and grid map ii) decision-rule based approach is used to perform topological map matching. Results of both the map matching algorithms are fused together with GPS and dead reckoning using Extended Kalman Filter to estimate vehicle's pose relative to the map. The proposed approach has been validated on real life conditions on an equipped vehicle. Detailed analysis of the experimental results show improved localization using the two aforementioned map matching algorithm

    Object and Pattern Association for Robot Localization

    Get PDF

    Object and Pattern Association for Robot Localization

    Get PDF

    Dynamic obstacles avoidance algorithms for unmanned ground vehicles

    Get PDF
    En las últimas décadas, los vehículos terrestres no tripulados (UGVs) están siendo cada vez más empleados como robots de servicios. A diferencia de los robots industriales, situados en posiciones fijas y controladas, estos han de trabajar en entornos dinámicos, compartiendo su espacio con otros vehículos y personas. Los UGVs han de ser capaces de desplazarse sin colisionar con ningún obstáculo, de tal manera que puedan asegurar tanto su integridad como la del entorno. En el estado del arte encontramos algoritmos de navegación autónoma diseñados para UGVs que son capaces de planificar rutas de forma segura con objetos estáticos y trabajando en entornos parcialmente controlados. Sin embargo, cuando estos entornos son dinámicos, se planifican rutas más peligrosas y que a menudo requieren de un mayor consumo de energía y recursos, e incluso pueden llegar a bloquear el UGV en un mínimo local. En esta tesis, la adaptación de algunos algoritmos disponibles en el estado del arte para trabajar en entornos dinámicos han sido planteados. Estos algoritmos incluyen información temporal tales como los basados en arcos de curvatura (PCVM y DCVM) y los basados en ventanas dinámicas (DW4DO y DW4DOT). Además, se ha propuesto un planificador global basado en Lattice State Planner (DLP) que puede resolver situaciones donde los evitadores de obstáculos reactivos no funcionan. Estos algoritmos han sido validados tanto en simulación como en entornos reales, utilizando distintas plataformas robóticas, entre las que se incluye un robot asistente (RoboShop) diseñado y construido en el marco de esta tesis
    corecore