Time optimality and completeness are desired properties for robot trajectory planning, which ensure that robotic systems work reliably and efficiently. However, there is great difficulty to design planning algorithms that simultaneously guarantee time optimality and completeness. In this paper, a complete, time-optimal and real-time algorithm for path-constrained trajectory planning is proposed under both torque and velocity constraints. The time optimality and completeness of the proposed algorithm are theoretically proven with rigorous mathematical analysis. Moreover, the proposed approach is general and applicable on different robotic systems, and two examples are given on a two-link manipulator and an active-caster-based omnidirectional wheeled mobile robot. Comparative simulation and experimental results are provided to demonstrate the superior performance of the proposed algorithm.

In this paper, a multilevel humanlike motion planning approach is proposed for indoor mobile robots. Compared with existing approaches, the novelty of this paper is twofold: 1) the proposed path planning framework is multilevel and humanlike to ensure both foreseeability and flexibility, wherein functions of human brain, eyes, and legs are corresponding to global path planning, sensor-level path planning, and action-level path planning, respectively, and 2) along the planned path, a new velocity-adjustable trajectory planning algorithm is put forward which is provably complete and time optimal considering multiple constraints from both the robot and the environment. Experimental results show that the proposed approach has a better performance in terms of efficiency, smoothness, foreseeability, and flexibility, and autonomous navigation is realized in large-scale, dynamic, partially unknown, and unstructured indoor environments.

In this paper, a novel multi-robot autonomous exploration approach CURE is proposed based on dynamic Voronoi diagrams and centroids of unknown connected regions. Compared with existing approaches, the novelty of this work is twofold: 1) Dynamic Voronoi diagram is used for partition of the space being explored to improve the efficiency of multi-robot exploration, and then a new parameter-insensitive utility function is elaborately designed to evaluate the information of centroids, which helps guide the robot to explore unknown regions. 2) A hierarchical framework consisting of global and local exploration windows for detecting centroids is designed, wherein the global exploration window is activated to find centroids to guide the robot exploration when there are no centroids in any one local exploration window. We validate the feasibility and exploration efficiency of the proposed approach in various complex simulation scenarios and challenging real-world tasks. All test results show that the exploration time consumption and path cost are reduced by up to 50.7% and 34.4%, respectively, compared with an advanced RRT-based multi-robot exploration approach. (Supplementary video link: https://youtu.be/P5jXKlGQOec) Note to Practitioners —This paper is motivated by the efficient multi-robot autonomous exploration problem. In some applications such as target search and disaster rescue, the information about the environment is totally unknown to the robots, and thus they are required to explore unknown environments autonomously. In this case, it is necessary to improve the efficiency of multi-robot exploration due to the time limitation of the task and the battery capacity. In this paper, a hierarchical framework is proposed to improve the efficiency of multi-robot autonomous exploration. Each robot only needs to explore the Voronoi partition it is responsible for and is guided to the unknown region by the centroid detected in the global and local exploration windows. Overall, the proposed approach can dramatically reduce the exploration time and path cost.

In this paper, a novel 2-D laser-based autonomous exploration approach for mobile robots is proposed, which is based on a novel polygon map construction approach and graph-based simultaneous localization and mapping (SLAM) with directional endpoint features. This approach is composed of three modules: graph-based SLAM using directional endpoint features, polygon map construction, and exploration. Different from existing approaches in the field of 2-D SLAM, the newly proposed 2-D graph-SLAM is based on 3-D ``directional endpoint'' features; on this basis, a well-known data structure ``circular-doubly linked list'' is applied to construct a novel polygon map for navigation. Note that it is efficient for circular-doubly linked list to initialize and update the polygon map. In addition, we propose a new information entropy calculation approach to quantify the entropy of the polygon map. Then for each candidate goal, we could obtain corresponding information gain and make next decision through collision detection. Comparative experimental results with respect to the well-known Gmapping and Karto SLAM are presented to show superior performance of the proposed graph-based SLAM. The autonomous exploration experiments in the office and hallway environments show the effectiveness of the proposed approach for robotic mapping and exploration tasks.

Planes and edges are attractive features for simultaneous localization and mapping (SLAM) in indoor environments because they can be reliably extracted and are robust to illumination changes. However, it remains a challenging problem to seamlessly fuse two different kinds of features to avoid degeneracy and accurately estimate the camera motion. In this article, a plane-edge-SLAM system using an RGB-D sensor is developed to address the seamless fusion of planes and edges. Constraint analysis is first performed to obtain a quantitative measure of how the planes constrain the camera motion estimation. Then, using the results of the constraint analysis, an adaptive weighting algorithm is elaborately designed to achieve seamless fusion. Through the fusion of planes and edges, the solution to motion estimation is fully constrained, and the problem remains well-posed in all circumstances. In addition, a probabilistic plane fitting algorithm is proposed to fit a plane model to the noisy 3-D points. By exploiting the error model of the depth sensor, the proposed plane fitting is adaptive to various measurement noises corresponding to different depth measurements. As a result, the estimated plane parameters are more accurate and robust to the points with large uncertainties. Compared with the existing plane fitting methods, the proposed method definitely benefits the performance of motion estimation. The results of extensive experiments on public data sets and in real-world indoor scenes demonstrate that the plane-edge-SLAM system can achieve high accuracy and robustness.

This paper proposes a novel nonlinear geometric hierarchical dynamic visual servoing approach to drive a quadrotor to the desired pose defined by a previously captured image of a planar target. Different from existing works, the key novelty is to extend the position-based nonlinear hierarchical control to image-based nonlinear hierarchical control. More specifically, by seamlessly integrating the nonlinear hierarchical control with the geometric control, and taking full advantage of the cascade property of the system, the proposed visual servoing strategy does not require the thrust force or its derivative to be measurable when compared with the existing backstepping methods, which brings much convenience for practical applications. For the attitude loop, the axis-angle rotation representation is adopted to design a tracking control law on the vectorspace ${\mathfrak{so}{(3)}}$ . In the outer loop, perspective image moments in the virtual image plane are employed as image feedback to construct the outer-loop image-based visual servoing controller with geometric control and backstepping techniques. Based on Lyapunov techniques and the theory of cascade systems, it is rigorously proven that the proposed image-based controller achieves asymptotic stability. Comparative experiments are conducted to show that the proposed approach has advantages of better transient performance, better steady-state performance and stronger robustness.