On the S-(nS)PU-SPU and S-(nS)PU-2SPU Under-Actuated Wrists

Author(s):  
Raffaele Di Gregorio

In a previous work, this author showed that ten topologies for under-actuated parallel wrists can be generated from the fully-parallel wrist. Three of them are obtained by simply replacing a spherical pair (S) with a nonholonomic spherical pair (nS). The S-(nS)PU-SPU, and S-(nS)PU-2SPU wrists are two of these three. The position analysis of these two wrists is studied in this paper. In particular, all the four position-analysis problems, which are necessary for implementing their path planning, are addressed and solved in closed-form. Despite their different topology, the position-analysis of these two wrists can be practically solved by using the same formulas and algorithms. Based on the deduced formulas, a path-planning algorithm is proposed. The obtained results make the studied wrist topologies able to replace “ordinary” wrists in the manipulation tasks which do not require tracking.

Author(s):  
Raffaele Di Gregorio

A novel type of parallel wrist (PW) is proposed which, differently from previously presented PWs, features a single-loop architecture and only one nonholonomic constraint. Due to the presence of a nonholonomic constraint, the proposed PW type is under-actuated, that is, it is able to control the platform orientation in a three-dimensional workspace by employing only two actuated pairs, one prismatic (P) and the other revolute (R); and it cannot perform tracking tasks. Position analysis and path planning of this novel PW are studied. In particular, all the relevant position analysis problems are solved in closed form, and, based on these closed-form solutions, a path-planning algorithm is built.


2012 ◽  
Vol 4 (2) ◽  
Author(s):  
Raffaele Di Gregorio

In a previous work, this author showed that ten topologies for underactuated parallel wrists can be generated from a fully parallel wrist (FPW). Three of them are obtained by simply replacing a spherical pair (S) with a nonholonomic spherical pair (nS). The S-(nS)PU-SPU and S-(nS)PU-2SPU wrists are two among these three. The position analysis of these two wrists is studied here. In particular, all the four position-analysis problems, which are necessary for implementing their path planning, are addressed and solved in closed form. Despite their different topology, the position analysis of these two wrists can be practically solved by using the same formulas and algorithms. Based on the deduced formulas, a path-planning algorithm is proposed. The obtained results make the studied wrist topologies able to replace “ordinary” wrists in the manipulation tasks which do not require tracking.


2021 ◽  
Vol 9 (3) ◽  
pp. 252
Author(s):  
Yushan Sun ◽  
Xiaokun Luo ◽  
Xiangrui Ran ◽  
Guocheng Zhang

This research aims to solve the safe navigation problem of autonomous underwater vehicles (AUVs) in deep ocean, which is a complex and changeable environment with various mountains. When an AUV reaches the deep sea navigation, it encounters many underwater canyons, and the hard valley walls threaten its safety seriously. To solve the problem on the safe driving of AUV in underwater canyons and address the potential of AUV autonomous obstacle avoidance in uncertain environments, an improved AUV path planning algorithm based on the deep deterministic policy gradient (DDPG) algorithm is proposed in this work. This method refers to an end-to-end path planning algorithm that optimizes the strategy directly. It takes sensor information as input and driving speed and yaw angle as outputs. The path planning algorithm can reach the predetermined target point while avoiding large-scale static obstacles, such as valley walls in the simulated underwater canyon environment, as well as sudden small-scale dynamic obstacles, such as marine life and other vehicles. In addition, this research aims at the multi-objective structure of the obstacle avoidance of path planning, modularized reward function design, and combined artificial potential field method to set continuous rewards. This research also proposes a new algorithm called deep SumTree-deterministic policy gradient algorithm (SumTree-DDPG), which improves the random storage and extraction strategy of DDPG algorithm experience samples. According to the importance of the experience samples, the samples are classified and stored in combination with the SumTree structure, high-quality samples are extracted continuously, and SumTree-DDPG algorithm finally improves the speed of the convergence model. Finally, this research uses Python language to write an underwater canyon simulation environment and builds a deep reinforcement learning simulation platform on a high-performance computer to conduct simulation learning training for AUV. Data simulation verified that the proposed path planning method can guide the under-actuated underwater robot to navigate to the target without colliding with any obstacles. In comparison with the DDPG algorithm, the stability, training’s total reward, and robustness of the improved Sumtree-DDPG algorithm planner in this study are better.


2011 ◽  
Vol 142 ◽  
pp. 12-15
Author(s):  
Ping Feng

The paper puts forward the dynamic path planning algorithm based on improving chaos genetic algorithm by using genetic algorithms and chaos search algorithm. In the practice of navigation, the algorithm can compute at the best path to meet the needs of the navigation in such a short period of planning time. Furthermore,this algorithm can replan a optimum path of the rest paths after the traffic condition in the sudden.


Sign in / Sign up

Export Citation Format

Share Document