During these days, because classes have already started we didn't got the time to get together, therefore we've been advancing on tasks we can do by ourselves.
We have now finished an implementation in C# of a class to solve the "Traveling salesman problem" based on the book "A java library of graph algorithms and optimization" by Hang T. Lau. We will use this as an agent in Artificial Intelligence for discovering the fastest way between 3 points and return "home".
We also designed a flowchart with a new algorithm for the Chasso navigation. With the changes made we hope to circumvent the performance and latency problems we were having. Now we are going to implement it and do some tests. Probably more news on this will be available next weekend.
