Dynamic robot scheduling using a genetic algorithm

This paper describes a genetic algorithm that was developed for optimizing plans in a robotic competition. The algorithm was used both as a static planner, making plans before matches, and as a dynamic replanner during matches, a task with much stricter demands of efficiency. The genetic algorithm was hybridized with a local search technique, which experiments proved essential to finding good solutions in this complex task. To enable rapid response under environmental changes, a heuristic for immediate response and a contingency planning module were also implemented. Experiments proved that the algorithm was able to generate good plans, and continuously modify them in light of a rapidly changing environment.

[1]  Xia Wang,et al.  Using a Genetic Algorithm to Solve the Generalized Orienteering Problem , 2008 .

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  C. Donaldson.  Feed the world , 2022, New Scientist.

[4]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[5]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[6]  Aimin Zhou,et al.  Solving dynamic TSP with evolutionary approach in real time , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[7]  Kai Olav Ellefsen,et al.  Dynamic Scheduling for Autonomous Robotics , 2010 .

[8]  Enrique Alba,et al.  Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm , 2006, Inf. Process. Lett..

[9]  Yu-Wang Chen,et al.  Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling , 2008 .

[10]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[11]  M. Troszyński.  Eurobot 2010 - Feed the World , 2010 .

[12]  M. F. Tasgetiren,et al.  A Genetic Algorithm with an Adaptive Penalty Function for the Orienteering Problem , 2005 .

[13]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[14]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[15]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[16]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[17]  Zhao Liu,et al.  A Hybrid Algorithm of n-OPT and GA to Solve Dynamic TSP , 2003, GCC.