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

Proceedings of the NASA Conference on Space Telerobotics, volume 1

The theme of the Conference was man-machine collaboration in space. Topics addressed include: redundant manipulators; man-machine systems; telerobot architecture; remote sensing and planning; navigation; neural networks; fundamental AI research; and reasoning under uncertainty

Goal-Directed Reasoning and Cooperation in Robots in Shared Workspaces: an Internal Simulation Based Neural Framework

From social dining in households to product assembly in manufacturing lines, goal-directed reasoning and cooperation with other agents in shared workspaces is a ubiquitous aspect of our day-to-day activities. Critical for such behaviours is the ability to spontaneously anticipate what is doable by oneself as well as the interacting partner based on the evolving environmental context and thereby exploit such information to engage in goal-oriented action sequences. In the setting of an industrial task where two robots are jointly assembling objects in a shared workspace, we describe a bioinspired neural architecture for goal-directed action planning based on coupled interactions between multiple internal models, primarily of the robot’s body and its peripersonal space. The internal models (of each robot’s body and peripersonal space) are learnt jointly through a process of sensorimotor exploration and then employed in a range of anticipations related to the feasibility and consequence of potential actions of two industrial robots in the context of a joint goal. The ensuing behaviours are demonstrated in a real-world industrial scenario where two robots are assembling industrial fuse-boxes from multiple constituent objects (fuses, fuse-stands) scattered randomly in their workspace. In a spatially unstructured and temporally evolving assembly scenario, the robots employ reward-based dynamics to plan and anticipate which objects to act on at what time instances so as to successfully complete as many assemblies as possible. The existing spatial setting fundamentally necessitates planning collision-free trajectories and avoiding potential collisions between the robots. Furthermore, an interesting scenario where the assembly goal is not realizable by either of the robots individually but only realizable if they meaningfully cooperate is used to demonstrate the interplay between perception, simulation of multiple internal models and the resulting complementary goal-directed actions of both robots. Finally, the proposed neural framework is benchmarked against a typically engineered solution to evaluate its performance in the assembly task. The framework provides a computational outlook to the emerging results from neurosciences related to the learning and use of body schema and peripersonal space for embodied simulation of action and prediction. While experiments reported here engage the architecture in a complex planning task specifically, the internal model based framework is domain-agnostic facilitating portability to several other tasks and platforms

Industrial Robotics

This book covers a wide range of topics relating to advanced industrial robotics, sensors and automation technologies. Although being highly technical and complex in nature, the papers presented in this book represent some of the latest cutting edge technologies and advancements in industrial robotics technology. This book covers topics such as networking, properties of manipulators, forward and inverse robot arm kinematics, motion path-planning, machine vision and many other practical topics too numerous to list here. The authors and editor of this book wish to inspire people, especially young ones, to get involved with robotic and mechatronic engineering technology and to develop new and exciting practical applications, perhaps using the ideas and concepts presented herein

Genetic-Based Optimisation Technique for the Development of Automated Inspection and Restoration Systems for Bridges

Automation and robotics are receiving significant attention in the field of inspection and restoration of steel bridges. However, the success level of the field implementations depends on numerous technological factors. This dissertation addresses aspects of the design, development and subsequent implementation of such on-site devices. The restoration process poses a high level of health hazard and carries environmental pollution risk. For these reasons, it is high on the consideration list for automation. The varied scale and geometry of bridges are some of the limiting conditions for performing the inspection and restoration tasks. Further aspects of concern are access provisions, the diversity of tasks required in the assessment and restoration of a bridge and compatibility between the operational characteristics of the automated device, tasks layout and direction of approach. The key factors, which arise as a result of the above analysis, are access, mobility, navigation, manipulation, probe change and control. In order to efficiently produce design alternatives, based on the industry (customers and designers) requirements, the engineering design framework is adopted. Due to the growing complexity of the required devices, new methodologies and approaches are needed. This dissertation presents a design methodology to generate alternatives for further considerations. The author's work combines: (i) research and suitability assessment of the existing enabling technologies, (ii) extensive task selection and analysis, (iii) incorporation of the industry requirements for generating the set of design criteria, and (iv) an innovative application of Genetic Algorithms. GA is used as a tool for simultaneous optimisation of the robot’s kinematic parameters, based on the criteria of collision and singularity avoidance, percentage of coverage, productivity and dexterity. Analysis and justification of a two-step approach is presented, with the former combining all the parameters, and the latter handling the chosen criteria. The methodology is then tested and verified on an existing construction robot (MPIR) from Technion. Finally, it is applied to two case studies, spherical and articulated manipulators performing a range of restoration activities on a selected bridge geometry model. A sensitivity analysis was also carried out on each case study in order to identify areas where improvements could be made. In general, the methodology is successful in choosing the more task-suitable manipulator and optimising the ranges of its kinematic parameters. This could be extended to optimise other parameters according to a set of alternative criteria. In doing so, it can bridge over several phases of the engineering design with a single approach

Hybrid approaches for mobile robot navigation

The work described in this thesis contributes to the efficient solution of mobile robot navigation problems. A series of new evolutionary approaches is presented. Two novel evolutionary planners have been developed that reduce the computational overhead in generating plans of mobile robot movements. In comparison with the best-performing evolutionary scheme reported in the literature, the first of the planners significantly reduces the plan calculation time in static environments. The second planner was able to generate avoidance strategies in response to unexpected events arising from the presence of moving obstacles. To overcome limitations in responsiveness and the unrealistic assumptions regarding a priori knowledge that are inherent in planner-based and a vigation systems, subsequent work concentrated on hybrid approaches. These included a reactive component to identify rapidly and autonomously environmental features that were represented by a small number of critical waypoints. Not only is memory usage dramatically reduced by such a simplified representation, but also the calculation time to determine new plans is significantly reduced. Further significant enhancements of this work were firstly, dynamic avoidance to limit the likelihood of potential collisions with moving obstacles and secondly, exploration to identify statistically the dynamic characteristics of the environment. Finally, by retaining more extensive environmental knowledge gained during previous navigation activities, the capability of the hybrid navigation system was enhanced to allow planning to be performed for any start point and goal point

Evolutionary and Reinforcement Fuzzy Control

Many modern and classical techniques exist for the design of control systems. However, many real world applications are inherently complex and the application of traditional design and control techniques is limited. In addition, no single design method exists which can be applied to all types of system. Due to this 'deficiency', recent years have seen an exponential increase in the use of methods loosely termed 'computational intelligent techniques' or 'soft- computing techniques'. Such techniques tend to solve problems using a population of individual elements or potential solutions or the flexibility of a network as opposed to using a rigid, single point of computing. Through use of computational redundancies, soft-computing allows unmatched tractability in practical problem solving. The intelligent paradigm most successfully applied to control engineering, is that of fuzzy logic in the form of fuzzy control. The motivation of using fuzzy control is twofold. First, it allows one to incorporate heuristics into the control strategy, such as the model operator actions. Second, it allows nonlinearities to be defined in an intuitive way using rules and interpolations. Although it is an attractive tool, there still exist many problems to be solved in fuzzy control. To date most applications have been limited to relatively simple problems of low dimensionality. This is primarily due to the fact that the design process is very much a trial and error one and is heavily dependent on the quality of expert knowledge provided by the operator. In addition, fuzzy control design is virtually ad hoc, lacking a systematic design procedure. Other problems include those associated with the curse of dimensionality and the inability to learn and improve from experience. While much work has been carried out to alleviate most of these difficulties, there exists a lack of drive and exploration in the last of these points. The objective of this thesis is to develop an automated, systematic procedure for optimally learning fuzzy logic controllers (FLCs), which provides for autonomous and simple implementations. In pursuit of this goal, a hybrid method is to combine the advantages artificial neural networks (ANNs), evolutionary algorithms (EA) and reinforcement learning (RL). This overcomes the deficiencies of conventional EAs that may omit representation of the region within a variable's operating range and that do not in practice achieve fine learning. This method also allows backpropagation when necessary or feasible. It is termed an Evolutionary NeuroFuzzy Learning Intelligent Control technique (ENFLICT) model. Unlike other hybrids, ENFLICT permits globally structural learning and local offline or online learning. The global EA and local neural learning processes should not be separated. Here, the EA learns and optimises the ENFLICT structure while ENFLICT learns the network parameters. The EA used here is an improved version of a technique known as the messy genetic algorithm (mGA), which utilises flexible cellular chromosomes for structural optimisation. The properties of the mGA as compared with other flexible length EAs, are that it enables the addressing of issues such as the curse of dimensionality and redundant genetic information. Enhancements to the algorithm are in the coding and decoding of the genetic information to represent a growing and shrinking network; the defining of the network properties such as neuron activation type and network connectivity; and that all of this information is represented in a single gene. Another step forward taken in this thesis on neurofuzzy learning is that of learning online. Online in this case refers to learning unsupervised and adapting to real time system parameter changes. It is much more attractive because the alternative (supervised offline learning) demands quality learning data which is often expensive to obtain, and unrepresentative of and inaccurate about the real environment. First, the learning algorithm is developed for the case of a given model of the system where the system dynamics are available or can be obtained through, for example, system identification. This naturally leads to the development of a method for learning by directly interacting with the environment. The motivation for this is that usually real world applications tend to be large and complex, and obtaining a mathematical model of the plant is not always possible. For this purpose the reinforcement learning paradigm is utilised, which is the primary learning method of biological systems, systems that can adapt to their environment and experiences, in this thesis, the reinforcement learning algorithm is based on the advantage learning method and has been extended to deal with continuous time systems and online implementations, and which does not use a lookup table. This means that large databases containing the system behaviour need not be constructed, and the procedure can work online where the information available is that of the immediate situation. For complex systems of higher order dimensions, and where identifying the system model is difficult, a hierarchical method has been developed and is based on a hybrid of all the other methods developed. In particular, the procedure makes use of a method developed to work directly with plant step response, thus avoiding the need for mathematical model fitting which may be time-consuming and inaccurate. All techniques developed and contributions in the thesis are illustrated by several case studies, and are validated through simulations

A neural network-based trajectory planner for redundant systems using direct inverse modeling

Redundant (i.e., under-determined) systems can not be trained effectively using direct inverse modeling with supervised learning, for reasons well out-lined by Michael Jordan at MIT. There is a loop-hole , however, in Jordan\u27s preconditions, which seems to allow just such an architecture. A robot path planner implementing a cerebellar inspired habituation paradigm with such an architecture will be introduced. The system, called ARTFORMS, for Adaptive Redundant Trajectory Formation System uses on-line training of multiple CMACS. CMACs are locally generalizing networks, and have an a priori deterministic geometric input space mapping. These properties together with on-line learning and rapid convergence satisfy the loop-hole conditions. Issues of stability/plasticity, presentation order and generalization, computational complexity, and subsumptive fusion of multiple networks are discussed. Two implementations are described. The first is shown not to be goal directed enough for ultimate success. The second, which is highly successful, is made more goal directed by the addition of secondary training, which reduces the dimensionality of the problem by using a set of constraint equations. Running open loop with respect to posture (the system metric which reduces dimensionality) is seen to be the root cause of the first system\u27s failure, not the use of the direct inverse method. In fact, several nice properties of direct inverse modeling contribute to the system\u27s convergence speed, robustness and compliance. The central problem used to demonstrate this method is the control of trajectory formation for a planar kinematic chain with a variable number of joints. Finally, this method is extended to implement adaptive obstacle avoidance

First Annual Workshop on Space Operations Automation and Robotics (SOAR 87)

Several topics relative to automation and robotics technology are discussed. Automation of checkout, ground support, and logistics; automated software development; man-machine interfaces; neural networks; systems engineering and distributed/parallel processing architectures; and artificial intelligence/expert systems are among the topics covered

Dexterous robotic motion planning using intelligent algorithms

The fundamental purpose of robots is to help humans in a variety of difficult tasks, enabling people to increase their capabilities of strength, energy, speed, memory, and to operate in hazardous environments and many other applications. Service robots, more precisely mobile manipulators, incorporate one or two robotic arms and a mobile base, and must accomplish complex manipulations tasks, interacting with tools or objects and navigating through cluttered environments. To this end, the motion planning problem plays a key role in the ahead calculation of robot movements to interact with its world and achieve the established goals. The objective of this work is to design various motion planning methods in order to improve the autonomy of MANFRED-2, which is a mobile robot fully developed by the Robotics Lab research group of the Systems Engineering and Automation Department of the Carlos III University of Madrid. Mobile robots need to calculate accurate paths in order to navigate and interact with objects throughout their surrounding area. In this work, we have developed motion planning algorithms for both navigation and manipulation. The presented algorithms for path planning are based on the Fast Marching Square method and include a replanner with subgoals, an anytime triangular planner, and a nonholonomic approach. The replanner with subgoals starts by generating a smooth and safe global path with the Fast Marching Square method. Then, this path is divided into multiple subpaths separated by equidistant nodes (defined by topological or metric constraints). After that, the obstacles information is progressively added and modifications are made only when the original path is unreachable. The most important advantage with respect to similar approaches is that the generated sub-paths are always efficient in terms of smoothness and safeness. Besides, the computational cost is low enough to use the algorithm in real-time. The anytime triangular planner, such as “Anytime” algorithms, quickly finds a feasible but not necessarily optimal motion plan which is incrementally improved. One important characteristic that this type of algorithms must satisfy is that the path must be generated in real-time. The planner relies on the Fast Marching Square method over a triangular mesh structure. Different variants are introduced and compared under equal circumstances that produce different paths in response time and quality, which leads us to an additional consideration. As in the field of benchmarking it is becoming increasingly difficult to compare new planners approaches because of the lack of a general benchmarking platform, improvements to existing approaches are suggested. Finally, the nonholonomic approach is presented. It is based on the Fast Marching Square method and its application to car-like robots. In order to apply the proposed method, a three dimensional configuration space of the environment is considered. The first two dimensions are given by the position of the robot, and the third one by its orientation. This means that we operate over the configuration space instead of the bi-dimensional environment map. Besides, the trajectory is computed along the configuration space taking into account the dimensions of the vehicle. In this way, it is possible to guarantee the absence of collisions. The proposed method is consistent at local and global scale because it guarantees a motion path solution, if it exists, and does not require global replanning supervision when a local trap is detected. Once a mobile robot has reached a goal location, it usually triggers the servomotors enclosed inside its robotic arm to manipulate a target. The manipulation algorithms presented in this work include the adaptation of trajectories, a planner with adaptive dimensionality, and an implementation of a dimensionality reduction approach inside a nuclear device. The adaptation of manipulation trajectories enables the robot to accomplish a task in different locations by using Evolution Strategies and forward kinematics. This approach avoids all the inconveniences that inverse kinematics imply, as well as the convergence problems in singular kinematic configurations. The planner with adaptive dimensionality reduces the complexity of high-dimensional path planning. First, a Rapidly-exploring Random Tree trajectory is generated using the full degrees of freedom of the robotic arm. Then, a geometry as a closed tube is built around the path line and the Fast Marching Square method is applied from start to goal using three dimensions inside the surface. The resulted three dimensional path is converted to full degrees of freedom with the inverse kinematics of the robot. The result is a smoother and safer path, visually more human friendly. Additionally, the search space is reduced, and therefore, also the planning time and the memory requirements. The application inside the nuclear device, similarly to the previous approach, reduces the degrees of freedom of the problem (but this time to two dimensions due to the mostly planar nature of the robot). The manipulation path is smooth and safe in an environment where safety must be the primarily objective. The motion planning algorithms have been tested in numerous experiments. The fast response of the methods allows its application in real-time tasks.El propósito fundamental de los robots es ayudar a los humanos en tareas difíciles, lo que permite a las personas incrementar sus capacidades de fuerza, energía, velocidad y memoria para trabajar en entornos peligrosos y en una inmensa variedad de aplicaciones. Los robots de servicio, puntualmente los manipuladores móviles, incorporan uno o dos brazos robóticos y una base móvil, y deben ser capaces de realizar tareas complejas de manipulación, interactuando con herramientas u objetos y navegando a través de entornos con obstáculos. Para este fin, el problema de la planificación de movimientos juega un rol clave en el cálculo anticipado de los movimientos del robot, para interactuar con su mundo y realizar las tareas establecidas. El objetivo de este trabajo es diseñar diversos métodos de planificación de movimiento con el fin de mejorar la autonomía de MANFRED-2, un robot móvil que fue desarrollado completamente en el grupo de investigación del Laboratorio de Robótica del Departamento de Ingeniería de Sistemas y Automatización de la Universidad Carlos III de Madrid. Los robots móviles necesitan calcular de antemano trayectorias precisas para poder navegar e interactuar con objetos en su entorno. En este trabajo, hemos desarrollado algoritmos de planificación de movimiento para navegación y manipulación robótica. Los algoritmos presentados para la planificación de trayectorias de navegación se basan en el método de Fast Marching Square (FM2) e incluyen un replanificador con sub-objetivos, un planificador triangular de tipo interrumpible (en inglés este enfoque es mejor conocido como Anytime), y un enfoque no holonómico. El replanificador con submetas comienza generando una trayectoria global de curvas suaves y segura con FM2, entonces este camino es dividido en múltiples subtrayectorias separadas por nodos equidistantes (definidos por restricciones topológicas o métricas). Después de esto, se actualiza progresivamente el entorno con obstáculos detectados por los sensores; sólo se realizan cambios cuando la trayectoria original resulta inalcanzable. La ventaja más importante con respecto a enfoques similares es que las sub-trayectorias generadas son siempre eficientes en términos de suavidad y seguridad. Además, el coste computacional es lo suficientemente bajo como para utilizar el algoritmo en tiempo real. El planificador triangular interrumpible, como algoritmo “Anytime”, encuentra rápidamente una trayectoria de navegación válida, pero no necesariamente ópti ma, a continuación, de forma incremental se va mejorando según haya tiempo hasta llegar al óptimo. La capacidad más resaltante de este tipo de algoritmos es la de generar trayectorias en tiempo real. El planificador se basa en el uso de FM2 sobre una estructura de malla triangular. Se presentan diferentes formas de construir el mallado y se comparan en igualdad de circunstancias los diferentes caminos producidos en tiempo de respuesta y calidad, lo que generó una contribución adicional. Debido a la falta de una plataforma general de evaluación robusta, en el campo de la evaluación de trayectorias es cada vez más difícil comparar nuevos planificadores, por consiguiente se sugieren mejoras a los enfoques existentes. Finalmente, se presenta el enfoque no holónomo, que se basa en FM2 y su aplicación en robots móviles con sistemas de dirección similares a la de los coches. Para aplicar el método propuesto, se considera un espacio de configuración tridimensional del entorno, donde las dos primeras dimensiones vienen dadas por la posición del robot y la tercera dimensión, por su orientación. Esto quiere decir, que operamos en el espacio de configuraciones en vez de en el mapa bidimensional del entorno. Además, la trayectoria se calcula en el espacio de configuraciones teniendo en cuenta las dimensiones del vehículo, de esta manera es posible garantizar la ausencia de colisiones. El método propuesto es consistente a nivel local y global, ya que si existe una solución se garantiza encontrarla, y no requiere de supervisión global para reiniciar una planificación cuando se detecta un bloqueo a nivel local. Una vez que el robot móvil ha alcanzado la ubicación requerida, se suelen accionar los servomotores que están dentro del brazo robótico para manipular un objeto. Los algoritmos de manipulación presentados en este trabajo incluyen la adaptación de trayectorias, un planificador con dimensionalidad adaptable, y una implementación de un método de reducción de la dimensionalidad dentro de un dispositivo nuclear. La adaptación de las trayectorias de manipulación permite al robot realizar una misma tarea con diferentes ubicaciones y orientaciones haciendo uso de una Evolution Strategy y la cinemática directa del robot, este enfoque evita todos los inconvenientes que implican utilizar la cinemática inversa, así como los problemas de convergencia en configuraciones cinemáticas singulares. El planificador con dimensionalidad adaptativa reduce la complejidad de la planificación de trayectorias de manipulación con muchas dimensiones; en primer lugar, una trayectoria RRT se genera utilizando todos los grados de libertad (DOF) del brazo robótico, a continuación, una figura geométrica en forma de tubo cerrado se construye alrededor de la línea de la trayectoria y se aplica FM2 dentro de la superficie desde el inicio hasta el objetivo utilizando tres dimensiones, la ruta 3D resultante se convierte con la cinemática inversa del robot. El resultado es un camino más suave y seguro, más amigable a la vista humana. Además, debido a que el espacio de búsqueda se reduce, también se reduce el tiempo de planificación y los requerimientos de memoria. La aplicación en el interior del dispositivo nuclear, de manera similar al enfoque anterior, reduce los DOF del problema pero esta vez a dos dimensiones aprovechando la naturaleza mayormente plana del robot utilizado. La trayectoria de manipulación es suave y segura, lo que es conveniente en un entorno donde la seguridad debe ser el objetivo principal. Los algoritmos de planificación de movimiento resultantes han sido probados en numerosos experimentos. La respuesta rápida de los métodos permite su aplicación en tiempo real.Programa Oficial de Doctorado en Ingeniería Eléctrica, Electrónica y AutomáticaPresidente: Carlos Balaguer Bernaldo de Quirós.- Secretario: Carlos Sagüés Blázquiz.- Vocal: Pedro Lim