Search results

Aiming at the problem of insufficient adaptability of robot motion planners under the diversity of end-effector constraints, this paper proposes Transformation Cross-sampling Framework (TC-Framework) that enables the planner to adapt to different end-effector constraints.

This work presents a standard constraint methodology for representing end-effector constraints as a collection of constraint primitives. The constraint primitives are merged sequentially into the planner, and a unified constraint input interface and constraint module are added to the standard sampling-based planner framework. This approach enables the realization of a generic planner framework that avoids the need to build separate planners for different end-effector constraints.

Simulation tests have demonstrated that the planner based on TC-framework can adapt to various end-effector constraints. Physical experiments have also confirmed that the framework can be used in real robotic systems to perform autonomous operational tasks. The framework’s strong compatibility with constraints allows for generalization to other tasks without modifying the scheduler, significantly reducing the difficulty of robot deployment in task-diverse scenarios.

This paper proposes a unified constraint method based on constraint primitives to enhance the sampling-based planner. The planner can now adapt to different end effector constraints by opening up the input interface for constraints. A series of simulation tests were conducted to evaluate the TC-Framework-based planner, which demonstrated its ability to adapt to various end-effector constraints. Tests on a physical experimental system show that the framework allows the robot to perform various operational tasks without requiring modifications to the planner. This enhances the value of robots for applications in fields with diverse tasks.

The purpose of this paper is to address two major challenges faced by robotic fish when operating in underwater environments: insufficient path planning capabilities and difficulties in avoiding dynamic obstacles. To achieve this, a method is proposed that combines the Improved Rapid Randomized Tree Star (IRRT*) with the dynamic window approach (DWA).

The RRT-connect algorithm is used to determine an initial feasible path quickly. The quality of sampling points is then improved by dividing the regions and selecting each region’s probability based on its fitness value. The fitness function and roulette wheel method are introduced for region selection. Subtarget points of the DWA algorithm are extracted from the IRRT* algorithm to achieve real-time dynamic path planning.

In various maps, the iteration count for the IRRT* algorithm decreased by 61%, 35% and 51% respectively, compared to the RRT* algorithm, whereas the iteration time was reduced by 75%, 34% and 57%, respectively. In addition, the IRRT*-DWA algorithm can successfully navigate through multiple dynamic obstacles, and the average time, path length, etc. do not change much when parameters change, and the stability is high.

A novel IRRT*-DWA algorithm is proposed, which, by refining the sampling strategy and updating sub-target points in real time, not only addresses the limitations of existing algorithms in terms of path planning efficiency in complex environments but also enhances their capability to avoid dynamic obstacles. Ultimately, experimental results indicate a high level of similarity between the actual and ideal paths.