Optimal Usage of Robot Manipulators

Robot-based automation has gained increasing deployment in industry. Typical application examples of industrial robots are material handling, machine tending, arc welding, spot welding, cutting, painting, and gluing. A robot task normally consists of a sequence of the robot tool center point (TCP) movements. The time duration during which the sequence of the TCP movements is completed is referred to as cycle time. Minimizing cycle time implies increasing the productivity, improving machine utilization, and thus making automationaffordable in applications for which throughput and cost effectiveness is of major concern.Considering the high number of task runs within a specific time span, for instance one year, the importance of reducing cycle time in a small amount such as a few percent will be more understandable.Robot manipulators can be expected to achieve a variety of optimum objectives. While the cycle time optimization is among the areas which have probably received the most attention so far, the other application aspects such as energy efficiency, lifetime of the manipulator, and even the environment aspect have also gained increasing focus. Also, in recent era virtual product development technology has been inevitably and enormously deployed toward achieving optimal solutions. For example, off-line programming of robotic workcells has become a valuable means for work-cell designers to investigate the manipulator’s workspace to achieve optimality in cycle time, energy consumption and manipulator lifetime.This chapter is devoted to introduce new approaches for optimal usage of robots. Section 2 is dedicated to the approaches resulted from translational and rotational repositioning of a robot path in its workspace based on response surface method to achieve optimal cycle time.Section 3 covers another proposed approach that uses a multi-objective optimization methodology, in which the position of task and the settings of drive-train components of a robot manipulator are optimized simultaneously to understand the trade-off among cycletime, lifetime of critical drive-train components, and energy efficiency. In both section 2 and 3, results of different case studies comprising several industrial robots performing different tasks are presented to evaluate the developed methodologies and algorithms. The chapter is concluded with evaluation of the current results and an outlook on future research topics on optimal usage of robot manipulators

Minimum Jerk Trajectory Planning for Trajectory Constrained Redundant Robots

In this dissertation, we develop an efficient method of generating minimal jerk trajectories for redundant robots in trajectory following problems. We show that high jerk is a local phenomenon, and therefore focus on optimizing regions of high jerk that occur when using traditional trajectory generation methods. The optimal trajectory is shown to be located on the foliation of self-motion manifolds, and this property is exploited to express the problem as a minimal dimension Bolza optimal control problem. A numerical algorithm based on ideas from pseudo-spectral optimization methods is proposed and applied to two example planar robot structures with two redundant degrees of freedom. When compared with existing trajectory generation methods, the proposed algorithm reduces the integral jerk of the examples by 75% and 13%. Peak jerk is reduced by 98% and 33%. Finally a real time controller is proposed to accurately track the planned trajectory given real-time measurements of the tool-tip\u27s following error

Obstacle Avoidance and Tracking Control of Redundant Robotic Manipulator: An RNN-Based Metaheuristic Approach

This paper presents a metaheuristic-based control framework, called Beetle Antennae Olfactory Recurrent Neural Network (BAORNN), for simultaneous tracking control and obstacle avoidance of a redundant manipulator. The ability to avoid obstacles while tracking a predefined reference path is critical for any industrial manipulator. The formulated control framework unifies the tracking control and obstacle avoidance into a single constrained optimization problem by introducing a penalty term into the objective function, which actively rewards the optimizer for avoiding the obstacles. One of the significant features of the proposed framework is the way that the penalty term is formulated following a straightforward principle: maximize the minimum distance between manipulator and obstacle. The distance calculations are based on GJK (Gilbert-Johnson-Keerthi) algorithm, which calculates the distance between manipulator and obstacle by directly using their 3D-geometries. Which also implies that our algorithm works for arbitrarily shaped manipulator and obstacle. Theoretical treatment proves the stability and convergence, and simulations results using LBR IIWA 7-DOF manipulator are presented to analyze the performance of the proposed framework

Intelligent robust control of redundant smart robotic arm Pt I: Soft computing KB optimizer - deep machine learning IT

Redundant robotic arm models as a control object discussed. Background of computational intelligence IT based on soft computing optimizer of knowledge base in smart robotic manipulators introduced. Soft computing optimizer is the toolkit of deep machine learning SW platform with optimal fuzzy neural network structure. The methods for development and design technology of intelligent control systems based on the soft computing optimizer presented in this Part 1 allow one to implement the principle of design an optimal intelligent control systems with a maximum reliability and controllability level of a complex control object under conditions of uncertainty in the source data, and in the presence of stochastic noises of various physical and statistical characters. The knowledge bases formed with the application of a soft computing optimizer produce robust control laws for the schedule of time dependent coefficient gains of conventional PID controllers for a wide range of external perturbations and are maximally insensitive to random variations of the structure of control object. The robustness of control laws is achieved by application a vector fitness function for genetic algorithm, whose one component describes the physical principle of minimum production of generalized entropy both in the control object and the control system, and the other components describe conventional control objective functionals such as minimum control error, etc. The application of soft computing technologies (Part I) for the development a robust intelligent control system that solving the problem of precision positioning redundant (3DOF and 7 DOF) manipulators considered. Application of quantum soft computing in robust intelligent control of smart manipulators in Part II described

Learning Image-Conditioned Dynamics Models for Control of Under-actuated Legged Millirobots

Millirobots are a promising robotic platform for many applications due to their small size and low manufacturing costs. Legged millirobots, in particular, can provide increased mobility in complex environments and improved scaling of obstacles. However, controlling these small, highly dynamic, and underactuated legged systems is difficult. Hand-engineered controllers can sometimes control these legged millirobots, but they have difficulties with dynamic maneuvers and complex terrains. We present an approach for controlling a real-world legged millirobot that is based on learned neural network models. Using less than 17 minutes of data, our method can learn a predictive model of the robot's dynamics that can enable effective gaits to be synthesized on the fly for following user-specified waypoints on a given terrain. Furthermore, by leveraging expressive, high-capacity neural network models, our approach allows for these predictions to be directly conditioned on camera images, endowing the robot with the ability to predict how different terrains might affect its dynamics. This enables sample-efficient and effective learning for locomotion of a dynamic legged millirobot on various terrains, including gravel, turf, carpet, and styrofoam. Experiment videos can be found at https://sites.google.com/view/imageconddy

Dual Design PID Controller for Robotic Manipulator Application

This research introduces a dual design proportional–integral–derivative (PID) controller architecture process that aims to improve system performance by reducing overshoot and conserving electrical energy. The dual design PID controller uses real-time error and one-time step delay to adjust the confidence weights of the controller, leading to improved performance in reducing overshoot and saving electrical energy. To evaluate the effectiveness of the dual design PID controller, experiments were conducted to compare it with the PID controller using least overshoot tuning by Chien–Hrones–Reswick (CHR)  technique. The results showed that the dual design PID controller was more effective at reducing overshoot and saving electrical energy. A case study was also conducted as part of this research, and it demonstrated that the system performed better when using the dual design PID controller. Overshoot and electrical energy consumption are common issues in systems that can impact performance, and the dual design PID controller architecture process provides a solution to these issues by reducing overshoot and saving electrical energy. The dual design PID controller offers a new technique for addressing these issues and improving system performance. In summary, this research presents a new technique for addressing overshoot and electrical energy consumption in systems through the use of a dual design PID controller. The dual design PID controller architecture process was found to be an effective solution for reducing overshoot and saving electrical energy in systems, as demonstrated by the experiments and case study conducted as part of this research. The dual design PID controller presents a promising solution for improving system performance by addressing the issues of overshoot and electrical energy consumption

Trajectory planning for industrial robot using genetic algorithms

En las últimas décadas, debido la importancia de sus aplicaciones, se han propuesto muchas investigaciones sobre la planificación de caminos y trayectorias para los manipuladores, algunos de los ámbitos en los que pueden encontrarse ejemplos de aplicación son; la robótica industrial, sistemas autónomos, creación de prototipos virtuales y diseño de fármacos asistido por ordenador. Por otro lado, los algoritmos evolutivos se han aplicado en muchos campos, lo que motiva el interés del autor por investigar sobre su aplicación a la planificación de caminos y trayectorias en robots industriales. En este trabajo se ha llevado a cabo una búsqueda exhaustiva de la literatura existente relacionada con la tesis, que ha servido para crear una completa base de datos utilizada para realizar un examen detallado de la evolución histórica desde sus orígenes al estado actual de la técnica y las últimas tendencias. Esta tesis presenta una nueva metodología que utiliza algoritmos genéticos para desarrollar y evaluar técnicas para la planificación de caminos y trayectorias. El conocimiento de problemas específicos y el conocimiento heurístico se incorporan a la codificación, la evaluación y los operadores genéticos del algoritmo. Esta metodología introduce nuevos enfoques con el objetivo de resolver el problema de la planificación de caminos y la planificación de trayectorias para sistemas robóticos industriales que operan en entornos 3D con obstáculos estáticos, y que ha llevado a la creación de dos algoritmos (de alguna manera similares, con algunas variaciones), que son capaces de resolver los problemas de planificación mencionados. El modelado de los obstáculos se ha realizado mediante el uso de combinaciones de objetos geométricos simples (esferas, cilindros, y los planos), de modo que se obtiene un algoritmo eficiente para la prevención de colisiones. El algoritmo de planificación de caminos se basa en técnicas de optimización globales, usando algoritmos genéticos para minimizar una función objetivo considerando restricciones para evitar las colisiones con los obstáculos. El camino está compuesto de configuraciones adyacentes obtenidas mediante una técnica de optimización construida con algoritmos genéticos, buscando minimizar una función multiobjetivo donde intervienen la distancia entre los puntos significativos de las dos configuraciones adyacentes, así como la distancia desde los puntos de la configuración actual a la final. El planteamiento del problema mediante algoritmos genéticos requiere de una modelización acorde al procedimiento, definiendo los individuos y operadores capaces de proporcionar soluciones eficientes para el problema.Abu-Dakka, FJM. (2011). Trajectory planning for industrial robot using genetic algorithms [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/10294Palanci