Search

This paper proposes a hierarchical roadmap (HRM) and its construction process to efficiently represent navigable areas in an indoor environment. HRM is adopted to solve the path‐planning problems of mobile robots in indoor environments. HRM has a multi‐layered graphical structure that enables it to abstract and cover navigable areas using a smaller number of nodes and edges than a probabilistic roadmap. During the incremental process of constructing HRM, information on navigable areas is abstracted using a sonar gridmap when the mobile robot navigates an unexplored area. The HRM‐based planner efficiently searches for paths to answer queries by reducing the search space size using the multi‐layered graphical structure. The benefits of the proposed HRM are experimentally verified in real indoor environments. [ABSTRACT FROM AUTHOR]

This paper presents a localization method for a mobile robot equipped with only low-cost ultrasonic sensors. Correlation-based Hough scan matching was used to obtain the robot’s pose without any predefined geometric features. A local grid map and a sound pressure model of ultrasonic sensors were used to acquire reliable scan results from uncertain and noisy ultrasonic sensor data. The robot’s pose was measured using correlation-based Hough scan matching, and the covariance was calculated. Localization was achieved by fusing the measurements from scan matching with the robot’s motion model through the extended Kalman filter. Experimental results verified the performance of the proposed localization method in a real home environment. [ABSTRACT FROM PUBLISHER]

This paper proposes a method to efficiently abstract the traversable regions of a bounded two-dimensional environment using the probabilistic roadmap (PRM) to plan the path for a mobile robot. The proposed method uses centroidal Voronoi tessellation to autonomously rearrange the positions of initially randomly generated nodes. The PRM using the rearranged nodes covers most of the traversable regions in the environment and regularly divides them. The rearranged roadmap reduces the search space of a graph search algorithm and helps to promptly answer arbitrary queries in the environment. The mobile robot path planner using the proposed rearranged roadmap was integrated with a local planner that considers the kinematic properties of a mobile robot, and the efficiency and the safety of the paths were verified by simulation. [ABSTRACT FROM PUBLISHER]

We propose a robust simultaneous localization and mapping (SLAM) with a Rao-Blackwellized particle filter (RBPF) algorithm for mobile robots using sonar sensors in non-static environments. The algorithm consists of three parts: sampling from multiple ancestor sets, estimating intermediate paths for map updates and eliminating spurious landmarks using negative information from sonar sensors. The proposed sampling method, in which particles are sampled from multiple ancestor sets, increases the robustness of the estimation of the robot's pose, even if environmental changes corrupt observations. This step increases the probability of some particles being sampled from correct ancestor sets that are updated by observations reflected from stationary objects. When particles are sampled from several time steps earlier, however, observations at intermediate time steps cannot be used to update the map because of the lack of information about the intermediate path. To update the map with all sensor information, the intermediate path is estimated after particles are sampled from ancestor sets. Finally, spurious landmarks still exist on the map representing objects that were eliminated or that were extracted by error in cluttered areas. These are eliminated in the final step using negative information from the sonar sensors. The performance of the proposed SLAM algorithm was verified through simulations and experiments in various non-static environments. [ABSTRACT FROM AUTHOR]

This paper presents a method for building a probability grid map for autonomous mobile robots with ultrasonic sensors using a data association filter (DAF). The method is based on evaluating the possibility that the acquired sonar data are all reflected by the same object. The DAF is able to associate data points with each other. Data affected by specular reflection are not likely to be associated with the same object, so they are excluded from the data cluster by the DAF, thereby improving the reliability of the data used for the probability grid map. Since the corrupted data are not used to update the probability map, it is possible to build a good quality grid map even in a specular environment. The DAF was applied to the Bayesian and the Orientation probability models, which are typical models used to build grid maps, to verify its effectiveness. Experimental results were also obtained using a mobile robot in a real-world environment. [ABSTRACT FROM AUTHOR]

This paper proposes a shortest path generation scheme for point stabilization of the car-like robot. An implicit shortest point stabilization algorithm has been suggested conceptually by Vendittelli. As an extension, we present an algorithm which is more explicit and faster than previous one. Our scheme provides exact equations for practical implementation. Moreover, its computation time is remarkably lower than the previous one for the case in which the final point changes frequently. We provide a proof of the optimality and validate the performance of our algorithm through the simulation and experiment. [ABSTRACT FROM AUTHOR]