Team Six/Journal

From Maslab 2011

(Difference between revisions)
Jump to: navigation, search
Line 20: Line 20:
Today's checkoff is a planning checkoff!
Today's checkoff is a planning checkoff!
-
'''Possible algorithm for robot''': The algorithm runs as long as the timer is noted less than 3 minutes (180 seconds).  The first ball seen will have its color noted and be saved in a variable called our_color.  As soon as this is established, search the map for goals, the goals are determined as follows: if a yellow wall is seen, drive up to it and use the ir sensor to determine whether or not the depth of the wall varies along its length.  If the wall does vary, save the location of the goal in a list called goals_loc[].  When the number of goals is greater than 2 (or if more than 30 seconds have elapsed), then begin to look for balls.  Whenever a ball is found, look for the nearest goal and transfer the ball to that goal.  Do this as long as the timer has not gone over 2 minutes.  After two minutes, whenever a ball is found, if the distance between the ball and the nearest known wall to the opponents side is less than the distance to the nearest known goal, then save the distance and calculate a random number between 0 and 1 and save it to rand_n.  Should rand_n  > e ^ -(d_togoal-d_towall), throw the ball over the wall, else, throw the ball into the goal.  Stop after 2 minutes, 56 seconds.
+
'''Possible algorithm for robot''': The algorithm runs as long as the timer is noted less than 3 minutes (180 seconds).  The first ball seen will have its color noted and be saved in a variable called our_color.  As soon as this is established, search the map for goals, the goals are determined as follows: if a yellow wall is seen, drive up to it and use the ir sensor to determine whether or not the depth of the wall varies along its length.  If the wall does vary, save the location of the goal in a list called goals_loc[].  When the number of goals is greater than 2 (or if more than 30 seconds have elapsed), then begin to look for balls.  Whenever a ball is found, look for the nearest goal and transfer the ball to that goal.  Do this as long as the timer has not gone over 2 minutes.  After two minutes, whenever a ball is found, if the distance between the ball and the nearest known wall to the opponents side is less than the distance to the nearest known goal, then save the distance and calculate a random number between 0 and 1 and save it to rand_n.  Should rand_n  >   vbce ^ -(d_togoal-d_towall), throw the ball over the wall, else, throw the ball into the goal.  Stop after 2 minutes, 56 seconds.
-
'''Robot strategy'''
+
'''Robot strategy''':
-
'''Schedule'''
+
'''Schedule''': We'll be in lab daily during the week.
 +
 
 +
Michael - Since Maslab is his main IAP commitment, he'll code in the evenings and possibly during the day. 
 +
 
 +
Shawn - Work until 4pm every day, code at night with Michael.
 +
 
 +
Piper (Melissa) - Work on building between lecture (or late mornings when lecture isn't happening) and 7pm daily.
 +
 
 +
Xavier - Work on building between lecture (or late mornings when lecture isn't happening) and 7pm daily.

Revision as of 18:52, 4 January 2011

Contents


January 3rd, 2011

First time writing the date this year, and I (Piper) got it right! W00! Anyway, our team began Maslab in an extremely sleep-deprived state, which made things very amusing. (I was incredibly giggly...) (I am journaling this sleep-deprived. Expect lots of exclamation points and smiley faces!)

Problems we ran into with our code: our "Hello, World!" statement won't print without being in an infinite loop. We're not entirely sure why, but this problem didn't carry over to our Drive class (which we used to get our second component of the checkoff - the robot drove forward for three seconds). This is a good thing, because interrupting the infinite loop didn't work, and we can't make infinity last only three seconds :). After a little debugging, our code successfully drove the robot forward for three seconds and stopped.

With the actual board, we were able to attach our wheels, motors, and castor to our base. We had trouble securing all our wires to the microboard, since the crimping didn't seem to clamp the wires down all the way. We also had to short our emergency stop (due to Maslab adjusting some of the code this year) before our robot could work. But worked it did! And we got a checkoff! And then it broke again! After replacing a fuse and soldering the insides of our battery clips, our attachments were more secure and the robot worked again :).


Things we need to fix tomorrow

[ ] Since one of our motors were initially wired backwards, our ground and power do not follow the standard color convention. We should rewire this.

[ ] Double check to see that when our code decides the robot is moving forward, the robot is moving forward instead of backwards.

January 4th, 2011

Today's checkoff is a planning checkoff!

Possible algorithm for robot: The algorithm runs as long as the timer is noted less than 3 minutes (180 seconds). The first ball seen will have its color noted and be saved in a variable called our_color. As soon as this is established, search the map for goals, the goals are determined as follows: if a yellow wall is seen, drive up to it and use the ir sensor to determine whether or not the depth of the wall varies along its length. If the wall does vary, save the location of the goal in a list called goals_loc[]. When the number of goals is greater than 2 (or if more than 30 seconds have elapsed), then begin to look for balls. Whenever a ball is found, look for the nearest goal and transfer the ball to that goal. Do this as long as the timer has not gone over 2 minutes. After two minutes, whenever a ball is found, if the distance between the ball and the nearest known wall to the opponents side is less than the distance to the nearest known goal, then save the distance and calculate a random number between 0 and 1 and save it to rand_n. Should rand_n > vbce ^ -(d_togoal-d_towall), throw the ball over the wall, else, throw the ball into the goal. Stop after 2 minutes, 56 seconds.

Robot strategy:

Schedule: We'll be in lab daily during the week.

Michael - Since Maslab is his main IAP commitment, he'll code in the evenings and possibly during the day.

Shawn - Work until 4pm every day, code at night with Michael.

Piper (Melissa) - Work on building between lecture (or late mornings when lecture isn't happening) and 7pm daily.

Xavier - Work on building between lecture (or late mornings when lecture isn't happening) and 7pm daily.

Personal tools