An Improved Robot Path Planning Algorithm

Robot path planning is a NP problem. Traditionaloptimization methods are not very effective to solve it. Traditional genetic algorithm trapped into the local minimum easily. Therefore, based on a simple genetic algorithm and combine the base ideology of orthogonal design method then applied it to the population initialization, using the intergenerational elite mechanism, as well as the introduction of adaptive local search operator to prevent trapped into the local minimum and improvethe convergence speed to form a new genetic algorithm. Through the series of numerical experiments, the new algorithm has been proved to be efficiency.We also use the proposed algorithm to solve the robot path planning problem and the experiment results indicated that the new algorithm is efficiency for solving the robot path planning problems and the best path usually can be found

Performance evaluation of Max-Min Ant System Algorithm for Robot Path Planning in Grid Environment

Path planning is an essential task for the robot to navigate and control its motion in any environment. The optimal path needs to be rerouted each time a new obstacle appears in front of the robot in a dynamic environment. This research focuses on the MAX-MIN Ant System Algorithm(MMAS) which is an Ant Colony Algorithm derived from Ant System(AS) and is different from it in terms of the pheromone deposition. The effectiveness of this algorithm to obtain a near optimal solution is illustrated by the means of experimental study. Using a greedier search than the Ant System algorithm is one of the specific characteristics of the MMAS, which will be studied in the research. The robot environment model is represented by a grid which has obstacles whose positions change in each map that is used. Local search routines and diversification mechanisms introduced by the previous researchers are used to enhance the performance of the MMAS algorithm. To implement the MMAS algorithm used in our research, the experiments are performed in Matlab development environment where a simulation program is designed, and the algorithm is implemented in grid maps of sizes starting from the smallest grid 10x10 to the grid of size 400x400. We implemented and analyzed the performance of the algorithm in larger grid environments to understand how it would perform when the search space is too huge; which would enable researchers to use the MMAS algorithm in experiments involving real-life environments. In our experiments, a new obstacle is added after every iteration of the algorithm which makes it challenging for the robots to find the near-optimal path. The performance evaluation of the MMAS algorithm is studied and is also compared to that of the ACO algorithm when implemented in differently sized grid maps

Mobile robot path planning by means of ant algorithms

Tato práce se zabývá plánováním cesty robota při použití algoritmů pro optimalizaci pomocí mravenčích kolonií. Teoretická část práce uvádí základní pojmy z problematiky plánování cesty robota. Dále se teoretická část věnuje mravenčím algoritmům coby nástrojům pro optimalizaci a plánování cesty robota. Praktická část práce se zabývá návrhem a implementací mravenčích algoritmů pro plánování cesty robota v jazyce Java.This thesis deals with robot path planning by means of ant colony optimization algorithms. The theoretical part of this thesis introduces basics of path planning problematics. The theoretical part either deals with ant algorithms as optimization and path planning tools. The practical part deals with design and implementation of path planning by means of ant algorithms in Java language.

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

Path planning, modelling and simulation for energy optimised mobile robotics

This thesis is concerned with an investigation of a solution for mobile robotic platforms to minimize the usage of scarce energy that is available and is not wasted following traditionally planned paths for complex terrain environments. This therefore addresses the need to reduce the total energy cost during a field task or mission. A path planning algorithm is designed by creating a new approach of artificial potential field method that generates a planned path, utilising terrain map. The new approach has the capability of avoiding the local minimum problems which is one of the major problems of traditional potential field method. By solving such problems gives a reliable solution to establish a required path. Therefore the approach results in an energy efficient path of the terrain identified, instead obvious straight line of the terrain. A literature review is conducted which reviews the mainstream path planning algorithms with the applications in mobile robotic platforms was analysed. These path planning algorithms are compared for the purpose of energy optimized planning, which concludes the method of artificial potential field as the path planning algorithm which has the most potential and will be further investigated and improved in this research. The methodology of designing, modelling and simulating a mobile robotic platform is defined and presented for the purpose of energy optimized path planning requirement. The research is to clarify the needs, requirements, and specifications of the design. A complete set of models which include mechanical and electrical modelling, functional concept modelling, modelling of the system are established. Based on these models, an energy optimized path planning algorithm is designed. The modelling of force and the kinematics is established to validate and evaluate the result of the algorithm through simulations. Moreover a simulation environment is established which is constructed for multi perspective simulation. This also enables collaborative simulation using Simulink and ADAMS to for simulating a path generated by the path planning algorithm and assess the energy consumption of the driven and steering mechanism of an exemplar system called AgriRover. This simulation environment allows the capture of simulated result of the total energy consumption, therefore outlines the energy cost behaviour of the AgriRover. A total of two sets of paths was tested in the fields for validation, one being generated by the energy optimized path planning algorithm and the other following a straight path. During the field tests the total cost of energy was captured . Two sets of results are compared with each other and compared with the simulation. The comparison shows a 21.34% of the energy saving by deploying the path generated with the energy optimized path planning algorithm in the field test. This research made the following contribution to knowledge. A comparison and grading of mainstream path planning algorithms from energy optimisation perspective is undertaken using detailed evaluation criteria, including computational power required, extendibility, flexibility and more criteria that is relevant for the energy optimized planning purpose. These algorithms have not been compared from energy optimisation angle before, and the research for energy optimised planning under complex terrain environments have not been investigated. Addressing these knowledge gaps, a methodology of designing, modelling and simulating a mobile platform system is proposed to facilitate an energy optimized path planning. This , leads to a new approach of path planning algorithm that reduces unnecessary energy spend for climbing of the terrain, using the terrain data available. Such a methodology derives several novel methods: Namely, a method for avoiding local minimum problem for artificial potential field path planning using the approach of approximation; A method of achieving high expendability of the path planning algorithm, where this method is capable of generate a path through a large map in a short time; A novel method of multi perspective dynamic simulation, which is capable of simulating the behaviour of internal mechanism and the overall robotic mobile platform with the fully integrated control, The dynamic simulation enables prediction of energy consumption; Finally, a novel method of mathematically modelling and simplifying a steering mechanism for the wheel based mobile vehicle was further investigated.This thesis is concerned with an investigation of a solution for mobile robotic platforms to minimize the usage of scarce energy that is available and is not wasted following traditionally planned paths for complex terrain environments. This therefore addresses the need to reduce the total energy cost during a field task or mission. A path planning algorithm is designed by creating a new approach of artificial potential field method that generates a planned path, utilising terrain map. The new approach has the capability of avoiding the local minimum problems which is one of the major problems of traditional potential field method. By solving such problems gives a reliable solution to establish a required path. Therefore the approach results in an energy efficient path of the terrain identified, instead obvious straight line of the terrain. A literature review is conducted which reviews the mainstream path planning algorithms with the applications in mobile robotic platforms was analysed. These path planning algorithms are compared for the purpose of energy optimized planning, which concludes the method of artificial potential field as the path planning algorithm which has the most potential and will be further investigated and improved in this research. The methodology of designing, modelling and simulating a mobile robotic platform is defined and presented for the purpose of energy optimized path planning requirement. The research is to clarify the needs, requirements, and specifications of the design. A complete set of models which include mechanical and electrical modelling, functional concept modelling, modelling of the system are established. Based on these models, an energy optimized path planning algorithm is designed. The modelling of force and the kinematics is established to validate and evaluate the result of the algorithm through simulations. Moreover a simulation environment is established which is constructed for multi perspective simulation. This also enables collaborative simulation using Simulink and ADAMS to for simulating a path generated by the path planning algorithm and assess the energy consumption of the driven and steering mechanism of an exemplar system called AgriRover. This simulation environment allows the capture of simulated result of the total energy consumption, therefore outlines the energy cost behaviour of the AgriRover. A total of two sets of paths was tested in the fields for validation, one being generated by the energy optimized path planning algorithm and the other following a straight path. During the field tests the total cost of energy was captured . Two sets of results are compared with each other and compared with the simulation. The comparison shows a 21.34% of the energy saving by deploying the path generated with the energy optimized path planning algorithm in the field test. This research made the following contribution to knowledge. A comparison and grading of mainstream path planning algorithms from energy optimisation perspective is undertaken using detailed evaluation criteria, including computational power required, extendibility, flexibility and more criteria that is relevant for the energy optimized planning purpose. These algorithms have not been compared from energy optimisation angle before, and the research for energy optimised planning under complex terrain environments have not been investigated. Addressing these knowledge gaps, a methodology of designing, modelling and simulating a mobile platform system is proposed to facilitate an energy optimized path planning. This , leads to a new approach of path planning algorithm that reduces unnecessary energy spend for climbing of the terrain, using the terrain data available. Such a methodology derives several novel methods: Namely, a method for avoiding local minimum problem for artificial potential field path planning using the approach of approximation; A method of achieving high expendability of the path planning algorithm, where this method is capable of generate a path through a large map in a short time; A novel method of multi perspective dynamic simulation, which is capable of simulating the behaviour of internal mechanism and the overall robotic mobile platform with the fully integrated control, The dynamic simulation enables prediction of energy consumption; Finally, a novel method of mathematically modelling and simplifying a steering mechanism for the wheel based mobile vehicle was further investigated