Path Planning of Free Floating Prismatic-Jointed Manipulators

Reaching a desired position with a specific orientationin space by a robot, mounted on a freely floating base, is an importantpath planning and control problem. Research in this area has mainlyconcentrated on the use of revolute-jointed serial manipulators. It iswell known that the dynamic equations of such manipulators are quitecomplex.In this paper, we propose the use of a 6-link fully prismatic-jointedrobot to achieve a desired position and orientation in space instead of arevolute-jointed robot. The use of pure prismatic-jointed robots forsuch a purpose is counter intuitive. On earth, such a structure is unableto provide a desired orientation to the end-effector. However, it can beshown that in space, arbitrary end-effector orientations are possible.Due to the relative simplicity of kinematics, dynamics and workspace ofprismatic-jointed robots compared to revolute-jointed robots, their useresults in significant computational advantages in path planning andcontrol.Also, in this paper, we adopt an unconventional motion planning methodthat avoids inversion of the Jacobian matrix and results in singularityfree paths for the end-effector. In this method, the joint trajectoriesare considered to be modal sums of basis functions of time. Within this framework, constraints on jointangles and joint rates can be imposed. The results are demonstratedwith an example of a 6-link fully prismatic-jointed robot.     

Study on Non-holonomic Cartesian Path Planning of a Free-Floating Space Robotic System

The non-holonomic characteristic of a free-floating space robotic system is used to plan the path of the manipulator joints, by whose motion the base attitude and the inertial pose (the position and orientation with respect to the inertial frame) of the end-effector attain the desired values. First, the kinematic equations of a free-floating space robot are simplified and the system state variables are transformed to another form composed of base attitude and joint angles. Then, the joint trajectories are parameterized using sinusoidal functions, whose arguments are seven-order polynomials. Third, the planning problem is transformed to an optimization problem; the cost function, defined according to the accuracy requirements of system variables, is the function of the parameters to be determined. Finally, the Particle Swarm Optimization (PSO) algorithm is used to search the solutions of the parameters that determine the joint trajectories. The presented method meets three typical applications: (i) point-to-point maneuver of the end-effector without changing the base attitude, (ii) attitude maneuver of the base without changing the end-effector's pose and (iii) point-to-point maneuver of the end-effector with adjusting the base attitude synchronously. The simulation results of a spacecraft with a 6-d.o.f. manipulator verify the performance and the validity of the proposed method.     

Adaptive hybrid force-position control for redundant manipulators

An adaptive control scheme for manipulators with redundant degrees of freedom is presented. The control purpose is to achieve a desired interaction force between the end-effector and the environment as well as to regulate the robot tip position in the Cartesian space. This control approach does not require measurement of the joint acceleration or the force derivative     

Cartesian path generation of robot manipulators using continuous genetic algorithms

In this paper, the authors describe a novel technique based on continuous genetic algorithms (CGAs) to solve the path generation problem for robot manipulators. We consider the following scenario: given the desired Cartesian path of the end-effector of the manipulator in a free-of-obstacles workspace, off-line smooth geometric paths in the joint space of the manipulator are obtained. The inverse kinematics problem is formulated as an optimization problem based on the concept of the minimization of the accumulative path deviation and is then solved using CGAs where smooth curves are used for representing the required geometric paths in the joint space through out the evolution process. In general, CGA uses smooth operators and avoids sharp jumps in the parameter values. This novel approach possesses several distinct advantages: first, it can be applied to any general serial manipulator with positional degrees of freedom that might not have any derived closed-form solution for its inverse kinematics. Second, to the authors’ knowledge, it is the first singularity-free path generation algorithm that can be applied at the path update rate of the manipulator. Third, extremely high accuracy can be achieved along the generated path almost similar to analytical solutions, if available. Fourth, the proposed approach can be adopted to any general serial manipulator including both nonredundant and redundant systems. Fifth, when applied on parallel computers, the real time implementation is possible due to the implicit parallel nature of genetic algorithms. The generality and efficiency of the proposed algorithm are demonstrated through simulations that include 2R and 3R planar manipulators, PUMA manipulator, and a general 6R serial manipulator.     

Calculation of repeatable control strategies for kinematically redundant manipulators

A kinematically redundant manipulator is a robotic system that has more than the minimum number of degrees of freedom that are required for a specified task. Due to this additional freedom, control strategies may yield solutions which are not repeatable in the sense that the manipulator may not return to its initial joint configuration for closed end-effector paths. This paper compares two methods for choosing repeatable control strategies which minimize their distance from a nonrepeatable inverse with desirable properties. The first method minimizes the integral norm of the difference of the desired inverse and a repeatable inverse while the second method minimizes the distance of the null vectors associated with the desired and the repeatable inverses. It is then shown how the two techniques can be combined in order to obtain the advantages of both methods. As an illustrative example the pseudoinverse is approximated in a region of the joint space for a seven-degree-of-freedom manipulator.     

Fuzzy-GA-based trajectory planner for robot manipulators sharing a common workspace

This paper presents a novel fuzzy genetic algorithm (GA) approach to tackling the problem of trajectory planning of two collaborative robot manipulators sharing a common workspace, where the manipulators have to consider each other as a moving obstacle whose trajectory or behaviour is unknown and unpredictable, as each manipulator has individual goals and where both have the same priority. The goals are not restricted to a given set of joint values, but are specified in the workspace as coordinates at which it is desired to place the end-effector of the manipulator. By not constraining the goal to the joint space, the number of possible solutions that satisfies the goal increases according to the number of degrees of freedom of the manipulators. A simple GA planner is used to produce an initial estimation of the movements of the robots' articulations and collision free motion is obtained by the corrective action of the collision-avoidance fuzzy units.     

Motion Planning for Redundant Manipulators Using a Floating Point Genetic Algorithm

This paper deals with the trajectory planning problem for redundant manipulators. A genetic algorithm (GA) using a floating point representation is proposed to search for the optimal end-effector trajectory for a redundant manipulator. An evaluation function is defined based on multiple criteria, including the total displacement of the end-effector, the total angular displacement of all the joints, as well as the uniformity of Cartesian and joint space velocities. These criteria result in minimized, smooth end-effector motions. Simulations are carried out for path planning in free space and in a workspace with obstacles. Results demonstrate the effectiveness and capability of the proposed method in generating optimized collision-free trajectories.     

A direct algorithm for continuous path control of manipulators

This paper presents an algorithm for positioning and orientation of the hand for a redundant or non-redundant manipulator along a continuous path in space. This algorithm minimizes the distance between the actual position of the tip of the end-effector and the desired path. The algorithm does not use the Jacobian matrix for the inverse kinematics of the robot. It takes full advantage of the resolution of the joint drives, avoids singularity problems, and can be used for both redundant manipulators. The algorithm can be used in any situation where continuus motion of the end-effector is required in an open loop mode.     

基于解析法和遗传算法的机械手运动学逆解

研究优化机械手轨迹规划问题,机械手运动时要具有稳定性避障性能。针对平面3自由度冗余机械手优化控制问题,建立机械手的结构模型。提出用解析法和遗传算法相结合满足具有计算量小和适应性强的特点。在给定机械手末端执行器的运动轨迹,按着机械手冗余自由度,运动轨迹上每个点对应的关节角有无穷多个解。而通过算法可以找到一组最优的关节角,可得到优化机械手运动过程中柔顺性和避障点。仿真结果表明,该算法可以快速收敛到全局最优解,可用于计算冗余机械手运动学逆解,并可实现机器人的轨迹规划和避障优化控制。     

Disturbance rejection for space‐based manipulators

Most industrial manipulators operate from a fixed base. Hence, there are no disturbances from the environment to alter the position of the end‐effector. On the other hand, manipulators that are mounted on mobile platforms are subject to disturbances emerging from unwanted motion at the base. Similarly, manipulators that perform delicate operations in space while on board in‐orbit spacecraft experience disturbances. This article describes the design and implementation of a disturbance rejection controller for a 6 degree‐of‐freedom (DOF) programable universal manipulator for assembly (PUMA) manipulator mounted on a 3‐DOF platform. A control algorithm is designed to track the desired position and attitude of the end‐effector in inertial space, subject to unknown disturbances in the platform axes. Experimental results are presented for step, sinusoidal, and random disturbances in the platform rotational axis and in the neighborhood of kinematic singularities. ©1999 John Wiley & Sons, Inc.     

自由漂浮空间机器人的笛卡尔连续路径规划

对于自由漂浮空间机器人,位置级逆运动学方程不适合于笛卡尔连续路径的规划,而且机械臂的运动会对基座产生扰动.为此提出了基于速度级逆运动学方程的方法,可实现5个目标:1)惯性空间连续位姿跟踪;2)基座姿态无扰动的连续位置跟踪;3)基座姿态无扰动的连续姿态跟踪;4)基座姿态调整的连续位置跟踪;5)基座姿态调整的连续姿态跟踪.采用阻尼最小方差法回避动力学奇异,所规划的路径连续平滑.仿真结果表明了该方法的有效性.     

双臂空间机器人的避自碰轨迹规划研究*

本文针对自由漂浮的双臂空间机器人系统研究了一种基于危险域的避自碰轨迹规划方案。首先,引入危险域的概念,用来评估两个机械臂之间发生碰撞的危险程度。其次,在路径规划的基础之上,利用危险域的反馈信息,设计了一种安全避自碰的轨迹规划方案,用以保证两个机械臂可以运动在安全位型,从而避免发生自碰。最后,针对一个双臂冗余空间机器人系统进行运动仿真,仿真结果验证了本文方法的有效性。     

Singularity robust path planning for real time base attitude adjustment of free-floating space robot

This paper presents a singularity robust path planning for space manipulator to achieve base (satellite) attitude adjustment and end-effector task. The base attitude adjustment by the movement of manipulator will save propellant compared with conventional attitude control system. A task-priority reaction null-space control method is applied to achieve the primary task of adjusting attitude and secondary task of accomplishing end-effector task. Furthermore, the algorithm singularity is eliminated in the proposed algorithm compared with conventional reaction null-space algorithm. And the singular value filtering decomposition is introduced to dispose the dynamic singularity, the unit quaternion is also introduced to overcome representation singularity. Hence, a singularity robust path planning algorithm of space robot for base attitude adjustment is derived. A real time simulation system of the space robot under Linux/RTAI (realtime application interface) is developed to verify and test the feasibility and reliability of the method. The experimental results demonstrate the feasibility of online base attitude adjustment of space robot by the proposed algorithm.     

Planning multiple paths with evolutionary speciation

This paper demonstrates a new approach to multidimensional path planning that is based on multiresolution path representation, where explicit configuration space computation is not required, and incorporates an evolutionary algorithm for solving the multimodal optimization problem, generating multiple alternative paths simultaneously. The multiresolution path representation reduces the expected search length for the path-planning problem and accordingly reduces the overall computational complexity. Resolution independent constraints due to obstacle proximity and path length are introduced into the evaluation function. The system can be applied for planning paths for mobile robots, assembly, and articulated manipulators. The resulting path-planning system has been evaluated on problems of two, three, four, and six degrees of freedom. The resulting paths are practical, consistent, and have acceptable execution times. The multipath algorithm is demonstrated on a number of 2D path-planning problems     

Adaptive control of free-floating space robots in Cartesian coordinates

An adaptive control scheme is proposed for the end-effector trajectory tracking control of free-floating space robots. In order to cope with the nonlinear parameterization problem of the dynamic model of the free-floating space robot system, the system is modeled as an extended robot which is composed of a pseudo-arm representing the base motions and a real robot arm. An on-line estimation of the unknown parameters along with a computed-torque controller is used to track the desired trajectory. The proposed control scheme does not require measurement of the accelerations of the base and the real robot arm. A two-link planar space robot system is simulated to illustrate the validity and effectiveness of the proposed control scheme.     

A novel AR-based robot programming and path planning methodology

This paper discusses the benefits of applying Augmented Reality (AR) to facilitate intuitive robot programming, and presents a novel methodology for planning collision-free paths for an n degree-of-freedom (DOF) manipulator in an unknown environment. The targeted applications are where the end-effector is constrained to move along a visible 3D path/curve, which position is unknown, at a particular orientation with respect to the path, such as arc welding and laser cutting. The methodology is interactive as the human is involved in obtaining the 3D data points of the desired curve to be followed through performing a number of demonstrations, defining the free space relevant to the task, and planning the orientations of the end-effector along the curve. A Piecewise Linear Parameterization (PLP) algorithm is used to parameterize the data points using an interactively generated piecewise linear approximation of the desired curve. A curve learning method based on Bayesian neural networks and reparameterization is used to learn and generate 3D parametric curves from the parameterized data points. Finally, the orientation of the end-effector along the learnt curve is planned with the aid of AR. Two case studies are presented and discussed.     

Passivity based adaptive Jacobian tracking for free-floating space manipulators without using spacecraft acceleration

Most research so far on trajectory tracking of free-floating space manipulators has assumed that the kinematics of the space manipulator is exactly known. However, when a space manipulator picks up different tools of unknown lengths or unknown gripping points, its kinematics and dynamics change and are difficult to derive exactly. Thus, in this paper, we have proposed a passivity based adaptive Jacobian controller for free-floating space manipulators. The proposed controller consists of a transposed Jacobian feedback and a dynamic compensation term, and the parameter adaptation laws are derived by Lyapunov-like stability analysis tools. It is shown that the end-effector motion tracking errors converge asymptotically. To avoid using spacecraft acceleration, we define a new reference velocity, which is called spacecraft reference velocity. In addition, we have also conducted passivity interpretation of the proposed controller to obtain some physical insight into its properties. Simulation results are presented to show the performance of the proposed controller.     

Reaction torque control of redundant free-floating space robot

This paper presents the reaction torque based satellite base reactionless control or base disturbance minimization of a redundant free-floating space robot. This subject is of vital importance in the study of the free-floating space robot because the base disturbance minimization will result in less energy consumption and prolonged control application. The analytical formulation of the reaction torque is derived in this article, and the reaction torque control can achieve reactionless control and satellite base disturbance minimization. Furthermore, we derive the reaction torque based control of the space robot for base disturbance minimization from both the non-strict task priority and strict task priority control strategy. The dynamics singularity in the proposed algorithm is avoided in this paper. Besides, a real time simulation system of the space robot under Linux/real time application interface (RTAI) is developed to verify and test the feasibility and reliability of the method. The experimental results demonstrate the feasibility of online reaction torque control of the redundant free-floating space robot.     

A Neural Network Adaptive Controller for End-effector Tracking of Redundant Robot Manipulators

In this paper we propose a neural network adaptive controller to achieve end-effector tracking of redundant robot manipulators. The controller is designed in Cartesian space to overcome the problem of motion planning which is closely related to the inverse kinematics problem. The unknown model of the system is approximated by a decomposed structure neural network. Each neural network approximates a separate element of the dynamical model. These approximations are used to derive an adaptive stable control law. The parameter adaptation algorithm is derived from the stability study of the closed loop system using Lyapunov approach with intrinsic properties of robot manipulators. Two control strategies are considered. First, the aim of the controller is to achieve good tracking of the end-effector regardless the robot configurations. Second, the controller is improved using augmented space strategy to ensure minimum displacements of the joint positions of the robot. Simulation examples are also presented to verify the effectiveness of the proposed approach.     

A search algorithm for motion planning with six degrees of freedom

The motion planning problem is of central importance to the fields of robotics, spatial planning, and automated design. In robotics we are interested in the automatic synthesis of robot motions, given high-level specifications of tasks and geometric models of the robot and obstacles. The “Movers'” problem is to find a continuous, collision-free path for a moving object through an environment containing obstacles. We present an implemented algorithm for the classical formulation of the three-dimensional Movers' problem: Given an arbitrary rigid polyhedral moving object P with three translational and three rotational degrees of freedom, find a continuous, collision-free path taking P from some initial configuration to a desired goal configuration.This paper describes an implementation of a complete algorithm (at a given resolution) for the full six degree of freedom Movers' problem. The algorithm transforms the six degree of freedom planning problem into a point navigation problem in a six-dimensional configuration space (called C-space). The C-space obstacles, which characterize the physically unachievable configurations, are directly represented by six-dimensional manifolds whose boundaries are five-dimensional C-surfaces. By characterizing these surfaces and their intersections, collision-free paths may be found by the closure of three operators which (i) slide along five-dimensional level C-surfaces parallel to C-space obstacles; (ii) slide along one- to four-dimensional intersections of level C-surfaces; and (iii) jump between six-dimensional obstacles. These operators are employed by a best-first search algorithm in C-space. We will discuss theoretical properties of the algorithm, including completeness (at a resolution). This paper describes the heuristic search, with particular emphasis on the heuristic strategies that evaluate local geometric information. At the heart of this paper lie the design and implementation of these strategies for planning paths along level C-surfaces and their intersection manifolds, and for reasoning about motions with three degrees of rotational freedom. The problems of controlling the interaction of these strategies, and of integrating diverse local experts for geometric reasoning provide an interesting application of search to a difficult domain with significant practical implications. The representations and algorithms we develop impact many geometric planning problems, and extend to Cartesian manipulators with six degrees of freedom.