9 February 2022 in IEEE Transactions on Industrial Electronics
In this article presents a trajectory planning approach toward safe and smooth robot motion in dynamic environments. We develop a hierarchical planning framework with a global planner generating the shortest path between the robot and the navigation target. Specially, a virtual target (VT) is set to run on the global path with a designed velocity. At the local level, the robot chases the VT and tracks the global path when traveling through the dynamic environment. We employ the model predictive control (MPC) framework for the local path generation. In particular, the prediction horizon of the MPC is adaptively changed concerning the distance between the robot and the VT. It implicitly reflects the crowdedness of the environment, which helps reduce the environmental uncertainty. Besides, we develop an event-triggered mechanism that executes the local plan aperiodically to release the computational burden. Based on the local chasing and tracking performance, we develop a global path replanning scheme in response to the untraversable area emerging in the dense environment. The developed framework is validated through extensive experiments in dynamic environments, demonstrating that the robot can reach the target faster and showcase a safer and smoother trajectory in the navigation.
30 June 2023 in Biomimetic Intelligence and Robotics
20 July 2022 in IEEE Transactions on Automation Science and Engineering
Sampling-based path planning algorithms usually implement uniform sampling methods to search the state space. However, uniform sampling may lead to unnecessary exploration in many scenarios, such as the environment with a few dead ends. Our previous work proposes to use the promising region to guide the sampling process to address the issue. However, the predicted promising regions are often disconnected, which means they cannot connect the start and goal states, resulting in a lack of probabilistic completeness. This work focuses on enhancing the connectivity of predicted promising regions. Our proposed method regresses the connectivity probability of the edges in the x and y directions. In addition, it calculates the weight of the promising edges in loss to guide the neural network to pay more attention to the connectivity of the promising regions. We conduct a series of simulation experiments, and the results show that the connectivity of promising regions improves significantly. Furthermore, we analyze the effect of connectivity on sampling-based path planning algorithms and conclude that connectivity plays an essential role in maintaining algorithm performance. Note to Practitioners—This work is derived from the promising region prediction for sampling-based path planning. The sampling-based path planning methods have been widely used in robotics due to their efficiency. To further improve the efficiency of these algorithms, sampling in the promising region predicted by a neural network is introduced into the sampling procedure. However, the connectivity of the promising region has yet to be considered, and it will affect the performance of the algorithms in several aspects. To demonstrate this problem, we compare the performance of the neural heuristic algorithms under different connectivity statuses in this paper. Furthermore, to enhance the connectivity of the predicted promising region, the novel prediction output and loss function are proposed. The simulation results show improvements in the algorithms after utilizing our method.
5 June 2023 in IEEE Transactions on Automation Science and Engineering
Adaptively Informed Trees (AIT*) is an algorithm that uses the problem-specific heuristic to avoid unnecessary searches, which significantly improves its performance, especially when collision checking is expensive. However, the heuristic estimation in AIT* consumes lots of computational resources, and its asymmetric bidirectional searching strategy cannot fully exploit the potential of the bidirectional method. In this article, we propose an extension of AIT* called BiAIT*. Unlike AIT*, BiAIT* uses symmetrical bidirectional search for both the heuristic and space searching. The proposed method allows BiAIT* to find the initial solution faster than AIT*, and update the heuristic with less computation when a collision occurs. We evaluated the performance of BiAIT* through simulations and experiments, and the results show that BiAIT* can find the solution faster than state-of-the-art methods. We also analyze the reasons for the different performances between BiAIT* and AIT*. Furthermore, we discuss two simple but effective modifications to fully exploit the potential of the adaptively heuristic method. Note to Practitioners —This work is inspired by the adaptively heuristic method and the symmetrical bidirectional searching method. The article introduces a novel algorithm that uses the symmetrical bidirectional method to calculate the adaptive heuristic and efficiently search the state space. The problem-specific heuristic in BiAIT* is derived from a lazy-forward tree and a lazy-reverse tree, which are constructed without collision checking. The lazy-forward and lazy-reverse trees are enabled to meet in the middle, thus generating the effective and accurate heuristic. In BiAIT*, the lazy-forward and lazy-reverse trees share heuristic information and jointly guide the growth of the forward and reverse trees, which conduct collision checking and guarantee the feasibility of their edges. Compared with state-of-the-art methods, BiAIT* finds the initial heuristic and updates the heuristic more quickly. The proposed algorithm can be applied to industrial robots, medical robots, or service robots to achieve efficient path planning. The implementation of BiAIT* is available at https://github.com/Licmjy-CU/BiAITstar.
30 November 2010 in Journal of Convergence Information Technology