The first thing we discussed was the new way to detect collision. While reviewing various websites on collision detection David came across an idea uses distances between center of masses. The way that it works basically is that everytime it moves it calculates the distance between itself and other robots. This works fine for few robots but for many robots over large distances we would be faced with memory issues. So basically once the two robots are a distance exactly twice the radius apart (Diameter of the circle) collision will be eminent.
The details are still in the work but hopefully by next week we will have more detail.

    In terms of what options to give the users, we think its best to give the user approximately 3 options (buttons to press), each option demonstrating different scenarios with variation parameters such as number of robots and size. We plan to implement at least 2 different algorithms with each keeping track of distance and time traveled.
One algorithm we are sure to implement is random motion, which is basically described below.

Random Motion – If a robot detects collision with another robot then it will select any position away from the robot that is still on the screen go there and then later attempt to go back there again.

Were still debating on what other algorithms we should implements but we decided that should not stop us from wanting to create an outline of what the program should look like.