1,259 research outputs found

    Multi-Criteria Optimization Manipulator Trajectory Planning

    Get PDF
    In the last twenty years genetic algorithms (GAs) were applied in a plethora of fields such as: control, system identification, robotics, planning and scheduling, image processing, and pattern and speech recognition (Bäck et al., 1997). In robotics the problems of trajectory planning, collision avoidance and manipulator structure design considering a single criteria has been solved using several techniques (Alander, 2003). Most engineering applications require the optimization of several criteria simultaneously. Often the problems are complex, include discrete and continuous variables and there is no prior knowledge about the search space. These kind of problems are very more complex, since they consider multiple design criteria simultaneously within the optimization procedure. This is known as a multi-criteria (or multiobjective) optimization, that has been addressed successfully through GAs (Deb, 2001). The overall aim of multi-criteria evolutionary algorithms is to achieve a set of non-dominated optimal solutions known as Pareto front. At the end of the optimization procedure, instead of a single optimal (or near optimal) solution, the decision maker can select a solution from the Pareto front. Some of the key issues in multi-criteria GAs are: i) the number of objectives, ii) to obtain a Pareto front as wide as possible and iii) to achieve a Pareto front uniformly spread. Indeed, multi-objective techniques using GAs have been increasing in relevance as a research area. In 1989, Goldberg suggested the use of a GA to solve multi-objective problems and since then other researchers have been developing new methods, such as the multi-objective genetic algorithm (MOGA) (Fonseca & Fleming, 1995), the non-dominated sorted genetic algorithm (NSGA) (Deb, 2001), and the niched Pareto genetic algorithm (NPGA) (Horn et al., 1994), among several other variants (Coello, 1998). In this work the trajectory planning problem considers: i) robots with 2 and 3 degrees of freedom (dof ), ii) the inclusion of obstacles in the workspace and iii) up to five criteria that are used to qualify the evolving trajectory, namely the: joint traveling distance, joint velocity, end effector / Cartesian distance, end effector / Cartesian velocity and energy involved. These criteria are used to minimize the joint and end effector traveled distance, trajectory ripple and energy required by the manipulator to reach at destination point. Bearing this ideas in mind, the paper addresses the planning of robot trajectories, meaning the development of an algorithm to find a continuous motion that takes the manipulator from a given starting configuration up to a desired end position without colliding with any obstacle in the workspace. The chapter is organized as follows. Section 2 describes the trajectory planning and several approaches proposed in the literature. Section 3 formulates the problem, namely the representation adopted to solve the trajectory planning and the objectives considered in the optimization. Section 4 studies the algorithm convergence. Section 5 studies a 2R manipulator (i.e., a robot with two rotational joints/links) when the optimization trajectory considers two and five objectives. Sections 6 and 7 show the results for the 3R redundant manipulator with five goals and for other complementary experiments are described, respectively. Finally, section 8 draws the main conclusions

    Heuristic Optimization Algorithms in Robotics

    Get PDF

    Robust Sliding Mode Control Based on GA Optimization and CMAC Compensation for Lower Limb Exoskeleton

    Get PDF
    A lower limb assistive exoskeleton is designed to help operators walk or carry payloads. The exoskeleton is required to shadow human motion intent accurately and compliantly to prevent incoordination. If the user’s intention is estimated accurately, a precise position control strategy will improve collaboration between the user and the exoskeleton. In this paper, a hybrid position control scheme, combining sliding mode control (SMC) with a cerebellar model articulation controller (CMAC) neural network, is proposed to control the exoskeleton to react appropriately to human motion intent. A genetic algorithm (GA) is utilized to determine the optimal sliding surface and the sliding control law to improve performance of SMC. The proposed control strategy (SMC_GA_CMAC) is compared with three other types of approaches, that is, conventional SMC without optimization, optimal SMC with GA (SMC_GA), and SMC with CMAC compensation (SMC_CMAC), all of which are employed to track the desired joint angular position which is deduced from Clinical Gait Analysis (CGA) data. Position tracking performance is investigated with cosimulation using ADAMS and MATLAB/SIMULINK in two cases, of which the first case is without disturbances while the second case is with a bounded disturbance. The cosimulation results show the effectiveness of the proposed control strategy which can be employed in similar exoskeleton systems

    A memetic approach to the inverse kinematics problem for robotic applications

    Get PDF
    The inverse kinematics problem of an articulated robot system refers to computing the joint configuration that places the end-effector at a given position and orientation. To overcome the numerical instability of the Jacobian-based algorithms around singular joint configurations, the inverse kinematics is formulated as a constrained minimization problem in the configuration space of the robot. In previous works this problem has been solved for redundant and non-redundant robots using evolutionary-based algorithms. However, despite the flexibility and accuracy of the direct search approach of evolutionary algorithms, these algorithms are not suitable for most robot applications given their low convergence speed rate and the high computational cost of their population-based approach. In this thesis, we propose a memetic variant of the Differential Evolution (DE) algorithm to increase its convergence speed on the kinematics inversion problem of articulated robot systems. With the aim to yield an efficient trade-off between exploration and exploitation of the search space, the memetic approach combines the global search scheme of the standard DE with an independent local search mechanisms, called discarding. The proposed scheme is tested on a simulation environment for different benchmark serial robot manipulators and anthropomorphic robot hands. Results show that the memetic differential evolution is able to find solutions with high accuracy in less generations than the original DE. -----------------------------------------------------------La cinemática inversa de los robots manipuladores se refiere al problema de calcular las coordenadas articulares del robot a partir de coordenadas conocidas de posición y orientación de su extremo libre. Para evitar la inestabilidad numérica de los métodos basados en la inversa de la matriz Jacobiana en la vecindad de configuraciones singulares, el problema de cinemática inversa es definido en el espacio de configuraciones del robot manipulador como un problema de optimización con restricciones. Este problema de optimización ha sido previamente resuelto con métodos evolutivos para robots manipuladores, redundantes y no redundantes, obteniéndose buenos resultados; sin embargo, estos métodos exhiben una baja velocidad de convergencia no adecuada para aplicaciones robóticas. Para incrementar la velocidad de convergencia de estos algoritmos, se propone un método memético de evolución differencial. El enfoque de búsqueda directa propuesto combina el esquema estándar de evolución diferencial con un mecanismo independiente de refinamiento local, llamado discarding o descarte. El desempeño del método propuesto es evaluado en un entorno de simulación para diferentes robot manipuladores y manos robóticas antropomórficas. Los resultados obtenidos muestran una importante mejora en precisión y velocidad de convergencia en comparación del método DE original.Programa en Ingeniería Eléctrica, Electrónica y AutomáticaPresidente: Pedro M. Urbano de Almeida Lima; Vocal: Cecilia Elisabet García Cena; Secretario: Mohamed Abderrahim Fichouch

    Inverse Kinematic Analysis of Robot Manipulators

    Get PDF
    An important part of industrial robot manipulators is to achieve desired position and orientation of end effector or tool so as to complete the pre-specified task. To achieve the above stated goal one should have the sound knowledge of inverse kinematic problem. The problem of getting inverse kinematic solution has been on the outline of various researchers and is deliberated as thorough researched and mature problem. There are many fields of applications of robot manipulators to execute the given tasks such as material handling, pick-n-place, planetary and undersea explorations, space manipulation, and hazardous field etc. Moreover, medical field robotics catches applications in rehabilitation and surgery that involve kinematic, dynamic and control operations. Therefore, industrial robot manipulators are required to have proper knowledge of its joint variables as well as understanding of kinematic parameters. The motion of the end effector or manipulator is controlled by their joint actuator and this produces the required motion in each joints. Therefore, the controller should always supply an accurate value of joint variables analogous to the end effector position. Even though industrial robots are in the advanced stage, some of the basic problems in kinematics are still unsolved and constitute an active focus for research. Among these unsolved problems, the direct kinematics problem for parallel mechanism and inverse kinematics for serial chains constitute a decent share of research domain. The forward kinematics of robot manipulator is simpler problem and it has unique or closed form solution. The forward kinematics can be given by the conversion of joint space to Cartesian space of the manipulator. On the other hand inverse kinematics can be determined by the conversion of Cartesian space to joint space. The inverse kinematic of the robot manipulator does not provide the closed form solution. Hence, industrial manipulator can achieve a desired task or end effector position in more than one configuration. Therefore, to achieve exact solution of the joint variables has been the main concern to the researchers. A brief introduction of industrial robot manipulators, evolution and classification is presented. The basic configurations of robot manipulator are demonstrated and their benefits and drawbacks are deliberated along with the applications. The difficulties to solve forward and inverse kinematics of robot manipulator are discussed and solution of inverse kinematic is introduced through conventional methods. In order to accomplish the desired objective of the work and attain the solution of inverse kinematic problem an efficient study of the existing tools and techniques has been done. A review of literature survey and various tools used to solve inverse kinematic problem on different aspects is discussed. The various approaches of inverse kinematic solution is categorized in four sections namely structural analysis of mechanism, conventional approaches, intelligence or soft computing approaches and optimization based approaches. A portion of important and more significant literatures are thoroughly discussed and brief investigation is made on conclusions and gaps with respect to the inverse kinematic solution of industrial robot manipulators. Based on the survey of tools and techniques used for the kinematic analysis the broad objective of the present research work is presented as; to carry out the kinematic analyses of different configurations of industrial robot manipulators. The mathematical modelling of selected robot manipulator using existing tools and techniques has to be made for the comparative study of proposed method. On the other hand, development of new algorithm and their mathematical modelling for the solution of inverse kinematic problem has to be made for the analysis of quality and efficiency of the obtained solutions. Therefore, the study of appropriate tools and techniques used for the solution of inverse kinematic problems and comparison with proposed method is considered. Moreover, recommendation of the appropriate method for the solution of inverse kinematic problem is presented in the work. Apart from the forward kinematic analysis, the inverse kinematic analysis is quite complex, due to its non-linear formulations and having multiple solutions. There is no unique solution for the inverse kinematics thus necessitating application of appropriate predictive models from the soft computing domain. Artificial neural network (ANN) can be gainfully used to yield the desired results. Therefore, in the present work several models of artificial neural network (ANN) are used for the solution of the inverse kinematic problem. This model of ANN does not rely on higher mathematical formulations and are adept to solve NP-hard, non-linear and higher degree of polynomial equations. Although intelligent approaches are not new in this field but some selected models of ANN and their hybridization has been presented for the comparative evaluation of inverse kinematic. The hybridization scheme of ANN and an investigation has been made on accuracies of adopted algorithms. On the other hand, any Optimization algorithms which are capable of solving various multimodal functions can be implemented to solve the inverse kinematic problem. To overcome the problem of conventional tool and intelligent based method the optimization based approach can be implemented. In general, the optimization based approaches are more stable and often converge to the global solution. The major problem of ANN based approaches are its slow convergence and often stuck in local optimum point. Therefore, in present work different optimization based approaches are considered. The formulation of the objective function and associated constrained are discussed thoroughly. The comparison of all adopted algorithms on the basis of number of solutions, mathematical operations and computational time has been presented. The thesis concludes the summary with contributions and scope of the future research work

    Predictive Context-Based Adaptive Compliance for Interaction Control of Robot Manipulators

    Get PDF
    In classical industrial robotics, robots are concealed within structured and well-known environments performing highly-repetitive tasks. In contrast, current robotic applications require more direct interaction with humans, cooperating with them to achieve a common task and entering home scenarios. Above all, robots are leaving the world of certainty to work in dynamically-changing and unstructured environments that might be partially or completely unknown to them. In such environments, controlling the interaction forces that appear when a robot contacts a certain environment (be the environment an object or a person) is of utmost importance. Common sense suggests the need to leave the stiff industrial robots and move towards compliant and adaptive robot manipulators that resemble the properties of their biological counterpart, the human arm. This thesis focuses on creating a higher level of intelligence for active compliance control methods applied to robot manipulators. This work thus proposes an architecture for compliance regulation named Predictive Context-Based Adaptive Compliance (PCAC) which is composed of three main components operating around a 'classical' impedance controller. Inspired by biological systems, the highest-level component is a Bayesian-based context predictor that allows the robot to pre-regulate the arm compliance based on predictions about the context the robot is placed in. The robot can use the information obtained while contacting the environment to update its context predictions and, in case it is necessary, to correct in real time for wrongly predicted contexts. Thus, the predictions are used both for anticipating actions to be taken 'before' proceeding with a task as well as for applying real-time corrective measures 'during' the execution of a in order to ensure a successful performance. Additionally, this thesis investigates a second component to identify the current environment among a set of known environments. This in turn allows the robot to select the proper compliance controller. The third component of the architecture presents the use of neuroevolutionary techniques for selecting the optimal parameters of the interaction controller once a certain environment has been identified

    Genetic algorithm optimization and control system design of flexible structures

    Get PDF
    This paper presents an investigation into the deployment of genetic algorithm (GA)-based controller design and optimization for vibration suppression in flexible structures. The potential of GA is explored in three case studies. In the first case study, the potential of GA is demonstrated in the development and optimization of a hybrid learning control scheme for vibration control of flexible manipulators. In the second case study, an active control mechanism for vibration suppression of flexible beam structures using GA optimization technique is proposed. The third case study presents the development of an effective adaptive command shaping control scheme for vibration control of a twin rotor system, where GA is employed to optimize the amplitudes and time locations of the impulses in the proposed control algorithm. The effectiveness of the proposed control schemes is verified in both an experimental and a simulation environment, and their performances are assessed in both the time and frequency domains

    A Real-Time Optimization for 2R Manipulators

    Get PDF
    This work proposes a real-time algorithm to generate a trajectory for a 2 link planar robotic manipulator. The objective is to minimize the space/time ripple and the energy requirements or the time duration in the robot trajectories. The proposed method uses an off line genetic algorithm to calculate every possible trajectory between all cells of the workspace grid. The resultant trajectories are saved in several trees. Then any trajectory requested is constructed in real-time, from these trees. The article presents the results for several experiments
    corecore