375 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

    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

    Development of Novel Task-Based Configuration Optimization Methodologies for Modular and Reconfigurable Robots Using Multi-Solution Inverse Kinematic Algorithms

    Get PDF
    Modular and Reconfigurable Robots (MRRs) are those designed to address the increasing demand for flexible and versatile manipulators in manufacturing facilities. The term, modularity, indicates that they are constructed by using a limited number of interchangeable standardized modules which can be assembled in different kinematic configurations. Thereby, a wide variety of specialized robots can be built from a set of standard components. The term, reconfigurability, implies that the robots can be disassembled and rearranged to accommodate different products or tasks rather than being replaced. A set of MRR modules may consist of joints, links, and end-effectors. Different kinematic configurations are achieved by using different joint, link, and end-effector modules and by changing their relative orientation. The number of distinct kinematic configurations, attainable by a set of modules, varies with respect to the size of the module set from several tens to several thousands. Although determining the most suitable configuration for a specific task from a predefined set of modules is a highly nonlinear optimization problem in a hybrid continuous and discrete search space, a solution to this problem is crucial to effectively utilize MRRs in manufacturing facilities. The objective of this thesis is to develop novel optimization methods that can effectively search the Kinematic Configuration (KC) space to identify the most suitable manipulator for any given task. In specific terms, the goal is to develop and synthesize fast and efficient algorithms for a Task-Based Configuration Optimization (TBCO) from a given set of constraints and optimization criteria. To achieve such efficiency, a TBCO solver, based on Memetic Algorithms (MA), is proposed. MAs are hybrids of Genetic Algorithms (GAs) and local search algorithms. MAs benefit from the exploration abilities of GAs and the exploitation abilities of local search methods simultaneously. Consequently, MAs can significantly enhance the search efficiency of a wide range of optimization problems, including the TBCO. To achieve more optimal solutions, the proposed TBCO utilizes all the solutions of the Inverse Kinematics(IK) problem. Another objective is to develop a method for incorporating the multiple solutions of the IK problem in a trajectory optimization framework. The output of the proposed trajectory optimization method consists of a sequence of desired tasks and a single IK solution to reach each task point. Moreover, the total cost of the optimized trajectory is utilized in the TBCO as a performance measure, providing a means to identify kinematic configurations with more efficient optimized trajectories. The final objective is to develop novel IK solvers which are both general and complete. Generality means that the solvers are applicable to all the kinematic configurations which can be assembled from the available module inventory. Completeness entails the algorithm can obtain all the possible IK solutions

    Aerospace medicine and biology: A cumulative index to a continuing bibliography (supplement 345)

    Get PDF
    This publication is a cumulative index to the abstracts contained in Supplements 333 through 344 of Aerospace Medicine and Biology: A Continuing Bibliography. Seven indexes are included -- subject, personal author, corporate source, foreign technology, contract number, report number, and accession number

    Multi-Criteria Manipulator Trajectory Optimization Based on Evolutionary Algorithms

    Get PDF
    This paper proposes a method, based on a genetic algorithm, to generate smoth manipulator trajectories in a multi-objective perspective. The method uses terms proportional to the integral of the squared displacements in order to eliminate the jerk movement. In this work, the algorithm, based on NSGA-II and maximin sorting schemes, considers manipulators of two, three and four rotational axis (2R, 3R, 4R). The efficiency of the algorithm is evaluated, namely the extension of the front and the dispersion along the front. The effectiveness and capacity of the proposed approach are shown through simulations tests.N/

    Design and Development of an Automated Mobile Manipulator for Industrial Applications

    Get PDF
    This thesis presents the modeling, control and coordination of an automated mobile manipulator. A mobile manipulator in this investigation consists of a robotic manipulator and a mobile platform resulting in a hybrid mechanism that includes a mobile platform for locomotion and a manipulator arm for manipulation. The structural complexity of a mobile manipulator is the main challenging issue because it includes several problems like adapting a manipulator and a redundancy mobile platform at non-holonomic constraints. The objective of the thesis is to fabricate an automated mobile manipulator and develop control algorithms that effectively coordinate the arm manipulation and mobility of mobile platform. The research work starts with deriving the motion equations of mobile manipulators. The derivation introduced here makes use of motion equations of robot manipulators and mobile platforms separately, and then integrated them as one entity. The kinematic analysis is performed in two ways namely forward & inverse kinematics. The motion analysis is performed for various WMPs such as, Omnidirectional WMP, Differential three WMP, Three wheeled omni-steer WMP, Tricycle WMP and Two steer WMP. From the obtained motion analysis results, Differential three WMP is chosen as the mobile platform for the developed mobile manipulator. Later motion analysis is carried out for 4-axis articulated arm. Danvit-Hartenberg representation is implemented to perform forward kinematic analysis. Because of this representation, one can easily understand the kinematic equation for a robotic arm. From the obtained arm equation, Inverse kinematic model for the 4-axis robotic manipulator is developed. Motion planning of an intelligent mobile robot is one of the most vital issues in the field of robotics, which includes the generation of optimal collision free trajectories within its work space and finally reaches its target position. For solving this problem, two evolutionary algorithms namely Particle Swarm Optimization (PSO) and Artificial Immune System (AIS) are introduced to move the mobile platform in intelligent manner. The developed algorithms are effective in avoiding obstacles, trap situations and generating optimal paths within its unknown environments. Once the robot reaches its goal (within the work space of the manipulator), the manipulator will generate its trajectories according to task assigned by the user. Simulation analyses are performed using MATLAB-2010 in order to validate the feasibility of the developed methodologies in various unknown environments. Additionally, experiments are carried out on an automated mobile manipulator. ATmega16 Microcontrollers are used to enable the entire robot system movement in desired trajectories by means of robot interface application program. The control program is developed in robot software (Keil) to control the mobile manipulator servomotors via a serial connection through a personal computer. To support the proposed control algorithms both simulation and experimental results are presented. Moreover, validation of the developed methodologies has been made with the ER-400 mobile platform

    Optimization of Robot Motion Planning using Ant Colony Optimization

    Get PDF
    Motion planning in robotics is a process to compute a collision free path between the initial and final configuration among obstacles. To plan a collision free path in the workspace, it would need to plan the motion of every point of its shaping according its degree of freedom. The motion of robot between obstacles is represented by a path in configuration space. It is an imaginary concept. Motion planning is aimed at enabling robots with capabilities of automatically deciding and executing a sequence motion in order to achieve a task without ollision with other objects in a given environment. Motion planning in a robot workspace for robotic assembly depends on sequence of parts or the order they are arranged to produce a robotic assembly product obeying all the constraints and instability of base assembly movement. If the number of parts increases the sequencing becomes difficult and hence the path planning. As multiple no. of paths are possible, the path is considered to be optimal when it minimizes the travelling time while satisfying the process constraint. For this purpose, it is necessary to select appropriate optimization technique for optimization of paths. Such types of problem can be solved by metaheuristic methods.The present work utilizes ACO for the generation of optimal motion planning sequence. The present algorithm is based on ant's behavior, pheromone update & pheromone evaporation and is used to enhance the local search. This procedure is applied to a grinder assembly, driver assembly and car alternator assembly. Two robots like adept-one and puma-762 are selected for picking and placing operation of parts in their workspace

    Robot Manipulators

    Get PDF
    Robot manipulators are developing more in the direction of industrial robots than of human workers. Recently, the applications of robot manipulators are spreading their focus, for example Da Vinci as a medical robot, ASIMO as a humanoid robot and so on. There are many research topics within the field of robot manipulators, e.g. motion planning, cooperation with a human, and fusion with external sensors like vision, haptic and force, etc. Moreover, these include both technical problems in the industry and theoretical problems in the academic fields. This book is a collection of papers presenting the latest research issues from around the world
    corecore