Using Genetic Algorithms with Variable-length Individuals for Planning Two-Manipulators Motion

International Conference on Artificial Neural Networks and Genetic Algorithms. 01/01/1997. NorwichA method based on genetic algorithms for obtaining coordinated motion plans of manipulator robots is presented. A decoupled planning approach has been used; that is, the problem has been decomposed into two subproblems: path planning and trajectory planning. This paper focuses on the second problem. The generated plans minimize the total motion time of the robots along their paths. The optimization problem is solved by evolutionary algorithms using a variable-length individuals codification and specific genetic operators

A study of the effects of clustering and local search on radio network design: evolutionary computation approaches

Eighth International Conference on Hybrid Intelligent Systems. Barcelona, 10-12 September 2008The goal of this paper is twofold. First, we want to make a study about how evolutionary computation techniques can efficiently solve the radio network design problem. For this goal we test several evolutionary computation techniques within the OPLINK experimental framework and compare them. Second, we propose a clustering approach and a 2-OPT in order to improve the results obtained by the evolutionary algorithms. Experiments carried out provide empirical evidence of how clustering-based techniques help in improving all algorithms tested. Extensive computational tests, including ones without clustering and 2-OPT, are performed with three evolutionary algorithms: genetic algorithms, memetic algorithms and chromosome appearance probability matrix algorithms.Publicad

Hierarchical genetic algorithms for composite laminate panels stress optimisation

IEEE International Conference on Systems, Man, and Cybernetics. Tokyo, 12-15 October 1999.Genetic algorithms (GAs) have demonstrated to be a powerful technique for solving optimisation problems. In this article, the problem of optimising the number of plies and their stacking sequence in the design of laminated composite panels is considered. This problem has special features that makes it different from traditional problems in which GAs have been applied, which make the problem a multiobjective optimisation one. Symmetry and equilibrium constraints have also been included in the solution. A modification of the canonical GA is needed and a new perspective for solving this problem by using GA techniques is introduced

Reactive with tags classifier system applied to real robot navigation

7th IEEE International Conference on Emerging Technologies and Factory Automation. Barcelona, 18-21 October 1999.A reactive with tags classifier system (RTCS) is a special classifier system. This system combines the execution capabilities of symbolic systems and the learning capabilities of genetic algorithms. A RTCS is able to learn symbolic rules that allow to generate sequence of actions, chaining rules among different time instants, and react to new environmental situations, considering the last environmental situation to take a decision. The capacity of RTCS to learn good rules has been prove in robotics navigation problem. Results show the suitability of this approximation to the navigation problem and the coherence of extracted rules

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that contribute to its effectiveness: (i) Optimal recombination problem is solved within crossover operator. (ii) A new mutation operator performs a random jump within 3-opt or 4-opt neighborhood. (iii) Greedy constructive heuristic of W.Zhang and 3-opt local search heuristic are used to generate the initial population. A computational experiment on TSPLIB instances shows that the proposed algorithm yields competitive results to other well-known memetic algorithms for asymmetric travelling salesman problem.Comment: Proc. of The 11th International Conference on Large-Scale Scientific Computations (LSSC-17), June 5 - 9, 2017, Sozopol, Bulgari

Driving Cars by Means of Genetic Algorithms

Proceedings of: 10th International Conference on Parallel Problem Solving From Nature, PPSN 2008. Dortmund, Germany, September 13-17, 2008The techniques and the technologies supporting Automatic Vehicle Guidance are an important issue. Automobile manufacturers view automatic driving as a very interesting product with motivating key features which allow improvement of the safety of the car, reducing emission or fuel consumption or optimizing driver comfort during long journeys. Car racing is an active research field where new advances in aerodynamics, consumption and engine power are critical each season. Our proposal is to research how evolutionary computation techniques can help in this field. As a first goal we want to automatically learn to drive, by means of genetic algorithms, optimizing lap times while driving through three different circuits.Publicad