107 research outputs found

    Safe human-robot interaction based on dynamic sphere-swept line bounding volumes

    Get PDF
    This paper presents a geometric representation for human operators and robotic manipulators, which cooperate in the development of flexible tasks. The main goal of this representation is the implementation of real-time proximity queries, which are used by safety strategies for avoiding dangerous collisions between humans and robotic manipulators. This representation is composed of a set of bounding volumes based on swept-sphere line primitives, which encapsulate their links more precisely than previous sphere-based models. The radius of each bounding volume does not only represent the size of the encapsulated link, but it also includes an estimation of its motion. The radii of these dynamic bounding volumes are obtained from an algorithm which computes the linear velocity of each link. This algorithm has been implemented for the development of a safety strategy in a real human–robot interaction task.This work is funded by the Spanish Ministry of Education and the Spanish Ministry of Science and Innovation through the projects DPI2005-06222 and DPI2008-02647 and the grant AP2005-1458

    Sensor Observability Index: Evaluating Sensor Alignment for Task-Space Observability in Robotic Manipulators

    Full text link
    In this paper, we propose a preliminary definition and analysis of the novel concept of sensor observability index. The goal is to analyse and evaluate the performance of distributed directional or axial-based sensors to observe specific axes in task space as a function of joint configuration in serial robot manipulators. For example, joint torque sensors are often used in serial robot manipulators and assumed to be perfectly capable of estimating end effector forces, but certain joint configurations may cause one or more task-space axes to be unobservable as a result of how the joint torque sensors are aligned. The proposed sensor observability provides a method to analyse the quality of the current robot configuration to observe the task space. Parallels are drawn between sensor observability and the traditional kinematic Jacobian for the particular case of joint torque sensors in serial robot manipulators. Although similar information can be retrieved from kinematic analysis of the Jacobian transpose in serial manipulators, sensor observability is shown to be more generalizable in terms of analysing non-joint-mounted sensors and other sensor types. In addition, null-space analysis of the Jacobian transpose is susceptible to false observability singularities. Simulations and experiments using the robot Baxter demonstrate the importance of maintaining proper sensor observability in physical interactions.Comment: 7 pages, 5 figures, conference pape

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

    Get PDF
    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

    Task-Based Mass Optimization of Reconfigurable Robotic Manipulator Systems

    Get PDF
    This work develops a method for implementing task-based mass optimization of modular, reconfigurable manipulators. Link and joint modules are selected from a library of potential parts and assembled into serial manipulator configurations. A genetic algorithm is used to search over the potential set of combinations to find mass-minimized solutions. To facilitate the automatic evaluation required by the genetic algorithm, Denavit-Hartenberg parameters are automatically generated from module combinations. Reconfigurable manipulators are shown to be lighter than fixed-topology manipulators, demonstrating the potential utility of reconfigurable robotics technology for mass reduction in space robots

    Characterization and control of self-motions in redundant manipulators

    Get PDF
    The presence of redundant degrees of freedom in a manipulator structure leads to a physical phenomenon known as a self-motion, which is a continuous motion of the manipulator joints that leaves the end-effector motionless. In the first part of the paper, a global manifold mapping reformulation of manipulator kinematics is reviewed, and the inverse kinematic solution for redundant manipulators is developed in terms of self-motion manifolds. Global characterizations of the self-motion manifolds in terms of their number, geometry, homotopy class, and null space are reviewed using examples. Much previous work in redundant manipulator control has been concerned with the redundancy resolution problem, in which methods are developed to determine, or resolve, the motion of the joints in order to achieve end-effector trajectory control while optimizing additional objective functions. Redundancy resolution problems can be equivalently posed as the control of self-motions. Alternatives for redundancy resolution are briefly discussed

    Trajectory planning for industrial robot using genetic algorithms

    Full text link
    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

    On Sensor-Controlled Robotized One-off Manufacturing

    Get PDF
    A semi-automatic task oriented system structure has been developed and tested on an arc welding application. In normal industrial robot programming, the path is created and the process is based upon the decided path. Here a process-oriented method is proposed instead. It is natural to focus on the process, since the path is in reality a result of process needs. Another benefit of choosing process focus, is that it automatically leads us into task oriented thoughts, which in turn can be split in sub-tasks, one for each part of the process with similar process-characteristics. By carefully choosing and encapsulating the information needed to execute a sub-task, this component can be re-used whenever the actual subtask occurs. By using virtual sensors and generic interfaces to robots and sensors, applications built upon the system design do not change between simulation and actual shop floor runs. The system allows a mix of real- and simulated components during simulation and run-time
    corecore