Explore the vast range of titles available.

A fundamental task in robotics is to plan collision‐free motions among a set of obstacles. Recently, learning‐based motion‐planning methods have shown significant advantages in solving different planning problems in high‐dimensional spaces and complex environments. This article serves as a survey of various different learning‐based methods that have been applied to robot motion‐planning problems, including supervised, unsupervised learning, and reinforcement learning. These learning‐based methods either rely on a human‐crafted reward function for specific tasks or learn from successful planning experiences. The classical definition and learning‐related definition of motion‐planning problem are provided in this article. Different learning‐based motion‐planning algorithms are introduced, and the combination of classical motion‐planning and learning techniques is discussed in detail.

This paper describes a socially compliant path planning scheme for robotic autonomous luggage trolley collection at airports. The robot is required to efficiently collect all assigned luggage trolleys in a designated area, while avoiding obstacles and not offending the pedestrians. This path planning problem is formulated in this paper as a Traveling Salesman Problem (TSP). Different from the conventional solutions to the TSP, in which the Euclidean distance between two sites is used as the metric, a high-dimensional metric including the factor of pedestrians’ feelings is applied in this work. To obtain the new metric, a novel potential function is firstly proposed to model the relationship between the robot, luggage trolleys, obstacles, and pedestrians. The Social Force Model (SFM) is utilized so that the pedestrians can bring extra influence on the potential field, different from ordinary obstacles. Directed by the attractive and repulsive force generated from the potential field, a number of paths connecting the robot and the luggage trolley, or two luggage trolleys, can be obtained. The length of the generated path is considered as the new metric. The Self-Organizing Map (SOM) satisfies the job of finding a final path to connect all luggage trolleys and the robot located in the potential field, as it can find the intrinsic connection in the high dimensional space. Therefore, while incorporating the new metric, the SOM is used to find the optimal path in which the robot can collect the assigned luggage trolleys in sequence. As a demonstration, the proposed path planning method is implemented in simulation experiments, showing an increase of efficiency and efficacy.

Complex environments pose great challenges for autonomous mobile robot navigation. In this study, we address the problem of autonomous navigation in 3D environments with staircases and slopes. An integrated system for safe mobile robot navigation in 3D complex environments is presented and both the perception and navigation capabilities are incorporated into the modular and reusable framework. Firstly, to distinguish the slope from the staircase in the environment, the robot builds a 3D OctoMap of the environment with a novel Simultaneously Localization and Mapping (SLAM) framework using the information of wheel odometry, a 2D laser scanner, and an RGB-D camera. Then, we introduce the traversable map, which is generated by the multi-layer 2D maps extracted from the 3D OctoMap. This traversable map serves as the input for autonomous navigation when the robot faces slopes and staircases. Moreover, to enable robust robot navigation in 3D environments, a novel camera re-localization method based on regression forest towards stable 3D localization is incorporated into this framework. In addition, we utilize a variable step size Rapidly-exploring Random Tree (RRT) method which can adjust the exploring step size automatically without tuning this parameter manually according to the environment, so that the navigation efficiency is improved. The experiments are conducted in different kinds of environments and the output results demonstrate that the proposed system enables the robot to navigate efficiently and robustly in complex 3D environments.

This paper presents an improved calibration method of a rotating two-dimensional light detection and ranging (R2D-LIDAR) system, which can obtain the 3D scanning map of the surroundings. The proposed R2D-LIDAR system, composed of a 2D LIDAR and a rotating unit, is pervasively used in the field of robotics owing to its low cost and dense scanning data. Nevertheless, the R2D-LIDAR system must be calibrated before building the geometric model because there are assembled deviation and abrasion between the 2D LIDAR and the rotating unit. Hence, the calibration procedures should contain both the adjustment between the two devices and the bias of 2D LIDAR itself. The main purpose of this work is to resolve the 2D LIDAR bias issue with a flat plane based on the Levenberg–Marquardt (LM) algorithm. Experimental results for the calibration of the R2D-LIDAR system prove the reliability of this strategy to accurately estimate sensor offsets with the error range from −15 mm to 15 mm for the performance of capturing scans.

Recently, a variety of positioning and tracking methods have been proposed for capsule robots moving in the gastrointestinal (GI) tract to provide real-time unobstructed spatial pose results. However, the current absolute position-based result cannot match the GI structure due to its unstructured environment. To overcome this disadvantage and provide a proper position description method to match the GI tract, we here present a relative position estimation method for tracking the capsule robot, which uses the moving distance of the robot along the GI tract to indicate the position result. The procedure of the proposed method is as follows: firstly, the absolute position results of the capsule robot are obtained with the magnetic tracking method; then, the moving status of the robot along the GI tract is determined according to the moving direction; and finally, the movement trajectory of the capsule robot is fitted with the Bézier curve, where the moving distance can then be evaluated using the integral method. Compared to state-of-the-art capsule tracking methods, the proposed method can directly help to guide medical instruments by providing physicians the insertion distance in patients’ bodies, which cannot be done based on absolute position results. Moreover, as relative distance information was used, no reference tracking objects needed to be mounted onto the human body. The experimental results prove that the proposed method achieves a good distance estimation of the capsule robot moving in the simulation platform.

Autonomous fabric manipulation is a challenging task due to complex dynamics and potential self-occlusion during fabric handling. An intuitive method of fabric-folding manipulation first involves obtaining a smooth and unfolded fabric configuration before the folding process begins. However, the combination of quasi-static actions like pick & place and dynamic action like fling proves inadequate in effectively unfolding long-sleeved T-shirts with sleeves mostly tucked inside the garment. To address this limitation, this paper introduces an enhanced quasi-static action called pick & drag, specifically designed to handle this type of fabric configuration. Additionally, an efficient dual-arm manipulation system is designed in this paper, which combines quasi-static (including pick & place and pick & drag) and dynamic fling actions to flexibly manipulate fabrics into unfolded and smooth configurations. Subsequently, once it is confirmed that the fabric is sufficiently unfolded and all fabric keypoints are detected, the keypoint-based heuristic folding algorithm is employed for the fabric-folding process. To address the scarcity of publicly available keypoint detection datasets for real fabric, we gathered images of various fabric configurations and types in real scenes to create a comprehensive keypoint dataset for fabric folding. This dataset aims to enhance the success rate of keypoint detection. Moreover, we evaluate the effectiveness of our proposed system in real-world settings, where it consistently and reliably unfolds and folds various types of fabrics, including challenging situations such as long-sleeved T-shirts with most parts of sleeves tucked inside the garment. Specifically, our method achieves a coverage rate of 0.822 and a success rate of 0.88 for long-sleeved T-shirts folding. Supplemental materials and dataset are available on our project webpage at https://sites.google.com/view/fabricfolding.

Due to the fact that point clouds are always corrupted by significant noise and large transformations, aligning two point clouds by deep neural networks is still challenging. This paper presents a semi-supervised point cloud registration (PCR) method for accurately estimating point correspondences and handling large transformations using limited prior datasets. Firstly, a modified autoencoder is introduced as the feature extraction module to extract the distinctive and robust features for the downstream registration task. Unlike optimization-based pairwise PCR strategies, the proposed method treats two point clouds as two implementations of a Gaussian mixture model (GMM), which we call latent GMM. Based on the above assumption, two point clouds can be regarded as two probability distributions. Hence, the PCR of two point clouds can be approached by minimizing the KL divergence between these two probability distributions. Then, the correspondence between the point clouds and the latent GMM components is estimated using the augmented regression network. Finally, the parameters of GMM can be updated by the correspondence and the transformation matrix can be computed by employing the weighted singular value decomposition (SVD) method. Extensive experiments conducted on both synthetic and real-world data validate the superior performance of the proposed method compared to state-of-the-art registration methods. These experiments also highlight the method’s superiority in terms of accuracy, robustness, and generalization.

Concentric tube robot (CTR) has gradually attracted the attention of researchers on the basis of its small size and curved shape control ability. However, most of current experimental prototypes of CTR are single-arm structure, which can only carry out simple operation such as drug delivery or monitoring. In this paper, design and analysis of a three-arm CTR system is proposed. It has a four-DOF vision arm and two six-DOF manipulator arms, which equipped with special end effectors to achieve different surgical operations. Finally, a mean motion accuracy of 0.33 mm has been obtained quantitatively through teleoperation experiments. Moreover, tissue excision experiment in skull model is carried out to prove the effectiveness and feasibility of the proposed CTR system in nasopharyngeal carcinoma surgery.

This article focuses on the luggage trolley transportation problem, an essential part of robotic autonomous luggage trolley collection. To efficiently address the nonholonomic constraints derived from the formation of two collaborative robots and a queue of luggage trolleys, we propose a comprehensive framework consisting of a global planning method and a real-time divide-and-conquer control strategy. The popular Hybrid A* algorithm generates a feasible path as the global planner. A model predictive controller is designed to track this path stably and in real time. To maintain the formation so that the whole queue of robots and luggage trolleys does not split, a safety filter that consists of a discrete-time control Lyapunov function and a decentralized control barrier function is implemented in the transportation process. Finally, we conduct real-world experiments to verify the effectiveness of the proposed method on three representative paths, and the results show that our approach can achieve robust performance. The demonstration video can be found at https://www.youtube.com/watch?v=iPiT8BfLIpU.

This study develops a novel sampling-based path planning approach, simultaneously achieving uncertainty reduction of localization and avoidance of dynamic obstacles. The proposed path planner can generate a set of path primitives and the path selection takes into account the localization uncertainty, the collision-risk, and the cost-to-go to the target area. The weights of these quantities for selecting an optimal path are tuned adaptively by using the entropy weight method. In the process of path primitive generation, we propose an adaptive planning horizon scheme that can generate a longer path with lower localization uncertainty. Particularly, to further reduce the localization uncertainty of the path primitive, we propose a sampling strategy that is capable of biasing the sampling points to the information-rich areas. To reduce the collision-risk, we propose to calculate the probability of collision by taking the uncertainty of both the robot and the dynamic objects into consideration. The proposed approach and its key components are verified in extensive experiments in both simulation and real-world environments. The proposed method is demonstrated to be capable of efficiently guiding the robot to the designated location with lower localization uncertainty and higher success rate in obstacle avoidance.