Students will be able to:
1. Write an NXT-G program for a robot to follow a line
2. Optimize the line following behavior of a robot for a given set of conditions
3. Explain the tradeoffs in Line Follower optimization
Students will be able to:
1. Write an NXT-G program for a robot to follow a line
2. Optimize the line following behavior of a robot for a given set of conditions
3. Explain the tradeoffs in Line Follower optimization
Links
[1] https://stemrobotics.cs.pdx.edu/node/645
[2] https://stemrobotics.cs.pdx.edu/node/646
[3] https://stemrobotics.cs.pdx.edu/node/946
[4] https://stemrobotics.cs.pdx.edu/node/661
[5] https://stemrobotics.cs.pdx.edu/taxonomy/term/40
[6] https://stemrobotics.cs.pdx.edu/taxonomy/term/41
[7] https://stemrobotics.cs.pdx.edu/taxonomy/term/141
[8] https://stemrobotics.cs.pdx.edu/focus-area/computing-science
[9] https://stemrobotics.cs.pdx.edu/focus-area/robotics-hardware
[10] https://stemrobotics.cs.pdx.edu/focus-area/robotics-software
[11] https://stemrobotics.cs.pdx.edu/target-hardwareplatform/nxt
[12] https://stemrobotics.cs.pdx.edu/target-software-platform/nxt-g
[13] https://stemrobotics.cs.pdx.edu/taxonomy/term/26
[14] https://stemrobotics.cs.pdx.edu/node/644