Characterization of robotics parallel algorithms and mapping onto a reconfigurable SIMD machine

The kinematics, dynamics, Jacobian, and their corresponding inverse computations are six essential problems in the control of robot manipulators. Efficient parallel algorithms for these computations are discussed and analyzed. Their characteristics are identified and a scheme on the mapping of these algorithms to a reconfigurable parallel architecture is presented. Based on the characteristics including type of parallelism, degree of parallelism, uniformity of the operations, fundamental operations, data dependencies, and communication requirement, it is shown that most of the algorithms for robotic computations possess highly regular properties and some common structures, especially the linear recursive structure. Moreover, they are well-suited to be implemented on a single-instruction-stream multiple-data-stream (SIMD) computer with reconfigurable interconnection network. The model of a reconfigurable dual network SIMD machine with internal direct feedback is introduced. A systematic procedure internal direct feedback is introduced. A systematic procedure to map these computations to the proposed machine is presented. A new scheduling problem for SIMD machines is investigated and a heuristic algorithm, called neighborhood scheduling, that reorders the processing sequence of subtasks to reduce the communication time is described. Mapping results of a benchmark algorithm are illustrated and discussed

Kinematically optimal hyper-redundant manipulator configurations

“Hyper-redundant” robots have a very large or infinite degree of kinematic redundancy. This paper develops new methods for determining “optimal” hyper-redundant manipulator configurations based on a continuum formulation of kinematics. This formulation uses a backbone curve model to capture the robot's essential macroscopic geometric features. The calculus of variations is used to develop differential equations, whose solution is the optimal backbone curve shape. We show that this approach is computationally efficient on a single processor, and generates solutions in O(1) time for an N degree-of-freedom manipulator when implemented in parallel on O(N) processors. For this reason, it is better suited to hyper-redundant robots than other redundancy resolution methods. Furthermore, this approach is useful for many hyper-redundant mechanical morphologies which are not handled by known methods

Computational structures for robotic computations

The computational problem of inverse kinematics and inverse dynamics of robot manipulators by taking advantage of parallelism and pipelining architectures is discussed. For the computation of inverse kinematic position solution, a maximum pipelined CORDIC architecture has been designed based on a functional decomposition of the closed-form joint equations. For the inverse dynamics computation, an efficient p-fold parallel algorithm to overcome the recurrence problem of the Newton-Euler equations of motion to achieve the time lower bound of O(log sub 2 n) has also been developed

Computed torque control of a free-flying cooperat ing-arm robot

The unified approach to solving free-floating space robot manipulator end-point control problems is presented using a control formulation based on an extension of computed torque. Once the desired end-point accelerations have been specified, the kinematic equations are used with momentum conservation equations to solve for the joint accelerations in any of the robot's possible configurations: fixed base or free-flying with open/closed chain grasp. The joint accelerations can then be used to calculate the arm control torques and internal forces using a recursive order N algorithm. Initial experimental verification of these techniques has been performed using a laboratory model of a two-armed space robot. This fully autonomous spacecraft system experiences the drag-free, zero G characteristics of space in two dimensions through the use of an air cushion support system. Results of these initial experiments are included which validate the correctness of the proposed methodology. The further problem of control in the large where not only the manipulator tip positions but the entire system consisting of base and arms must be controlled is also presented. The availability of a physical testbed has brought a keener insight into the subtleties of the problem at hand

An algorithm for generation of efficient manipulator dynamic equations

This paper presents a method for the generation of efficient manipulator dynamic equations in symbolic form. The efficiency is obtained by the use of simplification rules during the process of equation generation. These simplifications are based on the structure of manipulator dynamics, on simplifications that arise from common manipulator geometries, and from other heuristic simplification rules. This algorithm has been implemented in a lisp-based program, EMDEG (Efficient Manipulator Dynamic Equation Generator). The development of the algorithm, the derivation of simplification rules, and some implementation aspects are discussed; and an example is presented

Motion Planning of Uncertain Ordinary Differential Equation Systems

This work presents a novel motion planning framework, rooted in nonlinear programming theory, that treats uncertain fully and under-actuated dynamical systems described by ordinary differential equations. Uncertainty in multibody dynamical systems comes from various sources, such as: system parameters, initial conditions, sensor and actuator noise, and external forcing. Treatment of uncertainty in design is of paramount practical importance because all real-life systems are affected by it, and poor robustness and suboptimal performance result if it’s not accounted for in a given design. In this work uncertainties are modeled using Generalized Polynomial Chaos and are solved quantitatively using a least-square collocation method. The computational efficiency of this approach enables the inclusion of uncertainty statistics in the nonlinear programming optimization process. As such, the proposed framework allows the user to pose, and answer, new design questions related to uncertain dynamical systems. Specifically, the new framework is explained in the context of forward, inverse, and hybrid dynamics formulations. The forward dynamics formulation, applicable to both fully and under-actuated systems, prescribes deterministic actuator inputs which yield uncertain state trajectories. The inverse dynamics formulation is the dual to the forward dynamic, and is only applicable to fully-actuated systems; deterministic state trajectories are prescribed and yield uncertain actuator inputs. The inverse dynamics formulation is more computationally efficient as it requires only algebraic evaluations and completely avoids numerical integration. Finally, the hybrid dynamics formulation is applicable to under-actuated systems where it leverages the benefits of inverse dynamics for actuated joints and forward dynamics for unactuated joints; it prescribes actuated state and unactuated input trajectories which yield uncertain unactuated states and actuated inputs. The benefits of the ability to quantify uncertainty when planning the motion of multibody dynamic systems are illustrated through several case-studies. The resulting designs determine optimal motion plans—subject to deterministic and statistical constraints—for all possible systems within the probability space

Kinematic and dynamic analyses of general robots by applying the C-B notation-RaMIP (Robot and Mechanism Integrated Program)

In this thesis, a new symbolic representation based on 4x4 homogeneous matrices, C-B (Cylindrical Coordinates - Bryant Angles) notation, has been applied to the kinematic and dynamic analyses of general robots, and a computer algorithm named RaMIP (Robot and Mechanism Integrated Program) has been developed on a Sun workstation for the design and analysis of robots and mechanisms. RaMIP can be used to model most industrial robots currently in use. It performs three-dimensional kinematic and dynamic analyses and takes advantage of the computational efficiency of C-B notation. The C-B notation allows the user to model an arbitrary mechanism consisting of any combination of revolute, prismatic and spherical joints. RaMIP has the capability of presenting results in the form of two- and three-dimensional plots of colored contours, as well as tables of numerical data. The algorithm is examined and tested by analyzing several commercial robots. Kinematic and dynamic results are computed and presented in two- and three-dimensional graphs and compared with known data to probe the validity and accuracy of RaMIP. It should be noticed that the efforts completed in this thesis present only the first step towards the implementation of a general purpose computer algorithm -RaMIP- for the automated design and analysis of open- and closed-chain mechanisms utilizing C-B notation

Computer algebra for solving dynamics problems of piezoelectric robots with large number of joints

The application of general control theory to complex mechanical systems represents an extremely difficult problem. If industrial piezoelectric robots have large number of joints, development of new control algorithms is unavoidable in order to achieve high positioning accuracy. The efficiency of computer algebra application was compared with the most popular methods of forming the dynamic equations of robots in real time. To this end, a computer algebra system VIBRAN was used. Expressions for the generalized inertia matrix of the robots have been derived by means of the computer algebra technique with the following automatic program code generation. As shown in the paper, such application could drastically reduce the number of floating point product operations that are required for efficient numerical simulation of piezoelectric robots

Modèles élastiques et élasto‐dynamiques de robots porteurs

The report presents an advanced stiffness modeling technique for parallel manipulators composed of perfect and non-perfect serial chains. The developed technique contributes both to the stiffness modeling of serial and parallel manipulators under internal and external loadings. Particular attention has been done to enhancement of VJM-based stiffness modeling technique for the case of auxiliary loading (applied to the intermediate points). The obtained results allows us to take into account gravity forces induced by the link weights which are assumed to be applied in the intermediate points. In contrast to other works, the developed technique is able to take into account deviation of the end-platform location because of inaccuracy in the geometry of serial chains, which does not allow to assemble manipulator without internal stresses. The developed aggregation procedure combines the chain stiffness models and produces the relevant force-deflection relation, the aggregated Cartesian stiffness matrix and the reference point displacements caused by inaccuracy in kinematic chains. The developed technique can be applied to both over-constrained and under-constrained manipulators, and is suitable for the cases of both small and large deflections.ANR COROUSS

Evaluation of automated decisionmaking methodologies and development of an integrated robotic system simulation

A generic computer simulation for manipulator systems (ROBSIM) was implemented and the specific technologies necessary to increase the role of automation in various missions were developed. The specific items developed are: (1) capability for definition of a manipulator system consisting of multiple arms, load objects, and an environment; (2) capability for kinematic analysis, requirements analysis, and response simulation of manipulator motion; (3) postprocessing options such as graphic replay of simulated motion and manipulator parameter plotting; (4) investigation and simulation of various control methods including manual force/torque and active compliances control; (5) evaluation and implementation of three obstacle avoidance methods; (6) video simulation and edge detection; and (7) software simulation validation