A tutorial, using NeHe's code as a base, to trace a ray, perform a shortest path algorithm, find points relative to the screen, and other things. This will eventually become a rpg tactics game with the use of OpenGL.
Solution for the Travelling Salesman Problem using genetic algorithm. Speed, particularly at large data volumes, is of essence. The project uses advanced variants of cross-over and mutation algorithms in order to expedite search in the solution space.
Clustering problems are solved using various techniques such as SOM and K-Means. The generic problem involves multi-attribute sample points, with variable weights. We use Genetic Algorithms to build a scalable, generic & easy to use solution.
Depending on a SICK lasescan and a created environment landscape a routing function will be implemented to give a robot a few waypoint to drive from a start point to a choosen destination.