Faster Motion on Cartesian Paths Exploiting Robot Redundancy at the Acceleration Level

The problem of minimizing the transfer time along a given Cartesian path for redundant robots can be approached in two steps, by separating the generation of a joint path associated to the Cartesian path from the exact minimization of motion time under kinematic/dynamic bounds along the obtained parameterized joint path. In this framework, multiple suboptimal solutions can be found, depending on how redundancy is locally resolved in the joint space within the first step. We propose a solution method that works at the acceleration level, by using weighted pseudoinversion, optimizing an inertia-related criterion, and including null-space damping. Several numerical results obtained on different robot systems demonstrate consistently good behaviors and definitely faster motion times in comparison with related methods proposed in the literature. The motion time obtained with our method is reasonably close to the global time-optimal solution along same Cartesian path. Experimental results on a KUKA LWR IV are also reported, showing the tracking control performance on the executed motions

Minimum-time path planning for robot manipulators using path parameter optimization with external force and frictions

This paper presents a new minimum-time trajectory planning method which consists of a desired path in the Cartesian space to a manipulator under external forces subject to the input voltage of the actuators. Firstly, the path is parametrized with an unknown parameter called a path parameter. This parameter is considered a function of time and an unknown parameter vector for optimization. Secondly, the optimization problem is converted into a regular parameter optimization problem, subject to the equations of motion and limitations in angular velocity, angular acceleration, angular jerk, input torques of actuators’, input voltage and final time, respectively. In the presented algorithm, the final time of the task is divided into known partitions, and the final time is an additional unknown variable in the optimization problem. The algorithm attempts to minimize the final time by optimizing the path parameter, thus it is parametrized as a polynomial of time with some unknown parameters. The algorithm can have a smooth input voltage in an allowable range; then all motion parameters and the jerk will remain smooth. Finally, the simulation study shows that the presented approach is efficient in the trajectory planning for a manipulator that wants to follow a Cartesian path. In simulations, the constraints are respected, and all motion variables and path parameters remain smooth

Safe Robotic Grasping: Minimum Impact-Force Grasp Selection

This paper addresses the problem of selecting from a choice of possible grasps, so that impact forces will be minimised if a collision occurs while the robot is moving the grasped object along a post-grasp trajectory. Such considerations are important for safety in human-robot interaction, where even a certified "human-safe" (e.g. compliant) arm may become hazardous once it grasps and begins moving an object, which may have significant mass, sharp edges or other dangers. Additionally, minimising collision forces is critical to preserving the longevity of robots which operate in uncertain and hazardous environments, e.g. robots deployed for nuclear decommissioning, where removing a damaged robot from a contaminated zone for repairs may be extremely difficult and costly. Also, unwanted collisions between a robot and critical infrastructure (e.g. pipework) in such high-consequence environments can be disastrous. In this paper, we investigate how the safety of the post-grasp motion can be considered during the pre-grasp approach phase, so that the selected grasp is optimal in terms applying minimum impact forces if a collision occurs during a desired post-grasp manipulation. We build on the methods of augmented robot-object dynamics models and "effective mass" and propose a method for combining these concepts with modern grasp and trajectory planners, to enable the robot to achieve a grasp which maximises the safety of the post-grasp trajectory, by minimising potential collision forces. We demonstrate the effectiveness of our approach through several experiments with both simulated and real robots.Comment: To be appeared in IEEE/RAS IROS 201

Singularity Avoidance with Application to Online Trajectory Optimization for Serial Manipulators

This work proposes a novel singularity avoidance approach for real-time trajectory optimization based on known singular configurations. The focus of this work lies on analyzing kinematically singular configurations for three robots with different kinematic structures, i.e., the Comau Racer 7-1.4, the KUKA LBR iiwa R820, and the Franka Emika Panda, and exploiting these configurations in form of tailored potential functions for singularity avoidance. Monte Carlo simulations of the proposed method and the commonly used manipulability maximization approach are performed for comparison. The numerical results show that the average computing time can be reduced and shorter trajectories in both time and path length are obtained with the proposed approachComment: 8 pages, 2 figures, Accepted for publication at IFAC World Congress 202