An explicit approach for time-optimal trajectory planning for kinematically redundant serial robots

Kinematically redundant serial robots have become industrially important due their increased workspace and their inherent capability of null space motion resulting in remarkable adaptiveness to specific tasks compared to conventional, non-redundant manipulators. Attempting to increase the cost-effectiveness of industrial processes, introducing minimum-time trajectories may yield economical advantages due to reduced motion cycle times. This contribution presents a method that uses joint space decomposition and analytic inverse kinematics as well as standard optimization techniques to obtain minimum-time B-spline joint trajectories along prescribed task space paths for kinematically redundant serial robots. It is shown that the present method was successfully applied to a planar manipulator. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Motion Planning for Multiple Robots

We study the motion-planning problem for pairs and triples of robots operating in a shared workspace containing n obstacles. A standard way to solve such problems is to view the collection of robots as one composite robot, whose number of degrees of freedom is d , the sum of the numbers of degrees of freedom of the individual robots. We show that it is sufficient to consider a constant number of robot systems whose number of degrees of freedom is at most d-1 for pairs of robots, and d-2 for triples. (The result for a pair assumes that the sum of the number of degrees of freedom of the robots constituting the pair reduces by at least one if the robots are required to stay in contact; for triples a similar assumption is made. Moreover, for triples we need to assume that a solution with positive clearance exists.) We use this to obtain an O(n ^d ) time algorithm to solve the motion-planning problem for a pair of robots; this is one order of magnitude faster than what the standard method would give. For a triple of robots the running time becomes O(n ^d-1 ) , which is two orders of magnitude faster than the standard method. We also apply our method to the case of a collection of bounded-reach robots moving in a low-density environment. Here the running time of our algorithm becomes O(n log n) both for pairs and triples. Received August 10, 1998, and in revised form February 17, 1999.     

Control concepts for a parallel manipulator with flexible links

Light-weight robots are advantageous considering the low energy consumption and the low material cost. However, in light-weight structures significant oscillations can occur which make the control very challenging. Objective of this research is end-effector trajectory tracking of a parallel manipulator with flexible links. Hereby, only the manipulator's drives are used, and no additional actuation on the flexible bodies is considered. For accurate trajectory tracking, feedforward control of the manipulator is used based on inverse dynamics and servo-constraints, combined with feedback control of the drive positions. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Computer-assisted generation of robot dynamic models in an analytical form

An algorithm for constructing dynamic models of single-arm robots is presented in this paper. Motion equations of robots in analytical form are derived applying a fully automated procedure. It is shown that the solution of a direct and/or inverse problem based on the analytical model requires considerably fewer floating-point multiplications/additions than is the case with previously-developed numerical methods. The developed method is therefore very suitable for real-time application of robot dynamic models. The developed program package is illustrated using the example of Stanford manipulator.     

Modelling Flexible Manipulators With Motors at the Joints

A computationally efficient recursive model of a flexible manipulator with motors at the joints is described in this paper. The model adopts a mixed Eulerian and Lagrangian formulation of the equations of a flexible body and exploits the chained structure of the equations for a serial manipulator. The dynamic effects of the motors at the joints, including gyroscopic terms, are fully taken into account. Symbolic manipulation is used in a newly developed package, whose performance in detailed reproduction of the dynamic effects due to the interplay between the motors and the flexible links is assessed through simulation. A comparison between the complete model and a simplified one, where the motors are considered as simple inertias rotating around their own axis, has been carried out, using both a time domain analysis and a frequency domain analysis, in order to show the relevance of gyroscopic effects in modelling flexible robots.     

Tracking control of high-performance robots via stabilizing controllers for uncertain systems

The development of flexible manufacturing systems calls for industrial robots characterized by robustness of performance with regard to the variations of the loads and real time specification of the trajectory in the work space. In this paper, the design of a feedback controller guaranteeing such performance is considered. At first, the manipulator dynamics are embedded into a larger class of uncertain dynamical systems and a class of feedback controls is proposed that guarantees uniform ultimate boundedness of the tracking error. Successively, the methodology is specialized for the case of robotic manipulators to track trajectories described in task-oriented coordinates; the proposed control algorithm operates without requiring any explicit coordinate transformation.     

Generating a reference trajectory with defined kinematics for the IRb-6 manipulator

The fundamental problem in industrial robots control concerns algorithms generating reference trajectories.References [1–4] suggest generating algorithms of a reference trajectory, which are based on an arbitrary discretization of the manipulator's internal coordinates. Each point of discretization in the external space approximating a reference trajectory corresponds to known discretized internal coordinates of the manipulator.In [5–7], iteration methods of determining the internal coordinates corresponding to external coordinates of the reference trajectory point have been suggested. In this method of internal coordinates, determining the point of the reference trajectory is being approached in successive steps of an iterative computation. In [5], a modified iterative method of generation of a straight segment reference trajectory has been presented.Analytic formulae, which are the solution of an inverse problem of manipulator kinematics, enable design of trajectory generating algorithms which compute, in one step only, the internal coordinates of points lying exactly on the reference trajectory, with the accuracy resulting from the computer register length.In this paper, the author has presented an original PLAN2 computer algorithm generating reference trajectories of motion for a task. The kinematics of those trajectories is defined at selected points through which a task is to be passed, the distances between them being optional. The algorithm is based on formulae which are analytic solutions to an inverse problem for an IRb-6 manipulator kinematics.     

An experimentally validated rod model for soft continuum robots

Soft robots are bio-inspired, highly deformable robots with the ability to interact with workpieces in a manner that complements their hard robot counterparts. To develop practical applications and reproducible designs of soft robots, new models are necessary to describe their kinematics and dynamics. In the present work, we describe experimental and numerical investigations of a popular pneumatically-actuated soft continuum arm. These works enable us to derive constitutive relations and develop a rod model for large deformations of the arm that faithfully describes its bending behavior. We show how the resulting non-classical constitutive relation can be defined either through experiments or through quasi-static finite element simulations. With the help of this relation, the resulting rod model can be used to study the dynamics of the soft robot arm in a fast and tractable manner. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A social approach for target localization: simulation and implementation in the marXbot robot

Foraging is a common benchmark problem in collective robotics in which a robot (the forager) explores a given environment while collecting items for further deposition at specific locations. A typical real-world application of foraging is garbage collection where robots collect garbage for further disposal in pre-defined locations. This work proposes a method to cooperatively perform the task of finding such locations: instead of using local or global localization strategies relying on pre-installed infrastructure, the proposed approach takes advantage of the knowledge gathered by a population about the localization of the targets. In our approach, robots communicate in an intrinsic way the estimation about how near they are from a target; these estimations are used by neighbour robots for estimating their proximity, and for guiding the navigation of the whole population when looking for these specific areas. We performed several tests in a simulator, and we validated our approach on a population of real robots. For the validation tests we used a mobile robot called marXbot. In both cases (i.e., simulation and implementation on real robots), we found that the proposed approach efficiently guides the robots towards the pre-specified targets while allowing the modulation of their speed.     

Kinematic and dynamic analysis of the Gantry-Tau,a 3-DoF translational parallel manipulator

This paper deals with the mathematical modeling of kinematics and dynamics of the 3-degrees-of-freedom Gantry-Tau manipulator. Compared to many other parallel robots, Gantry-Tau offers a large accessible workspace and high stiffness. The kinematics of Gantry-Tau is presented which includes inverse kinematics formulation for the position, velocity and acceleration of the mechanism. Also, based on the obtained Jacobin matrices, singular configurations of the robot are studied. Afterwards, the equations of the inverse dynamic model of the Gantry-Tau are obtained through two different methods, i.e., virtual work and Newton–Euler. Finally, a case study is performed to verify the correctness of the derived models and investigate their computational efficiency.     

Dynamical model for a plane manipulator with rotary kinematic couples and rigid links

A system of differential equations is obtained for an N-link plane manipulator with rotary kinematic couples. The problem of the optimal design of manipulators with hydraulically driven links is considered. The optimal parameters of the mechanism are computed for a specific example.Translated fromVychislitel'naya i Prikladnaya Matematika, No. 69, pp. 105–110, 1989.     

Modelling of closed-chain manipulators on an excavator vehicle

The main focus of this paper is to develop a physics-based model for a closed-chain manipulator in an excavator vehicle. The derivation of closed-chain manipulator dynamic equations with a structure similar to open-chain manipulator equations is an important research problem, particularly with reference to controller design. In this paper, an approach for deriving closed-chain manipulator equations with an open-chain structure, based on trigonometric t-formulae, is presented. Holonomic loop closure constraints are employed in order to derive the closed-chain mechanism dynamics from the reduced system dynamics. The closed-chain equations, with a structure similar to serial link equations, are presented. The model incorporates the dynamic properties of the manipulator and bucket. The dynamic model for the excavation system is validated against measured data obtained from a full-scale closed-chain excavator vehicle. A dynamic model is important for the design of control strategies for trajectory tracking, a key requirement for automating the excavation task. It is noted that even though the results presented in this paper are focused on a particular excavator vehicle, the research is generic and can be adapted to any closed-chain manipulator.     

An adaptive sliding mode backstepping control for the mobile manipulator with nonholonomic constraints

To solve disturbances, nonlinearity, nonholonomic constraints and dynamic coupling between the platform and its mounted robot manipulator, an adaptive sliding mode controller based on the backstepping method applied to the robust trajectory tracking of the wheeled mobile manipulator is described in this article. The control algorithm rests on adopting the backstepping method to improve the global ultimate asymptotic stability and applying the sliding mode control to obtain high response and invariability to uncertainties. According to the Lyapunov stability criterion, the wheeled mobile manipulator is divided into several stabilizing subsystems, and an adaptive law is designed to estimate the general nondeterminacy, which make the controller be capable to drive the trajectory tracking error of the mobile manipulator to converge to zero even in the presence of perturbations and mathematical model errors. We compare our controller with the robust neural network based algorithm in nonholonomic constraints and uncertainties, and simulation results prove the effectivity and feasibility of the proposed method in the trajectory tracking of the wheeled mobile manipulator.     

Dynamics and stability of a hybrid serial-parallel mobile robot

Kinematics, dynamics, and stability analysis of a hybrid serial-parallel wheeled mobile robot is detailed in this paper. Privileging the advantages of both serial and parallel robots, the suggested structure will provide higher stability for heavy object manipulation by a mobile robotic system. The proposed system is made of a differentially-driven wheeled platform, a planar parallel manipulator, which is called here as star-triangle (ST) mechanism, and a serial Puma-type manipulator arm. In order to develop a comprehensive kinematics model of the robot; first it is divided into three modules, i.e. a mobile platform, a parallel ST mechanism, and a serial robot. Next, a closed-form dynamics model is derived for the whole hybrid system based on a combined Newton–Euler and Lagrange formulation. Then, a careful validation procedure is presented to verify the obtained dynamics model. Finally, using the new postural stability metric named as moment-height stability (MHS), the important role of the parallel ST mechanism for stabilizing the mobile robotic system is demonstrated. The obtained results show that the proposed hybrid serial–parallel arrangement effectively enhances the tip-over stability of the overall mobile robotic system. Hence, it can be successfully exploited to prevent tip-over instability particularly during heavy object manipulation tasks.     

Efficient reconfiguration of lattice-based modular robots

Modular robots consist of many identical units (or atoms) that can attach together and perform local motions. By combining such motions, one can achieve a reconfiguration of the global shape of a robot. The term modular comes from the idea of grouping together a fixed number of atoms into a metamodule, which behaves as a larger individual component. Recently, a fair amount of research has focused on algorithms for universal reconfiguration using Crystalline and Telecube metamodules, which use expanding/contracting cubical atoms.From an algorithmic perspective, this work has achieved some of the best asymptotic reconfiguration times under a variety of different physical models. In this paper we show that these results extend to other types of modular robots, thus establishing improved upper bounds on their reconfiguration times. We describe a generic class of modular robots, and we prove that any robot meeting the generic class requirements can simulate the operation of a Crystalline atom by forming a six-arm structure. Previous reconfiguration bounds thus transfer automatically by substituting the six-arm structures for the Crystalline atoms. We also discuss four prototyped robots that satisfy the generic class requirements: M-TRAN, SuperBot, Molecube, and RoomBot.     

A simple model for clock-actuated legged locomotion

The spring-loaded inverted pendulum (SLIP) model describes well the steady-state center-of-mass motions of a diverse range of walking and running animals and robots. Here we ask whether the SLIP model can also explain the dynamic stability of these gaits, and we find that it cannot do so in many physically-relevant parameter ranges. We develop an actuated, lossy, clock-torqued SLIP, or CT-SLIP, with more realistic hip-motor torque inputs, that can capture the robust stability properties observed in most animals and some legged robots. Variations of CT-SLIP at a similar level of detail and complexity may also be appropriate for capturing the whole-system center-of-mass dynamics of locomotion of legged animals and robots varying widely in size and morphology. This paper contributes to a broader program to develop mathematical models, at varied levels of detail, that capture the dynamics of integrated organismal systems exhibiting integrated whole-body motion.      

Approximation Algorithms for Pick-and-Place Robots

In this paper we study the problem of finding placement tours for pick-and-place robots, also known as the printed circuit board assembly problem with m positions on a board, n bins containing m components and n locations for the bins. In the standard model where the working time of the robot is proportional to the distances travelled, the general problem appears as a combination of the travelling salesman problem and the matching problem, and for m=n we have an Euclidean, bipartite travelling salesman problem. We give a polynomial-time algorithm which achieves an approximation guarantee of 3+. An important special instance of the problem is the case of a fixed assignment of bins to bin-locations. This appears as a special case of a bipartite TSP satisfying the quadrangle inequality and given some fixed matching arcs. We obtain a 1.8 factor approximation with the stacker crane algorithm of Frederikson, Hecht and Kim. For the general bipartite case we also show a 2.0 factor approximation algorithm which is based on a new insertion technique for bipartite TSPs with quadrangle inequality. Implementations and experiments on real-world as well as random point configurations conclude this paper.     

Gossip algorithms for heterogeneous multi-vehicle routing problems

In this paper we address a class of heterogeneous multi-vehicle task assignment and routing problems. We propose two distributed algorithms based on gossip communication: the first algorithm is based on a local exact optimization and the second is based on a local approximate greedy heuristic. We consider the case where a set of heterogeneous tasks arbitrarily distributed in a plane has to be serviced by a set of mobile robots, each with a given movement speed and task execution speed. Our goal is to minimize the maximum execution time of robots.     

Generalized model for a force-sensing grip on a peg

Force sensing is an alternate to expensive vision systems for precision positioning of a manipulator. In some operations, such as peg-in-hole assembly and precision welding, the position of the end-effector of a manipulator is to be determined to an accuracy greater than that of the manipulator itself. This involves sensing and correcting the position of the manipulator in order to affect the manufacturing operation. A friction point configuration of a gripper has been selected. The effects of a non-coaxial disturbing force on this grip will be presented. A method of ascertaining the positional error (x, y and θ) between the peg and the hole based on the sensing at the gripping points will be described. The model is based on a rectangular peg and is extended to pegs of various cross sections.