Hand-Gesture Based Programming of Industrial Robot Manipulators

Nowadays, industrial robot manipulators and manufacturing processes are associated as never before. Robot manipulators execute repetitive tasks with increased accuracy and speed, features necessary for industries with needs for manufacturing of products in large quantities by reducing the production time. Although robot manipulators have a significant role for the enhancement of productivity within industries, the programming process of the robot manipulators is an important drawback. Traditional programming methodologies requires robot programming experts and are time consuming. This thesis work aims to develop an application for programming industrial robot manipulators excluding the need of traditional programing methodologies exploiting the intuitiveness of humans’ hands’ gestures. The development of input devices for intuitive Human-Machine Interactions provides the possibility to capture such gestures. Hence, the need of the need of robot manipulator programming experts can be replaced by task experts. In addition, the integration of intuitive means of interaction can reduce be also reduced. The components to capture the hands’ operators’ gestures are a data glove and a precise hand-tracking device. The robot manipulator imitates the motion that human operator performs with the hand, in terms of position. Inverse kinematics are applied to enhance the programming of robot manipulators in-dependently of their structure and manufacturer and researching the possibility for optimizing the programmed robot paths. Finally, a Human-Machine Interface contributes in the programming process by offering important information for the programming process and the status of the integrated components

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

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

Optimal time trajectories for industrial robots with torque, power, jerk and energy consumed constraints

This article is (c) Emerald Group Publishing and permission has been granted for this version to appear here https://riunet.upv.es/. Emerald does not grant permission for this article to be further copied/distributed or hosted elsewhere without the express permission from Emerald Group Publishing Limited.[EN] Purpose - The purpose of this paper is to analyze the impact of the torque, power, jerk and energy consumed constraints on the generation of minimum time collision-free trajectories for industrial robots in a complex environment. Design/methodology/approach - An algorithm is presented in which the trajectory is generated under real working constraints (specifically torque, power, jerk and energy consumed). It also takes into account the presence of obstacles (to avoid collisions) and the dynamics of the robotic system. The method solves an optimization problem to find the minimum time trajectory to perform the tasks the robot should do. Findings - Important conclusions have been reached when solving the trajectory planning problem related to the value of the torque, power, jerk and energy consumed and the relationship between them, therefore enabling the user to choose the most efficient way of working depending on which parameter he is most interested in optimizing. From the examples solved the authors have found the relationship between the maximum and minimum values of the parameters studied. Research limitations/implications - This new approach tries to model the real behaviour of the actuators in order to be able to upgrade the trajectory quality, so a lot of work has to be done in this field. Practical implications - The algorithm solves the trajectory planning problem for any industrial robot and the real characteristics of the actuators are taken into account, which is essential to improve the performance of it. Originality/value - This new tool enables the performance of the robot to be improved by combining adequately the values of the mentioned parameters (torque, power, jerk and consumed energy).This paper has been made possible thanks to support from the Spanish Ministry of Science and Innovation, through the Project for Research and Technological Development, ref. DPI2010-20 814-C02-01.Rubio Montoya, FJ.; Valero Chuliá, FJ.; Suñer Martinez, JL.; Cuadrado Iglesias, JI. (2012). Optimal time trajectories for industrial robots with torque, power, jerk and energy consumed constraints. Industrial Robot: An International Journal. 39(1):92-100. doi:10.1108/01439911211192538]S9210039

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

Task-Space Clustering for Mobile Manipulator Task Sequencing

Mobile manipulators have gained attention for the potential in performing large-scale tasks which are beyond the reach of fixed-base manipulators. The Robotic Task Sequencing Problem for mobile manipulators often requires optimizing the motion sequence of the robot to visit multiple targets while reducing the number of base placements. A two-step approach to this problem is clustering the task-space into clusters of targets before sequencing the robot motion. In this paper, we propose a task-space clustering method which formulates the clustering step as a Set Cover Problem using bipartite graph and reachability analysis, then solves it to obtain the minimum number of target clusters with corresponding base placements. We demonstrated the practical usage of our method in a mobile drilling experiment containing hundreds of targets. Multiple simulations were conducted to benchmark the algorithm and also showed that our proposed method found, in practical time, better solutions than the existing state-of-the-art methods

Automatic Modeling for Modular Reconfigurable Robotic Systems: Theory and Practice

A modular reconfigurable robot consists of a collection of individual link and joint components that can be assembled into a number of different robot ge-ometries. Compared to a conventional industrial robot with fixed geometry, such a system can provide flexibility to the user to cope with a wide spectru

Using motion planning and genetic algorithms in movement optimization of industrial robots

The issues of path and trajectory planning algorithms and optimization of industrial manipulator trajectory generation are still not completely solved due to their variability and increasing complexity with the growing number of robot degrees of freedom. Generation of an optimal trajectory can be solved in several ways, such as traditional numeric and more recent approaches, which include evolutionary algorithms and genetic algorithms within them. The first chapter is devoted to a brief overview of path planning methods, especially in mobile robots. The second chapter deals with a more detailed overview of robot path planning methods in continuous and discrete environments. The third chapter describes the most popular motion planning algorithms. The fourth chapter is dedicated to genetic algorithms which we used as an optimization method. The fifth chapter focuses on optimal robot motion control and optimization methods using genetic algorithms as the method for an industrial manipulator control. The next chapter contains a solution and its implementation in support software, as well as the experimental verification of the results. The last chapter evaluates the results and their benefits