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

Implementation of Nonlinear Model Predictive Path-Following Control for an Industrial Robot

Many robotic applications, such as milling, gluing, or high precision measurements, require the exact following of a pre-defined geometric path. In this paper, we investigate the real-time feasible implementation of model predictive path-following control for an industrial robot. We consider constrained output path following with and without reference speed assignment. We present results from an implementation of the proposed model predictive path-following controller on a KUKA LWR IV robot.Comment: 8 pages, 3 figures; final revised versio

A Certified-Complete Bimanual Manipulation Planner

Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid object. In this paper, we propose a manipulation planning algorithm to bring an object from an initial stable placement (position and orientation of the object on the support surface) towards a goal stable placement. The key specificity of our algorithm is that it is certified-complete: for a given object and a given environment, we provide a certificate that the algorithm will find a solution to any bimanual manipulation query in that environment whenever one exists. Moreover, the certificate is constructive: at run-time, it can be used to quickly find a solution to a given query. The algorithm is tested in software and hardware on a number of large pieces of furniture.Comment: 12 pages, 7 figures, 1 tabl

An Analysis Review: Optimal Trajectory for 6-DOF-based Intelligent Controller in Biomedical Application

With technological advancements and the development of robots have begun to be utilized in numerous sectors, including industrial, agricultural, and medical. Optimizing the path planning of robot manipulators is a fundamental aspect of robot research with promising future prospects. The precise robot manipulator tracks can enhance the efficacy of a variety of robot duties, such as workshop operations, crop harvesting, and medical procedures, among others. Trajectory planning for robot manipulators is one of the fundamental robot technologies, and manipulator trajectory accuracy can be enhanced by the design of their controllers. However, the majority of controllers devised up to this point were incapable of effectively resolving the nonlinearity and uncertainty issues of high-degree freedom manipulators in order to overcome these issues and enhance the track performance of high-degree freedom manipulators. Developing practical path-planning algorithms to efficiently complete robot functions in autonomous robotics is critical. In addition, designing a collision-free path in conjunction with the physical limitations of the robot is a very challenging challenge due to the complex environment surrounding the dynamics and kinetics of robots with different degrees of freedom (DoF) and/or multiple arms. The advantages and disadvantages of current robot motion planning methods, incompleteness, scalability, safety, stability, smoothness, accuracy, optimization, and efficiency are examined in this paper

Optimal redundancy control for robot manipulators

Optimal control for kinematically redundant robots is addressed for two different optimization problems. In the first optimization problem, we consider the minimization of the transfer time along a given Cartesian path for a redundant robot. This problem can be solved 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 parametrized joint path. In this thesis, multiple sub-optimal solutions can be found, depending on how redundancy is locally resolved in the joint space within the first step. A solution method that works at the acceleration level is proposed, by using weighted pseudoinversion, optimizing an inertia-related criterion, and including null-space damping. The obtained results demonstrate consistently good behaviors and definitely faster motion times in comparison with related methods proposed in the literature. The motion time obtained with the proposed method is close to the global time-optimal solution along the same Cartesian path. Furthermore, a reasonable tracking control performance is obtained on the experimental executed motions. In the second optimization problem, we consider the known phenomenon of torque oscillations and motion instabilities that occur in redundant robots during the execution of sufficiently long Cartesian trajectories when the joint torque is instantaneously minimized. In the framework of on-line local redundancy resolution methods, we propose basic variations of the minimum torque scheme to address this issue. Either the joint torque norm is minimized over two successive discrete-time samples using a short preview window, or we minimize the norm of the difference with respect to a desired momentum-damping joint torque, or the two schemes are combined together. The resulting local control methods are all formulated as well-posed linear-quadratic problems, and their closed-form solutions generate also low joint velocities while addressing the primary torque optimization objectives. Stable and consistent behaviors are obtained along short or long Cartesian position trajectories. For the two addressed optimization problems in this thesis, the results are obtained using three different robot systems, namely a 3R planar arm, a 6R Universal Robots UR10, and a 7R KUKA LWR robot

A Predictive Technique for the Real-Time Trajectory Scaling under High-Order Constraints

Modern robotic systems must be able to react to unexpected environmental events. To this purpose, planning techniques for the real-time generation/modification of trajectories have been developed in recent times. In the frequent case of applications which require following a predefined path, the assigned time-law must be inspected in real time so as to verify whether it satisfies the system constraints or, conversely, if it must be scaled in order to obtain a feasible trajectory. The problem has been addressed in several ways in the literature. One of the known approaches, based on the use of nonlinear filters, is revised in this paper in order to return feasible solutions under any circumstances. Differently from alternative strategies, it manages constraints up to the torque derivatives and has evaluation times compatible with the ones required by modern control systems. The proposed technique is validated through simulations and real experiments. Comparisons are proposed with an algorithm based on a model predictive technique and with an alternative scaling system

A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints

Off-line optimal planning of trajectories for redundant robots along prescribed task space paths is usually broken down into two consecutive processes: first, the task space path is inverted to obtain a joint-space path, then, the latter is parametrized with a time law. If the two processes are separated, they cannot optimize the same objective function, ultimately providing sub-optimal results. In this paper, a unified approach is presented where dynamic programming is the underlying optimization technique. Its flexibility allows accommodating arbitrary constraints and objective functions, thus providing a generic framework for optimal planning of real systems. To demonstrate its applicability to a real world scenario, the framework is instantiated for time-optimality. Compared to numerical solvers, the proposed methodology provides visibility of the underlying resolution process, allowing for further analyses beyond the computation of the optimal trajectory. The effectiveness of the framework is demonstrated on a real 7-degrees-of-freedom serial chain. The issues associated with the execution of optimal trajectories on a real controller are also discussed and addressed. The experiments show that the proposed framework is able to effectively exploit kinematic redundancy to optimize the performance index defined at planning level and generate feasible trajectories that can be executed on real hardware with satisfactory results