Trajectory generation of space telerobots

The purpose is to review a variety of trajectory generation techniques which may be applied to space telerobots and to identify problems which need to be addressed in future telerobot motion control systems. As a starting point for the development of motion generation systems for space telerobots, the operation and limitations of traditional path-oriented trajectory generation approaches are discussed. This discussion leads to a description of more advanced techniques which have been demonstrated in research laboratories, and their potential applicability to space telerobots. Examples of this work include systems that incorporate sensory-interactive motion capability and optimal motion planning. Additional considerations which need to be addressed for motion control of a space telerobot are described, such as redundancy resolution and the description and generation of constrained and multi-armed cooperative motions. A task decomposition module for a hierarchical telerobot control system which will serve as a testbed for trajectory generation approaches which address these issues is also discussed briefly

Fast Manipulability Maximization Using Continuous-Time Trajectory Optimization

A significant challenge in manipulation motion planning is to ensure agility in the face of unpredictable changes during task execution. This requires the identification and possible modification of suitable joint-space trajectories, since the joint velocities required to achieve a specific endeffector motion vary with manipulator configuration. For a given manipulator configuration, the joint space-to-task space velocity mapping is characterized by a quantity known as the manipulability index. In contrast to previous control-based approaches, we examine the maximization of manipulability during planning as a way of achieving adaptable and safe joint space-to-task space motion mappings in various scenarios. By representing the manipulator trajectory as a continuous-time Gaussian process (GP), we are able to leverage recent advances in trajectory optimization to maximize the manipulability index during trajectory generation. Moreover, the sparsity of our chosen representation reduces the typically large computational cost associated with maximizing manipulability when additional constraints exist. Results from simulation studies and experiments with a real manipulator demonstrate increases in manipulability, while maintaining smooth trajectories with more dexterous (and therefore more agile) arm configurations.Comment: In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS'19), Macau, China, Nov. 4-8, 201

A randomized kinodynamic planner for closed-chain robotic systems

Kinodynamic RRT planners are effective tools for finding feasible trajectories in many classes of robotic systems. However, they are hard to apply to systems with closed-kinematic chains, like parallel robots, cooperating arms manipulating an object, or legged robots keeping their feet in contact with the environ- ment. The state space of such systems is an implicitly-defined manifold, which complicates the design of the sampling and steering procedures, and leads to trajectories that drift away from the manifold when standard integration methods are used. To address these issues, this report presents a kinodynamic RRT planner that constructs an atlas of the state space incrementally, and uses this atlas to both generate ran- dom states, and to dynamically steer the system towards such states. The steering method is based on computing linear quadratic regulators from the atlas charts, which greatly increases the planner efficiency in comparison to the standard method that simulates random actions. The atlas also allows the integration of the equations of motion as a differential equation on the state space manifold, which eliminates any drift from such manifold and thus results in accurate trajectories. To the best of our knowledge, this is the first kinodynamic planner that explicitly takes closed kinematic chains into account. We illustrate the performance of the approach in significantly complex tasks, including planar and spatial robots that have to lift or throw a load at a given velocity using torque-limited actuators.Peer ReviewedPreprin

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